English
Related papers

Related papers: Simple Generating Functions for Certain Young Tabl…

200 papers

The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…

General Mathematics · Mathematics 2023-06-16 Yilmaz Simsek

We develop a generating-function formulation for the symbolic reduction of multi-loop Feynman integrals. In this framework, integration-by-parts identities are rewritten as differential equations for sector-wise generating functions, so the…

High Energy Physics - Phenomenology · Physics 2026-05-12 Bo Feng , Xiang Li , Yuanche Liu , Yanqing Ma , Yang Zhang

A closed expression is given for the generating function of (virtual) Poincar\'e polynomials of moduli spaces of semi-stable sheaves on the projective plane $\mathbb{P}^2$ with arbitrary rank $r$ and Chern classes. This generating function…

Algebraic Geometry · Mathematics 2016-02-24 Jan Manschot

In this paper, we study pattern matching in the set F_{n,k} of fillings of the k x n rectangle with the integers 1,...,kn such that the elements in any column increase from bottom to top. Let P be a column strict tableau of shape 2^k. We…

Combinatorics · Mathematics 2011-07-19 Johannes Harmse , Jeffrey Remmel

We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…

Combinatorics · Mathematics 2014-02-11 Sophie Burrill , Sergi Elizalde , Marni Mishna , Lily Yen

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…

Combinatorics · Mathematics 2015-05-13 W. R. G. James , I. Jensen , A. J. Guttmann

Obtained a new property of superposition of the generating functions ln(1/(1-F(x))), where F(x) - generating function with integer coefficients, which allows the construction a primality tests. The theorem which is based on compositions of…

Combinatorics · Mathematics 2011-12-06 Dmitry Kruchinin

We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…

Combinatorics · Mathematics 2025-07-02 Sabine Jansen , Leonid Kolesnikov

We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of…

Combinatorics · Mathematics 2009-12-25 Hilmar Gudmundsson

In a recent preprint, Lai showed that the quotient of generating functions of weighted lozenge tilings of two "half hexagons with lateral dents", which differ only in width, factors nicely, and the same is true for the quotient of…

Combinatorics · Mathematics 2020-12-15 Markus Fulmek

Deriving a comprehensive set of reduction rules for Feynman integrals has been a longstanding challenge. In this paper, we present a proposed solution to this problem utilizing generating functions of Feynman integrals. By establishing and…

High Energy Physics - Phenomenology · Physics 2023-06-29 Xin Guan , Xiang Li , Yan-Qing Ma

The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…

Number Theory · Mathematics 2021-04-19 Yilmaz Simsek

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

Computational Complexity · Computer Science 2019-02-08 Chin Ho Lee

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

Combinatorics · Mathematics 2025-03-05 David Serena , William J Buchanan

The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines…

Combinatorics · Mathematics 2007-05-23 Ron M. Adin , Yuval Roichman

Let $m,k$ be fixed positive integers. Determining the generating function for the number of tilings of an $m\times n$ rectangle by $k\times 1$ rectangles is a long-standing open problem to which the answer is only known in certain special…

Combinatorics · Mathematics 2022-08-09 Mudit Aggarwal , Samrith Ram

We calculate generating functions for the Poincare polynomials of moduli spaces of pointed curves of genus zero and of Configuration Spaces of Fulton and MacPherson. We also prove that contributions of multiple coverings of curves in a…

alg-geom · Mathematics 2008-02-03 Yu. I. Manin

We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schr\"oder paths and give a bijection between the set of increasing rectangular tableaux and small…

Combinatorics · Mathematics 2018-08-20 Timothy Pressey , Anna Stokke , Terry Visentin

We evaluate four families of determinants of matrices, where the entries are sums or differences of generating functions for paths consisting of up-steps, down-steps and level steps. By specialisation, these determinant evaluations have…

Combinatorics · Mathematics 2011-04-20 Christian Krattenthaler , Johann Cigler

This paper deals with efficient numerical methods for computing the action of the generating function of Bernoulli polynomials, say $q(\tau,w)$, on a typically large sparse matrix. This problem occurs when solving some non-local boundary…

Numerical Analysis · Mathematics 2025-09-03 Lidia Aceto , Luca Gemignani