English
Related papers

Related papers: Bijections between different combinatorial models …

200 papers

We introduce, characterise and provide a combinatorial interpretation for the so-called $q$-Jacobi-Stirling numbers. This study is motivated by their key role in the (reciprocal) expansion of any power of a second order $q$-differential…

Classical Analysis and ODEs · Mathematics 2015-07-07 Ana F. Loureiro , Jiang Zeng

Identities between Whittaker and modified Bessel functions are derived for particular complex orders. Certain polynomials appear in such identities, which satisfy a fourth order differential equation (not of hypergeometric type), and they…

Mathematical Physics · Physics 2007-05-23 James Lucietti

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

Combinatorics · Mathematics 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu

We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde , Igor Pak

The $(q,r)$-Whitney numbers were recently defined in terms of the $q$-Boson operators, and several combinatorial properties which appear to be $q$-analogues of similar properties were studied. In this paper, we obtain elementary and…

Number Theory · Mathematics 2017-12-22 Mahid M. Mangontarum

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.

Combinatorics · Mathematics 2023-02-15 Seung Jin Lee , Jaeseong Oh , Brendon Rhoades

The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…

Combinatorics · Mathematics 2007-05-23 L. Lapointe , J. Morse

We give a Hecke algebra derivation of Macdonald's expansion formula for Hall-Littlewood polynomials in terms of semistandard Young tableaux. This is accomplished by first obtaining a Hecke algebra lift of the expansion coefficients and then…

Combinatorics · Mathematics 2024-07-23 Aritra Bhattacharya

We relate the combinatorics of Hall-Littlewood polynomials to that of abelian $p$-groups with alternating or Hermitian perfect pairings. Our main result is an analogue of the classical relationship between the Hall algebra of abelian…

Combinatorics · Mathematics 2026-01-14 Jiahe Shen , Roger Van Peski

In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…

Number Theory · Mathematics 2016-06-07 Mohamed El Bachraoui

We provide a combinatorial description of the coefficients appearing in the expansion of Hall-Littlewood polynomials in terms of monomial symmetric functions. We also give a Littlewood-Richardson rule for Hall-Littlewood polynomials. For…

Combinatorics · Mathematics 2007-06-13 Christoph Schwer

We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…

Combinatorics · Mathematics 2016-02-24 Jan de Gier , Michael Wheeler

A string theoretic derivation is given for the conjecture of Hausel, Letellier, and Rodriguez-Villegas on the cohomology of character varieties with marked points. Their formula is identified with a refined BPS expansion in the stable pair…

High Energy Physics - Theory · Physics 2015-06-17 Wu-yen Chuang , Duiliu-Emanuel Diaconescu , Ron Donagi , Tony Pantev

We describe two general mechanisms for producing pairing bijections (bijective functions defined from N x N to N). The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct…

Mathematical Software · Computer Science 2013-01-03 Paul Tarau

It is shown that the Whitney function of a representable q-matroid and the collection of all higher weight enumerators of any representing rank-metric code determine each other via a monomial substitution. Moreover, the q-matroid itself and…

Combinatorics · Mathematics 2025-09-29 Heide Gluesing-Luerssen , Benjamin Jany

The Myhill isomorphism is a variant of the Cantor-Bernstein theorem. It states that, from two injections that reduces two subsets of $\mathbb{N}$ to each other, there exists a bijection $\mathbb{N} \to \mathbb{N}$ that preserves them. This…

Logic · Mathematics 2025-07-08 Cécilia Pradic

Recently, Jel\'inek conjectured that there exists a bijection between certain restricted permutations and Fishburn matrices such that the bijection verifies the equidistribution of several statistics. The main objective of this paper is to…

Combinatorics · Mathematics 2018-08-14 Dandan Chen , Sherry H. F. Yan , Robin D. P. Zhou

Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…

Combinatorics · Mathematics 2011-06-16 William Y. C. Chen , Daniel K. Du , Charles B. Mei

We introduce a generalization of bivariate Griffiths polynomials depending on an additional parameter $\lambda$. These $\lambda$-Griffiths polynomials are bivariate, bispectral and biorthogonal. For two specific values of the parameter…

Mathematical Physics · Physics 2023-11-07 N. Crampe , L. Frappat , J. Gaboriaud , E. Ragoucy , L. Vinet , M. Zaimi

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

Combinatorics · Mathematics 2013-01-25 Olcay Coşkun , Müge Taşkın