◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Taranchuk

4 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author1
  • last author1

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.CO4

identity via Semantic Scholar / OpenAlex

activity
20172021
most citedOn the number of k-gons in finite projective planes

1 citations · 1 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2021

A New Family of Algebraically Defined Graphs With Small Automorphism Group

Felix Lazebnik, Vladislav Taranchuk

Let p be an odd prime, q=pe, e≥1, and F=Fq​ denote the finite field of q elements. Let f:F2→F and $g: \mathbb{F}^3\to \ma…

math.CO2021★ 1 cited

On the number of k-gons in finite projective planes

Vladislav Taranchuk

Let Π be a projective plane of order n and ΓΠ​ be its Levi graph (the point-line incidence graph). For fixed k≥3, let c2k​(ΓΠ​) denote the number of 2k-cycles in…

math.CO2018

The Anti-Ramsey Problem for the Sidon equation

Vladislav Taranchuk, Craig Timmons

For n≥k≥4, let ARX+Y=Z+Tk​(n) be the maximum number of rainbow solutions to the Sidon equation X+Y=Z+T over all k-colorings c:[n]→[k].…

math.CO2017

A Constructive Lower Bound on Szemerédi's Theorem

Vladislav Taranchuk

Let rk​(n) denote the maximum cardinality of a set A⊂{1,2,…,n} such that A does not contain a k-term arithmetic progression. In this paper, we give a metho…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.