English
Related papers

Related papers: q-analog of tableau containment

200 papers

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

Complex Variables · Mathematics 2025-06-26 Stéphane Charpentier , Konstantinos Maronikolakis

We consider the decomposition into irreducible components of the exterior algebra $\bigwedge\left(\mathbb{C}^{n}\otimes \left(\mathbb{C}^{k}\right)^{*}\right)$ regarded as a $GL_{n}\times GL_{k}$ module. Irreducible $GL_{n}\times GL_{k}$…

Representation Theory · Mathematics 2022-08-23 Anton Nazarov , Pavel Nikitin , Daniil Sarafannikov

We prove that if the Jacobian Conjecture in two variables is false and (P,Q) is a standard minimal pair, then the Newton polygon HH(P) of P must satisfy several restrictions that had not been found previously. This allows us to discard some…

Commutative Algebra · Mathematics 2017-08-31 Jorge A. Guccione , Juan J. Guccione , Christian Valqui

We show how different random thin sets of integers may have different behaviour. First, using a recent deviation inequality of Boucheron, Lugosi and Massart, we give a simpler proof of one of our results in {\sl Some new thin sets of…

Functional Analysis · Mathematics 2009-04-17 Daniel Li , Hervé Queffélec , Luis Rodriguez-Piazza

It was shown by G. Pisier that any finite-dimensional normed space admits an $\alpha$-regular $M$-position, guaranteeing not only regular entropy estimates but moreover regular estimates on the diameters of minimal sections of its unit-ball…

Functional Analysis · Mathematics 2021-05-28 Emanuel Milman , Yuval Yifrach

The right key of a semistandard Young tableau is a tool used to find Demazure characters for $sl_n(\mathbb{C})$. This thesis gives methods to obtain the right and left keys by inspection of the semistandard Young tableau. Given a partition…

Combinatorics · Mathematics 2014-07-30 Matthew J. Willis

The set of n by n upper-triangular nilpotent matrices with entries in a finite field F_q has Jordan canonical forms indexed by partitions lambda of n. We present a combinatorial formula for computing the number F_\lambda(q) of matrices of…

Combinatorics · Mathematics 2017-03-02 Martha Yip

Let $p_\mathrm{c}$ and $q_\mathrm{c}$ be the threshold and the expectation threshold, respectively, of an increasing family $\mathcal{F}$ of subsets of a finite set $X$, and let $l$ be the size of a largest minimal element of $\mathcal{F}$.…

Combinatorics · Mathematics 2026-01-19 Tomasz Przybyłowski , Oliver Riordan

We show that every $(n,d,\lambda)$-graph contains a Hamilton cycle for sufficiently large $n$, assuming that $d\geq \log^{6}n$ and $\lambda\leq cd$, where $c=\frac{1}{70000}$. This significantly improves a recent result of Glock, Correia…

Combinatorics · Mathematics 2025-07-02 Asaf Ferber , Jie Han , Dingjia Mao , Roman Vershynin

We introduce lecture hall tableaux, which are fillings of a skew Young diagram satisfying certain conditions. Lecture hall tableaux generalize both lecture hall partitions and anti-lecture hall compositions, and also contain reverse…

Combinatorics · Mathematics 2020-07-01 Sylvie Corteel , Jang Soo Kim

We study random partitions $\lambda=(\lambda_1,\lambda_2,...,\lambda_d)$ of $n$ whose length is not bigger than a fixed number $d$. Suppose a random partition $\lambda$ is distributed according to the Jack measure, which is a deformation of…

Combinatorics · Mathematics 2009-02-12 Sho Matsumoto

For every positive integer $n$ and for every $\alpha \in [0, 1]$, let $\mathcal{B}(n, \alpha)$ denote the probabilistic model in which a random set $\mathcal{A} \subseteq \{1, \dots, n\}$ is constructed by picking independently each element…

Number Theory · Mathematics 2020-12-10 Carlo Sanna

We give a bound on the probability that a randomly chosen affine unimodular lattice has large holes, and a similar bound on the probability of large holes in the spectrum of a random flat torus. We discuss various motivations and…

Number Theory · Mathematics 2014-09-24 Jayadev S. Athreya

We define and study the Plancherel-Hecke probability measure on Young diagrams; the Hecke algorithm of [Buch-Kresch-Shimozono-Tamvakis-Yong '06] is interpreted as a polynomial-time exact sampling algorithm for this measure. Using the…

Combinatorics · Mathematics 2011-10-19 Hugh Thomas , Alexander Yong

Let $m\in\mathbb N_{\ge 2}$, and let $\mathcal K=\{K_\lambda: \lambda\in(0, 1/m]\}$ be a class of Cantor sets, where $K_{\lambda}=\{\sum_{i=1}^\infty d_i\lambda^i: d_i\in\{0,1,\ldots, m-1\}, i\ge 1\}$. We investigate in this paper the…

Dynamical Systems · Mathematics 2022-02-16 Kan Jiang , Derong Kong , Wenxia Li

In this note, we compute the probability that a $k\times n$ matrix can be extended to an $n\times n$ invertible matrix over $\F_q[x]$, which turns out to be $(1-q^{k-n})(1-q^{k-1-n})...(1-q^{1-n})$. Connections with Dirichlet's density…

Probability · Mathematics 2013-01-17 Xiangqian Guo , Guangyu Yang

Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to be ``wide'' if for every subpartition mu of lambda, mu >= mu'…

Combinatorics · Mathematics 2007-05-23 Timothy Y. Chow , C. Kenneth Fan , Michel X. Goemans , Jan Vondrak

Panagiotou and Stufler recently proved an important fact on their way to establish the scaling limits of random P\'olya trees: a uniform random P\'olya tree of size $n$ consists of a conditioned critical Galton-Watson tree $C_n$ and many…

Combinatorics · Mathematics 2019-11-25 Bernhard Gittenberger , Emma Yu Jin , Michael Wallner

We show that the $i$-dimensional plaqutte random-cluster model with coefficients in $\mathbb{Z}_q$ is dual to a $(d-i)$-dimensional plaquette random cluster model. In addition, we explore boundary conditions, infinite volume limits, and…

Probability · Mathematics 2024-06-24 Paul Duncan , Benjamin Schweinhart

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…

Combinatorics · Mathematics 2007-09-05 Yuliy Baryshnikov , Dan Romik