Search arXivSearch

arXiv · 1903.03881

On rich and poor directions determined by a subset of a finite plane

Abstract

We generalize to sets with cardinality more than $p$ a theorem of Rédei and Szőnyi on the number of directions determined by a subset $U$ of the finite plane $\mathbb F_p^2$. A $U$-rich line is a line that meets $U$ in at least $\#U/p+1$ points, while a $U$-poor line is one that meets $U$ in at most $\#U/p-1$ points. The slopes of the $U$-rich and $U$-poor lines are called $U$-special directions. We show that either $U$ is contained in the union of $n=\lceil\#U/p\rceil$ lines, or it determines `many' $U$-special directions. The core of our proof is a version of the polynomial method in which we study iterated partial derivatives of the Rédei polynomial to take into account the `multiplicity' of the directions determined by $U$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Ghidelli. 2019-03-09. On rich and poor directions determined by a subset of a finite plane. https://arxiv.org/abs/1903.03881

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO