Search arXivSearch

arXiv · 2608.17367

On the Hidden Pascal Symmetry and Moment Constraints of Vector Representatives in Quebbemann's 64-Dimensional Lattice

Abstract

In this paper, we investigate the underlying algebraic and combinatorial structures governing the coset representatives (shift vectors) for Construction A of lattices, with a particular focus on equations (14) and (15) presented in Paragraph 3, Chapter 8 of the seminal work by J.H. Conway and N.J.A. Sloane, "Sphere Packings, Lattices and Groups". These dual equations define the boundary conditions for the analytical generation of the 64-dimensional Quebbemann lattice (Q64). We prove that seeking non-zero solutions constrained by arithmetic or geometric progressions yields a structural collapse to the trivial zero vector due to the transcendental nature of π. Conversely, by relaxing these bounds to unique coordinate configurations, we uncover an exact, closed-form algebraic core governed by the alternating coefficients of the Pascal triangle. Furthermore, we implement an energy-minimization model via continuous-to-discrete projection that yields an optimal shift vector with a strictly integer Euclidean norm ||z||^2 = 20.000000. Finally, we bridge this formulation to the Repeated Differences paradigm of Craig's lattices Anm, showing how the spectral components of the Θ-series are naturally filtered by these binomial structures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nick Vorobtsov. 2026-08-23. On the Hidden Pascal Symmetry and Moment Constraints of Vector Representatives in Quebbemann's 64-Dimensional Lattice. https://arxiv.org/abs/2608.17367

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