SearcharxivSearch

arXiv · 2503.15440

Counting $\mathbb F_q$-points of orbital varieties in ad-nilpotent ideals of type $A_n$

Abstract

Let $\mathfrak b_n(\mathbb F_q)$ denote the Lie algebra of upper triangular $n\times n$ matrices over the finite field $\mathbb F_q$, and let $\mathfrak u_n(\mathbb F_q)$ be the nilradical of $\mathfrak b_n$. For every $\mathfrak b_n(\mathbb F_q)$-stable ideal $\mathfrak a$ of $\mathfrak u_n(\mathbb F_q)$, and every partition $\mu$ of $n$, we prove two formulas for the number of elements of $\mathfrak a$ of Jordan type $\mu$: the first one is the Hall scalar product of a modified Hall-Littlewood function indexed by $\mu$ and a chromatic quasisymmetric function associated to $\mathfrak a$, and the second one is in terms of an explicit collection of standard tableaux. In the special case that $\mathfrak a$ is the nilradical $\mathfrak u_\Lambda(\mathbb F_q)$ of the parabolic subalgebra associated to a composition $\Lambda$ of $n$, our first formula reduces to a result of Karp and Thomas: up to an explicit polynomial factor in $q$, the number of elements in $\mathfrak u_\Lambda(\mathbb F_q)$ of Jordan type $\mu$ is equal to the coefficient of the monomial $\mathsf x^\Lambda$ in the specialization of the dual Macdonald symmetric function $\mathrm Q_{\mu'}(\mathsf x;q^{-1},t)$ at $t=0$. We give three applications: (1) a formula for the number of points of a nilpotent Hessenberg variety, (2) a formula for the number of $X\in \mathfrak u_\Lambda(\mathbb F_q)$ that satisfy $X^2=0$, which in the special case $\Lambda=(1^n)$ is different from the Kirillov-Melnikov-Ekhad-Zeilberger formula, and (3) a formula for the number of double cosets $\mathrm U_1\backslash\mathrm{GL}_n(\mathbb F_q)/\mathrm U_2$ where $\mathrm U_1$ and $\mathrm U_2$ are unipotent subgroups corresponding to two $\mathfrak b_n(\mathbb F_q)$-stable ideals.

Explore related subjects

Keep this discovery

BibTeXRIS

Mohammad Bardestani, Keivan Mallahi-Karai, Samrith Ram, Hadi Salmasian. 2025-03-19. Counting $\mathbb F_q$-points of orbital varieties in ad-nilpotent ideals of type $A_n$. https://arxiv.org/abs/2503.15440

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

KEEP EXPLORING

Related papers

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO