Search arXivSearch

arXiv · 2407.11783

Uniform exclude distributions of Sidon sets

Abstract

A Sidon set $S$ in $\mathbb{F}_2^n$ is a set such that the pairwise sums of distinct points are all distinct. The exclude points of a Sidon set $S$ are the sums of three distinct points in $S$, and the exclude multiplicity of a point in $\mathbb{F}_2^n \setminus S$ is the number of such triples in $S$ it is equal to. We call the function $d_S \colon \mathbb{F}_2^n \setminus S \to \mathbb{Z}_{\geq 0}$ taking points in $\mathbb{F}_2^n \setminus S$ to their exclude multiplicity the exclude distribution of $S$. We say that $d_S$ is uniform on $\mathcal{P}$ if $\mathcal{P}$ is an equally-sized partition $\mathcal{P}$ of $\mathbb{F}_2^n \setminus S$ such that $d_S$ takes the same values an equal number of times on every element of $\mathcal{P}$. In this paper, we use APN plateaued functions with all component functions unbalanced to construct Sidon sets $S$ in $(\mathbb{F}_2^n)^2$ whose exclude distributions are uniform on natural partitions of $(\mathbb{F}_2^n)^2 \setminus S$ into $2^n$ elements. We use this result and a result of Carlet to determine exactly what values the exclude distributions of the graphs of the Gold and Kasami functions take and how often they take these values.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Darrion Thornburgh. 2024-07-16. Uniform exclude distributions of Sidon sets. https://arxiv.org/abs/2407.11783

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