Searcharxiv⌕ Search

arXiv subjects

Andreas Volkmann

Publications and source records attributed to Andreas Volkmann.

6 recordsLinked to original sources

Affine extensions and central compression for product-one-free sequences

Let $H_s=H_{27}\times C_3^s$, where $H_{27}$ is the nonabelian group of order $27$ and exponent three. We study the elements which can be adjoined to a product-one-free sequence $L$ of length $2s+5$. Let $Q$ be its central subsequence and let $h$ be the dimension of the subgroup generated by $Q$. If $2h-|Q|\le1$, all admissible individual extensions lie in one affine hyperplane of the full additive group coordinates, avoiding the identity. The proof combines coefficient identities with finite, explicitly verified configurations and a transfer valid in every dimension. We also prove an exact central compression theorem: a central zero-sum-free block of length $2h-1$ can be replaced by one term after quotienting by an $(h-1)$-dimensional central subgroup, with a forward implication for product-one-freeness and admissible extensions. For the extraspecial group $E_2$ of order $3^5$ and exponent three, a finite stress obstruction and central compression yield a further uniform restriction: in any product-one-free sequence of length $2r+11$ over $E_2\times C_3^r$, the central subsequence is nonempty and has length at most $2h-2$, where $h$ is its full central rank.

math.CO↗

The small Davenport constant of $E_2\times C_3^r$ for $0\le r\le3$

Let $E_2$ be the extraspecial group of order $3^5$ and exponent three. We prove that $d(E_2\times C_3^r)=2r+10$ for $0\le r\le3$. The upper bounds follow from signed zero-block identities and two finite statements in the four-dimensional symplectic space over $\mathbb F_3$. The first supplies edge weights for all completable balanced triangles on any indexed list of at most sixteen nonzero vectors. The second supplies weights for the direction families that can occur in a critical list with no central terms. We give complete coverage arguments, exact certificate files, and separately implemented checking programs. A compression argument removes any need for an induction through smaller list lengths in the sixteen-term potential theorem. The formula for $r\ge4$ remains open.

math.CO↗

A twelve-term exclusion for the small Davenport constant of $E_2\times C_3^r$

Let $E_2$ be the extraspecial group of order $3^5$ and exponent three. For every $r\ge1$, we prove that a product-one-free sequence of length $2r+11$ over $E_2\times C_3^r$ cannot contain exactly $2r-1$ central terms. Thus the critical layer with twelve noncentral terms is excluded. The proof combines a relative moment criterion for abelian normal subgroups with a finite theorem in a symplectic four-space over $\mathbb F_3$. Under explicit subspace occupancy bounds, the family of balanced triangles that can actually be completed to a nonfull zero-sum block admits edge weights summing to one on every triangle. A dual cycle argument reduces this assertion to a potential condition on branching edges. All remaining configurations contain one of eleven minimal frames; two separately implemented exhaustive checks verify all their admissible extensions. The unrestricted check has 9544046 leaves. Complete source code and execution records are supplied. The exact value of $\mathsf{d}(E_2\times C_3^r)$ for arbitrary $r$ is not determined by this result.

math.CO↗

The small Davenport constant of $H_{27}\times C_3^r$

Let $H_{27}=\mathrm{UT}_3(\mathbb{F}_3)$ be the nonabelian group of order $27$ and exponent $3$. We prove that $\mathsf{d}(H_{27}\times C_3^r)=2r+6$ for every integer $r\geq0$. The proof combines an affine coefficient identity in the group algebra of an elementary abelian group with a decomposition of the nonorthogonality graph of $\mathbb{F}_3^2$ into eight edge-disjoint zero-sum triangles. It is uniform in $r$, does not use the value of the small Davenport constant for a smaller nonabelian group, and requires no computational enumeration.

math.CO↗

A Uniform Proof for the Small Davenport Constant of the Exponent-$p$ Heisenberg Group

Let $p$ be an odd prime and let $H_{p^3}=\operatorname{UT}_3(\mathbb{F}_p)$ be the Heisenberg group of order $p^3$ and exponent $p$. We prove $\mathsf{d}(H_{p^3})=3p-3$. The main ingredient of the proof is an order-value growth theorem. If $B$ is a noncollinear zero-sum sequence of $n$ nonzero vectors in $\mathbb{F}_p^2$, then the alternating areas obtained by ordering $B$ assume at least $\min(p,n-1)$ distinct values. Its proof is a short contraction induction: contract a suitable independent pair, replace the contracted vector in both orders, and apply Cauchy--Davenport. A polynomial relative-subsum theorem and a sharp representation-rigidity lemma then turn this local growth into a uniform spread bound. Combined with the standard product-one criterion for $H_{p^3}$, the spread bound yields the upper bound; the usual sequence $x^{p-1}y^{p-1}v^{p-1}$ gives the lower bound.

math.CO↗

The small Davenport constant of the Heisenberg group of order 343

For a finite group $G$, let $\mathsf{d}(G)$ denote the maximum length of a sequence having no nonempty subsequence whose terms can be ordered to have product one. For an odd prime $p$, let $H_{p^3}=\operatorname{UT}*3(\mathbb{F}*p)$. Godara and Sarkar proved $\mathsf{d}(H*{27})=6$ and conjectured $\mathsf{d}(H*{p^3})=3p-3$; in a recent preprint, White proved the next case $\mathsf{d}(H_{125})=12$ and left $18\leq\mathsf{d}(H_{343})\leq24$. We prove $\mathsf{d}(H_{343})=18$. We adopt White's product-one criterion and spread framework and develop a $p=7$-specific direction stratification. An explicit product-one-free sequence gives the lower bound. For the upper bound, we stratify a hypothetical product-one-free sequence of length $19$ by the number of central terms and by the occupied projective directions of its quotient multiset. Supports on at most two directions are excluded by a theoretical argument whose finite auxiliary statements are exhaustively checked; the three-direction case and the case of five central terms are settled by exact finite computations. The remaining thirty strata are encoded by a counterexample-guided SAT procedure. A separately implemented checker verifies all $9{,}920{,}815$ seed cuts and all $27{,}207$ learned cuts, and each final unsatisfiable instance is accompanied by a checked LRAT certificate. A separate implementation-level audit verifies the master encoding, the proof archives, and the lower-bound witness.

math.CO↗