Search arXivSearch

arXiv · 2603.08041

A generalization of Kadell's orthogonality ex-conjecture

Abstract

In 2000, Kadell gave an orthogonality conjecture for a symmetric function generalization of the Zeilberger--Bressoud $q$-Dyson constant term identity. The non-zero part of Kadell's conjecture is a constant term identity indexed by a weak composition $v$. This conjecture was first proved by Károlyi, Lascoux and Warnaar in 2015. They further formulated a closed-form expression for the above constant term when all parts of the composition $v$ are distinct. In 2021, Zhou obtained a recursion for this constant term for an arbitrary composition $v$. In this paper, by categorizing the variables into two parts, we generalize Zhou's result.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zihao Huang, Wenlong Jiang, Yue Zhou. 2026-05-18. A generalization of Kadell's orthogonality ex-conjecture. https://arxiv.org/abs/2603.08041

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