Related papers: Realizable Standard Young Tableaux

Euler diagrams are a tool for the graphical representation of set relations. Due to their simple way of visualizing elements in the sets by geometric containment, they are easily readable by an inexperienced reader. Euler diagrams where the…

Let $L(m,n)$ denote Young's lattice, consisting of all partitions whose Young diagrams are contained within an $m\times n$ rectangle. It is a classical result that the partially ordered set $L(m,n)$ is rank-symmetric, rank-unimodal, and…

While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…

We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of conjugate partitions. While there are exponentially many diagrams, we show it is…

An abstract topological graph (AT-graph) is a pair $A=(G,\mathcal{X})$, where $G=(V,E)$ is a graph and $\mathcal{X} \subseteq {E \choose 2}$ is a set of pairs of edges of $G$. A realization of $A$ is a drawing $\Gamma_A$ of $G$ in the plane…

This paper deals with the distribution of descent number in standard Young tableaux of certain shapes. A simple explicit formula is presented for the number of tableaux of any shape with two rows, with any specified number of descents. For…

Let $U$ be a matrix chosen randomly, with respect to Haar measure, from the unitary group $U(d).$ We express the moments of the trace of any submatrix of $U$ as a sum over partitions whose terms count certain standard and semistandard Young…

We study the Young graph with edge multiplicities arising in a Pieri-type formula for Jack symmetric polynomials $P_\mu(x;a)$ with a parameter $a$. Starting with the empty diagram, we define recurrently the `dimensions' $\dim_a$ in the same…

A sequence of non-negative integers is exactly realizable as the fixed point counts sequence of a dynamical system if and only if it gives rise to a sequence of non-negative orbit counts. This provides a simple realizability criterion based…

Let SYT_n be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SYT_n and some of their crucial properties, we prove three main results:…

We develop a martingale approximation framework yielding quantitative maximal large deviations estimates for invertible dynamical systems. From suitable decay of correlations, we deduce these estimates and, as an application, we obtain…

In this paper, we investigate hypergroups which arise from association schemes in a canonical way; this class of hypergroups is called realizable. We first study basic algebraic properties of realizable hypergroups. Then we prove that two…

The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…

Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…

A temporal graph $\mathcal{G}=(G,\lambda)$ can be represented by an underlying graph $G=(V,E)$ together with a function $\lambda$ that assigns to each edge $e\in E$ the set of time steps during which $e$ is present. The reachability graph…

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

Let $\delta=(\delta_1,\ldots,\delta_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $\delta$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if…

We give new bounds and asymptotic estimates on the number of standard Young tableaux of skew shape in a variety of special cases. Our approach is based on Naruse's hook-length formula. We also compare our bounds with the existing bounds on…

Let $\mathscr{A}$ be a nonempty set of infinite matrices of linear operators between two topological vector spaces. We show that a sequence is uniformly $\mathscr{A}$-summable if and only if it is $B$-summable for all matrices $B$ of linear…