English
Related papers

Related papers: Bijective proofs of skew Schur polynomial factoriz…

200 papers

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

Combinatorics · Mathematics 2015-07-27 Marie Albenque , Dominique Poulalhon

The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…

Combinatorics · Mathematics 2025-07-22 Elena L. Wang , Guoce Xin

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…

Combinatorics · Mathematics 2017-03-23 Sami Assaf

In this paper, we study a certain type of Hurwitz numbers which count branched covers over the Riemann sphere admitting several branch points with fixed ramification types, one branch point with a fixed number of preimages, and one branch…

Combinatorics · Mathematics 2025-05-19 Zhiyuan Wang , Chenglang Yang

A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…

Discrete Mathematics · Computer Science 2025-07-02 Jan Bok , Jiří Fiala , Nikola Jedličková , Jan Kratochvíl

In this paper all of the classical constructions of A. Young are generalized to affine Hecke algebras of type A. It is proved that the calibrated irreducible representations of the affine Hecke algebra are indexed by placed skew shapes and…

Representation Theory · Mathematics 2007-05-23 Arun Ram

We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…

Data Structures and Algorithms · Computer Science 2020-10-16 Vijay V. Vazirani

We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…

Combinatorics · Mathematics 2015-03-17 Alejandro H. Morales , Ekaterina A. Vassilieva

We introduce two vertex operators to realize skew odd orthogonal characters $so_{\lambda/\mu}(x^{\pm})$ and derive the Cauchy identity for the skew characters via Toeplitz-Hankel-type determinant similar to the Schur functions. The method…

Representation Theory · Mathematics 2025-10-13 Naihuan Jing , Zhijun Li , Danxia Wang , Chang Ye

We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The…

Combinatorics · Mathematics 2009-04-02 Sarah Mason

It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…

Combinatorics · Mathematics 2025-04-08 Sergi Elizalde

We continue the study of separable elements in finite Weyl groups. These elements generalize the well-studied class of separable permutations. We show that the multiplication map $W/U \times U \to W$ is a length-additive bijection, or…

Combinatorics · Mathematics 2020-11-03 Christian Gaetz , Yibo Gao

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

Combinatorics · Mathematics 2024-12-31 Graham Hawkes

Bargraphs are a special class of convex polyominoes. They can be identified with lattice paths with unit steps north, east, and south that start at the origin, end on the $x$-axis, and stay strictly above the $x$-axis everywhere except at…

Combinatorics · Mathematics 2017-05-18 Emeric Deutsch , Sergi Elizalde

A Gelfand model for a semisimple algebra A over C is a complex linear representation that contains each irreducible representation of A with multiplicity exactly one. We give a method of constructing these models that works uniformly for a…

Representation Theory · Mathematics 2014-05-28 Tom Halverson , Mike Reeks

We give a complete characterization of the positive trigonometric polynomials Q(\theta,\phi) on the bi-circle, which can be factored as Q(\theta,\phi)=|p(e^{i\theta},e^{i\phi})|^2 where p(z,w) is a polynomial nonzero for |z|=1 and |w|\leq…

Complex Variables · Mathematics 2014-10-23 Jeffrey S. Geronimo , Plamen Iliev

The two tableaux assigned by the Robinson--Schensted correspondence are equal if and only if the input permutation is an involution, so the RS algorithm restricts to a bijection between involutions in the symmetric group and standard…

Combinatorics · Mathematics 2025-03-18 Eric Marberg , Yifeng Zhang

We introduce a class of Schur type functions associated with polynomial sequences of binomial type. This can be regarded as a generalization of the ordinary Schur functions and the factorial Schur functions. This generalization satisfies…

Representation Theory · Mathematics 2008-11-04 Minoru Itoh

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

Combinatorics · Mathematics 2019-08-13 Hillary S. W. Han , Christian M. Reidys

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

Combinatorics · Mathematics 2018-10-09 Jane Y. X. Yang