Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.09750

Principal-unit Di\c{t}\u{a}-type Butson matrices: character-table transitions, fractional-linear automorphisms, Weyl thresholds, and polarized Heisenberg windows

Richard Scarlini
View original source ↗Read source document ↗Export metadata ↓

Abstract

For an odd prime $p$ and integers $r,q\ge 1$, we study the Butson-type complex Hadamard matrices $H_{p;r,q}(a,b)=\chi(1+p^r ab)$ on $\mathbb{Z}/p^q\mathbb{Z}$, where $\chi$ is a faithful character of the principal-unit quotient. The defining phase is the normalized $p$-adic logarithm, linear modulo $p^q$ exactly when $q\le r$ and nonlinear when $q>r$. We prove that this threshold simultaneously governs monomial equivalence to a finite abelian character table, the cocycle property of the canonical cyclic $2$-cochain, and projective scalarity of the canonical Weyl commutator. We classify the full projective monomial automorphism group as a three-parameter fractional-linear group of order $p^{2q}\varphi(p^q)$, with inverse limit a $\Gamma_0(p^r)$-type congruence subgroup of $\mathrm{PGL}_2(\mathbb{Z}_p)$. For $q>r$, scalar commutators survive on exactly $q-r+1$ maximal valuation-polarized windows; after quotienting radicals, each carries the standard perfect pairing on two cyclic groups of order $p^r$ and the associated finite Heisenberg extension. We determine the exact normalizers of these windows and prove distinct polarizations are pairwise nonconjugate inside the projective monomial group. Finally, abelianization separates $H_{p;r,q}$ from the Fourier matrix $F_{p^q}$ for every $q>r$; low-order defect and fingerprint computations illustrate why this group-theoretic invariant is stronger on the family.

Explore related subjects

math.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Richard Scarlini. 2026-08-10. Principal-unit Di\c{t}\u{a}-type Butson matrices: character-table transitions, fractional-linear automorphisms, Weyl thresholds, and polarized Heisenberg windows. https://arxiv.org/abs/2608.09750

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

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗