Search arXivSearch

arXiv · 2509.00556

Affine Equivalence of Subsets of $\mathbb{F}_2^n$ via Venn Diagrams and Applications to Sidon Sets

Abstract

Two subsets $S$ and $T$ of $\mathbb{F}_2^n$ are \textit{affinely equivalent} if there is an affine automorphism of $\mathbb{F}_2^n$ taking $S$ to $T$. Given a basis of the affine span of $S$, we can construct a Venn diagram whose regions partition $S$. We prove that any two bases of $\operatorname{aff}(S)$ will have the same Venn diagram up to a linear permutation of the Venn regions. Moreover, we prove that two sets are affinely equivalent if and only if there is a cardinality-preserving linear permutation from the Venn regions of $S$ to the Venn regions of $T$. We use these results to classify certain Sidon sets up to affine equivalence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kariane Calta, Sarah Covey, Timothy E. Goldberg, Lauren L. Rose, Daniel Rose-Levine. 2025-08-30. Affine Equivalence of Subsets of $\mathbb{F}_2^n$ via Venn Diagrams and Applications to Sidon Sets. https://arxiv.org/abs/2509.00556

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO