Search arXivSearch

arXiv · 2606.27497

Enumerating matrices with prescribed entries in an adjoint orbit

Abstract

We study intersections of conjugacy classes of square matrices over a finite field with affine coordinate subspaces, or equivalently matrices in a fixed adjoint orbit with prescribed entries. Our main result treats the case of prescribed columns: for a partially defined linear map we give a Hall scalar product formula for the number of extensions to an endomorphism with prescribed similarity invariants. This formula is expressed in terms of skew modified Hall--Littlewood functions and $q$-Whittaker functions. As applications, we count monic matrix polynomials over $\mathbb{F}_q$ with prescribed Smith normal form and with prescribed determinant, and recover the Gerstenhaber--Reiner formula for the number of square matrices with a fixed characteristic polynomial. We also note that known point-count formulas for Hessenberg varieties imply related formulas for Hessenberg supports involving chromatic quasisymmetric functions, motivating polynomiality questions for more general supports and prescribed affine slices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samrith Ram. 2026-06-25. Enumerating matrices with prescribed entries in an adjoint orbit. https://arxiv.org/abs/2606.27497

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