English
Related papers

Related papers: Generating Functions for Inverted Semistandard You…

200 papers

The purpose of this paper is to characterize one-dimensional local domains, or more in general reduced, in terms of its Macaulay's inverse system. This leads to study almost finitely generated modules in the divided power ring. We…

Commutative Algebra · Mathematics 2024-11-06 Joan Elias , Maria Evelina Rossi

A randomisation of the Berele insertion algorithm is proposed, where the insertion of a letter to a symplectic Young tableau leads to a distribution over the set of symplectic Young tableaux. Berele's algorithm provides a bijection between…

Combinatorics · Mathematics 2017-08-16 Ioanna Nteka

A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…

Combinatorics · Mathematics 2020-09-16 David G. L. Wang , T. Zhao

We show that the 4-variable generating function of certain orientation related parameters of an ordered oriented matroid is the evaluation at (x + u, y+v) of its Tutte polynomial. This evaluation contains as special cases the counting of…

Combinatorics · Mathematics 2012-05-25 Michel Las Vergnas

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

Number Theory · Mathematics 2023-07-18 Yuji Tsuno

Tandem duplication is an evolutionary process whereby a segment of DNA is replicated and proximally inserted. The different configurations that can arise from this process give rise to some interesting combinatorial questions. Firstly, we…

Combinatorics · Mathematics 2016-11-25 L Penso-Dolfin , CD Greenman

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

Group Theory · Mathematics 2026-02-13 Mehmet Yeşil

The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$,…

Combinatorics · Mathematics 2020-04-10 Helmut Prodinger

We consider the multivariate generating series $F_P$ of $P$-partitions in infinitely many variables $x_1, x_2 , \dots$. For some family of ranked posets $P$, it is natural to consider an analog $N_P$ with two infinite alphabets. When we…

Combinatorics · Mathematics 2015-10-13 Jean-Christophe Aval , Valentin Féray , Jean-Christophe Novelli , Jean-Yves Thibon

The RSK correspondence is a bijection between permutations and pairs of standard Young tableaux with identical shape, where the tableaux are commonly denoted $P$ (insertion) and $Q$ (recording). It has been an open problem to demonstrate $$…

This is the first of two articles devoted to a comprehensive exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product…

High Energy Physics - Theory · Physics 2007-05-23 L. Bégin , C. Cummins , P. Mathieu

Plethysm coefficients $\mathsf{a}_{\mu[\nu]}^\lambda$ are the structure coefficients of the plethysm of Schur functions $s_\mu[s_\nu] = \sum_{\lambda} \mathsf{a}_{\mu[\nu]}^\lambda s_\lambda$. We study a bivariate generating function of…

Combinatorics · Mathematics 2026-04-07 Álvaro Gutiérrez , Rosa Orellana , Franco Saliola , Anne Schilling , Mike Zabrocki

This paper introduces a unified theoretical perspective that views deep generative models as probability transformation functions. Despite the apparent differences in architecture and training methodologies among various types of generative…

Machine Learning · Computer Science 2025-06-23 Vitalii Bondar , Vira Babenko , Roman Trembovetskyi , Yurii Korobeinyk , Viktoriya Dzyuba

We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary…

Combinatorics · Mathematics 2015-07-21 J. Bouttier , E. Guitter

In this paper we consider a restricted class of convex polyominoes that we call Z-convex polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can be connected by a monotone path making at most two turns (like…

Combinatorics · Mathematics 2007-05-23 Enrica Duchi , Simone Rinaldi , Gilles Schaeffer

We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on…

Combinatorics · Mathematics 2016-09-07 Alexei Borodin , Grigori Olshanski

This paper contains a partial answer to the open problem 3.11 of \cite{[H2008]}. That is to find an explicit bijection on Schr\"oder paths that inverts the statistics area and bounce. This paper started as an attempt to write the sum over…

Combinatorics · Mathematics 2020-05-29 Nancy Wallace

An algebra denoted $m\mathfrak{H}$ with three generators is introduced and shown to admit embeddings of the Hahn algebra and the rational Hahn algebra. It has a real version of the deformed Jordan plane as a subalgebra whose connection with…

Classical Analysis and ODEs · Mathematics 2020-09-15 Luc Vinet , Alexei Zhedanov

It is known that the generating function associated with the enumeration of non-backtracking walks on finite graphs is a rational matrix-valued function of the parameter; such function is also closely related to graph-theoretical results…

Combinatorics · Mathematics 2023-10-26 Vanni Noferini , María C. Quintana

We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function…

Combinatorics · Mathematics 2007-05-23 O. Guibert , T. Mansour