A combinatorial correspondence between finite Euclidean geometries and symmetric subsets of $\mathbb{Z}/n\mathbb{Z}$
Semin Yoo

TL;DR
This paper establishes a combinatorial link between finite Euclidean geometries and symmetric subsets of cyclic groups, introduces dot-binomial coefficients, and explores their polynomial properties and relations to q-binomial coefficients.
Contribution
It introduces a novel combinatorial correspondence and expresses dot-binomial coefficients in terms of q-binomial coefficients and polynomials, expanding understanding of finite Euclidean geometries.
Findings
Dot-binomial coefficients can be expressed using q-binomial coefficients.
Dot-binomial coefficients are polynomials in q.
The paper reveals properties of the polynomials derived from dot-binomial coefficients.
Abstract
-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter , and revert to the original quantities when goes . An important example is the -analogues of binomial coefficients which give the number of -dimensional subspaces in . When goes to , this reverts to the binomial coefficients which measure the number of -sets in . Dot-analogues of -binomial coefficients were studied by Yoo (2019) in order to investigate combinatorics of quadratic spaces over finite fields. The number of -dimensional quadratic spaces of which are isometrically isomorphic to can be also described as analogous to binomial coefficients, called the dot-binomial coefficients,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
