Search arXivSearch

arXiv · 2608.17431

A Newton Identity and Finite-Rank Reconstruction for the Queer Lie Superalgebra

Abstract

We establish a Newton-type identity for the queer Lie superalgebra $\mathfrak q_N$, relating Sergeev's odd cyclic central elements to Nazarov's one-row Capelli elements. The identity is obtained by comparing Ivanov's generating function for factorial Schur $Q$-functions with the queer Perelomov-Popov product of Grigoryev and Nazarov. Its coefficient expansion yields a triangular change of generators between the odd cyclic and odd one-row families. In particular, the odd one-row Capelli elements generate the center, while the even one-row elements are redundant. In fixed rank, we derive determinantal relations and a generic reconstruction theorem. The basic cyclic Hankel determinant is identified with a resultant and factored into the failure-of-strong-typicality and shifted-resonance factors. After localization at this determinant, the center is generated by the first $2N$ odd cyclic elements; consequently, generic central characters are determined by their values on these elements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abhishek Das, Santosha Pattanayak. 2026-08-18. A Newton Identity and Finite-Rank Reconstruction for the Queer Lie Superalgebra. https://arxiv.org/abs/2608.17431

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