English
Related papers

Related papers: Catalan numbers and Schubert polynomials for $w=1(…

200 papers

We show that the principal specialization of the Schubert polynomial at $w$ is bounded below by $1+p_{132}(w)+p_{1432}(w)$ where $p_u(w)$ is the number of occurrences of the pattern $u$ in $w$, strengthening a previous result by A.…

Combinatorics · Mathematics 2019-10-22 Yibo Gao

Let $v(n)$ be the largest principal specialization of Schubert polynomials for layered permutations $v(n) := \max_{w \in \mathcal{L}_n} \mathfrak{S}_w(1,\ldots,1)$. Morales, Pak and Panova proved that there is a limit \[\lim_{n \to \infty}…

Combinatorics · Mathematics 2023-11-09 Ningxin Zhang

In this note, we study two generalizations of the Catalan numbers, namely the $s$-Catalan numbers and the spin $s$-Catalan numbers. These numbers first appeared in relation to quantum physics problems about spin multiplicities. We give a…

Combinatorics · Mathematics 2021-10-26 William Linz

We give a new proof of the following statement: the Catalan number $C_n$ is divisible by $n+2$, if $n$ is odd and $n\not\equiv 1\text{ mod }3$.

Combinatorics · Mathematics 2025-07-29 Yury Kochetkov

In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order…

Number Theory · Mathematics 2015-12-21 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood

Let k and n be positive integers. We mainly show that $$(ln+1) | k\binom{kn+ln}{kn},$$ $$2\binom{kn}n | \binom {2n}{n}C_{2n}^{(k-1)}$$, $$\binom{kn}n | (2k-1)C_n\binom{2kn}{2n},$$ $$\binom{2n}n | (k+1)C_n^{(k-1)}\binom{2kn}{kn},$$…

Number Theory · Mathematics 2010-06-01 Zhi-Wei Sun

The Catalan numbers are well-known to be the answer to many different counting problems, and so there are many different families of sets whose cardinalities are the Catalan numbers. We show how such a family can be given the structure of a…

Category Theory · Mathematics 2019-07-08 Mitchell Buckley , Richard Garner , Stephen Lack , Ross Street

Let w_0 denote the permutation [n,n-1,...,2,1]. We give two new explicit formulae for the Kazhdan-Lusztig polynomials P_{w_0w,w_0x} in S_n when x is a maximal element in the singular locus of the Schubert variety X_w. To do this, we utilize…

Combinatorics · Mathematics 2007-05-23 Gregory S. Warrington

We prove that if $\sigma \in S_m$ is a pattern of $w \in S_n$, then we can express the Schubert polynomial $\mathfrak{S}_w$ as a monomial times $\mathfrak{S}_\sigma$ (in reindexed variables) plus a polynomial with nonnegative coefficients.…

Combinatorics · Mathematics 2020-11-17 Alex Fink , Karola Mészáros , Avery St. Dizier

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

Combinatorics · Mathematics 2025-01-24 Sophie Marques , Elizabeth Mrema

We establish combinatorial interpretations of several identities for the Catalan and Fine numbers and, along the way, we present some new bijections of independent interest. Briefly, we show that C_{n} = 1/(n+1) Sum_{k} (n+1)choose(2k+1)…

Combinatorics · Mathematics 2007-05-23 David Callan

We present a $q$-analog of the super Catalan number $(2m)!(2n)!/2m!n!(m+n)!$, which also generalizes the $q$-Catalan numbers $c_n(\lambda)$, due to F\"urlinger and Hofbauer, for $\lambda=0$ and $\lambda=1$. We give a combinatorial…

Combinatorics · Mathematics 2014-09-02 Emily Allen , Irina Gheorghiciuc

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

Representation Theory · Mathematics 2012-08-16 Matthew Bennett , Vyjayanthi Chari , R. J. Dolbin , Nathan Manning

The Catalan number $C_n$ enumerates parenthesizations of $x_0*\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\dotsb*x_n$ when $*$…

Combinatorics · Mathematics 2016-11-11 Nickolas Hein , Jia Huang

Let $\mathfrak{S}_w(x)$ be the Schubert polynomial for a permutation $w$ of $\{1,2,\ldots,n\}$. For any given composition $\mu$, we say that $x^\mu \mathfrak{S}_w(x^{-1})$ is the complement of $\mathfrak{S}_w(x)$ with respect to $\mu$. When…

Combinatorics · Mathematics 2024-03-19 Neil J. Y. Fan , Peter L. Guo , Nicolas Y. Liu

In this note we give a survey about polynomials whose moments are multiples of super Catalan numbers and explore two different kinds of q-analogues.

Combinatorics · Mathematics 2014-10-23 Johann Cigler

We prove the following conjecture of Zeilberger. Denoting by $C_n$ the Catalan number, define inductively $A_n$ by $(-1)^{n-1}A_n=C_n+\sum_{j=1}^{n-1} (-1)^{j} \binom{2n-1}{2j-1} A_j \,C_{n-j}$ and $a_n=2A_n/C_n$. Then $a_n$ (hence $A_n$)…

Combinatorics · Mathematics 2012-08-01 Michel Lassalle

Enriched versions of type A Schubert polynomials are constructed with coefficients in a polynomial ring in variables $c_1, c_2, \ldots$. Specializing these variables to $0$ recovers the double Schubert polynomials of Lascoux and…

Combinatorics · Mathematics 2021-02-12 David Anderson , William Fulton

We prove a formula for double Schubert and Grothendieck polynomials specialized to two rearrangements of the same set of variables. Our formula generalizes the usual formulas for Schubert and Grothendieck polynomials in terms of RC-graphs,…

Algebraic Geometry · Mathematics 2007-05-23 Anders S. Buch , Richard Rimanyi

We study the properties of the odd Catalan numbers, C_n, modulo 2^k for k >= 2. We show that there exist only k - 1 different congruences of the odd Catalan numbers modulo 2^k. Moreover, these congruences can be obtained by C_{2^m - 1} (mod…

Number Theory · Mathematics 2011-01-12 Hsueh-Yung Lin
‹ Prev 1 2 3 10 Next ›