中文
相关论文

相关论文: The distributions of the entries of Young tableaux

200 篇论文

We study large random matrices with i.i.d. entries conditioned to have prescribed row and column sums (margins), a problem connected to relative entropy minimization, Schr\"odinger bridges, contingency tables, and random graphs with given…

概率论 · 数学 2025-07-02 Hanbaek Lyu , Sumit Mukherjee

Tableau sequences of bounded height have been central to the analysis of k-noncrossing set partitions and matchings. We show here that familes of sequences that end with a row shape are particularly compelling and lead to some interesting…

组合数学 · 数学 2015-05-13 Sophie Burrill , Stephen Melczer , Marni Mishna

For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…

组合数学 · 数学 2008-04-07 Raphael Yuster

We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…

组合数学 · 数学 2014-10-21 Nihal Gowravaram , Ravi Jagadeesan

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

组合数学 · 数学 2024-08-07 Anant Godbole , Hannah Swickheimer

The purpose of this paper is to forge a direct link between the hit problem for the action of the Steenrod algebra A on the polynomial algebra P(n)=F_2[x_1,...,x_n], over the field F_2 of two elements, and semistandard Young tableaux as…

代数拓扑 · 数学 2009-03-31 Grant Walker , R M W Wood

We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…

计算机科学中的逻辑 · 计算机科学 2025-04-08 Vera Koponen , Yasmin Tousinejad

Given a collection $\{\lambda_1, \dots, \lambda_n\} $ of real numbers, there is a canonical probability distribution on the set of real symmetric or complex Hermitian matrices with eigenvalues $\lambda_1,\ldots,\lambda_n$. In this paper, we…

概率论 · 数学 2023-11-30 Elizabeth S. Meckes , Mark W. Meckes

Plotting spectra of a range of almost Mathieu operators reveals a beautiful fractal-like image that contains multiple copies of a butterfly image. We demonstrate that plotting the butterflies using a gap-labelling scheme based on K-theory…

算子代数 · 数学 2010-05-11 Michael P. Lamoureux

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

组合数学 · 数学 2014-07-02 Filippo Disanto , Thomas Wiehe

We compute the depth and regularity of ideals associated with arbitrary fillings of positive integers to a Young diagram, called the tableau ideals.

交换代数 · 数学 2023-11-15 Do Trong Hoang , Thanh Vu

Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern…

组合数学 · 数学 2023-09-14 Chaim Even-Zohar

A $k \times n$ partial Latin rectangle is \textit{$C$-sparse} if the number of nonempty entries in each row and column is at most $C$ and each symbol is used at most $C$ times. We prove that the probability a uniformly random $k \times n$…

组合数学 · 数学 2023-11-10 Alexander Divoux , Tom Kelly , Camille Kennedy , Jasdeep Sidhu

We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of such permutations in terms of (several) sums of determinants.…

组合数学 · 数学 2010-11-01 Mathilde Bouvel , Luca Ferrari

We consider asymptotics of set partition pattern avoidance in the sense of Klazar. One of the results of this paper extends work of Alweiss, and finds a classification for set partitions $\pi$ such that the number of set partitions of $[n]$…

组合数学 · 数学 2019-06-25 Benjamin Gunby

This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…

组合数学 · 数学 2009-08-04 Erik Ouchterlony

We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(\lambda,\mu)$ of shape $\lambda=(m,n^b)$ and content $\mu$, a $(b+2)$-tuple. We prove that $(SSYT(\lambda,\mu),\langle \partial^{b+2} \rangle, f(q))$ exhibits the…

组合数学 · 数学 2023-03-01 Joshua Basman Monterrubio , Graeme Henrickson , Anna Stokke

We present families of tableaux which interpolate between the classical semi-standard Young tableaux and matching field tableaux. Algebraically, this corresponds to SAGBI bases of Pl\"ucker algebras. We show that each such family of…

交换代数 · 数学 2020-09-10 Oliver Clarke , Fatemeh Mohammadi

This paper develops a general methodology to conduct statistical inference for observations indexed by multiple sets of entities. We propose a novel multiway empirical likelihood statistic that converges to a chi-square distribution under…

统计方法学 · 统计学 2024-08-12 Harold D Chiang , Yukitoshi Matsushita , Taisuke Otsu

Banderier, Marchal, and Wallner considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. In this work, we prove a conjecture of Fuchs and Yu concerning the…

组合数学 · 数学 2026-01-16 Zhicong Lin , Feihu Liu , Jiahang Liu , Jing Liu , Guoce Xin