Search arXivSearch

arXiv · 2609.23224

Symmetry reductions and recurrence degrees for banded Toeplitz determinants and permanents

Abstract

This paper studies symmetry-induced reductions of scalar recurrence complexity for balanced banded Toeplitz determinants and permanents. Three mechanisms emerge: determinant state and spectral compression, exceptional permanent--determinant conversion, and symmetries of permanent state spaces. For symmetric determinants, straightening reduces the row-column states from $\binom{2m}{m}$ to the Catalan number $C_{m+1}$; primitive symplectic weight compression then leaves $(3^m+1)/2$ distinct autonomous modes. Skew symmetry has a parallel compound/Hodge explanation: the middle exterior representation splits into two Hodge halves of dimension $\binom{2m}{m}/2$, the one-step compound transfer exchanges the halves, and its two-step restriction has $3^{m-1}$ generic ternary modes. Thus the full skew bound is $2\cdot3^{m-1}$. Widom--Hankel arguments prove generic scalar minimality in both symmetry classes, and every even skew Toeplitz determinant admits an explicit half-size square factorization. For the zero-diagonal pentadiagonal support, a Pólya--Kasteleyn signing converts every permanent to a determinant. Among consecutive zero-diagonal two-sided bands, universal entrywise conversion---and separately Toeplitz diagonal-wise conversion---occurs only in the Hessenberg families and this pentadiagonal case. Paired renewal identities recover all restored-diagonal determinant and permanent layers. For permanents, transposition gives the open symmetric bound $(\binom{2m}{m}+2^m)/2$, while cyclic defect-sector pairing gives $(4^m+\binom{2m}{m})/2$. Skew-symmetry forces odd-size vanishing and corresponding even-subsequence bounds. In semibandwidth two the open symmetric bound is generically sharp; higher-semibandwidth permanent minimality is left separate from the symmetry reductions proved here.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Max A. Alekseyev, Dmitry I. Khomovsky. 2026-09-19. Symmetry reductions and recurrence degrees for banded Toeplitz determinants and permanents. https://arxiv.org/abs/2609.23224

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

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA