Search arXivSearch

arXiv · 2210.10215

Lattices in $\mathbb F_q[[T]]^d$ and spiral shifting operators

Abstract

We investigate the algebra and combinatorics of an analogue of the Hermite normal form that classifies finite-index submodules of $\mathbb F_q[[T]]^d$. We identity both normal forms as instances of Gröbner basis theory under different monomial orders, where the Hermite normal form corresponds to the lex order, and the new normal form the hlex order. We note that the hlex normal form recovers the Smith normal form, a feature not enjoyed by the Hermite normal form. We also identify the combinatorial structure underlying the cell decomposition induced by the hlex normal form, which appears to be of independent interest. Notably, the statistics tracking the cell dimensions is compatible, in a certain way, with a collection of $d$ ``spiral shifting operators'' on $\mathbb N^d$, which pairwise commute and collectively act freely and transitively. Using these operators, we give direct proofs of some new combinatorial identities obtained by translating the results of Solomon and Petrogradsky in terms of the hlex normal form.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yifeng Huang, Ruofan Jiang. 2025-08-09. Lattices in $\mathbb F_q[[T]]^d$ and spiral shifting operators. https://doi.org/10.1016/j.aam.2025.102950

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