Related papers: On the Limiting Vacillating Tableaux for Integer S…
A major research area in discrete geometry is to consider the best way to partition the $d$-dimensional Euclidean space $\mathbb{R}^d$ under various quality criteria. In this paper we introduce a new type of space partitioning that is…
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…
The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…
For $\mathbb N^*:=\mathbb N \setminus \{0\}$, we consider the collection $\mathfrak M(N)$ of all the $N$ rows, for which, for $n=1,\cdots,N$, the $n-th$ row consists of an increasing sequence $(a_j^n)_j$ of real numbers. For $\mathfrak A…
A meandric system of size $n$ is the set of loops formed from two arc diagrams (non-crossing perfect matchings) on $\{1,\dots,2n\}$, one drawn above the real line and the other below the real line. A uniform random meandric system can be…
In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth…
It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…
Density matrix quantum Monte Carlo (DMQMC) is a recently-developed method for stochastically sampling the $N$-particle thermal density matrix to obtain exact-on-average energies for model and \emph{ab initio} systems. We report a systematic…
A box-ball system is a discrete dynamical system whose dynamics come from the balls jumping according to certain rules. A permutation on n objects gives a box-ball system state by assigning its one-line notation to n consecutive boxes.…
We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
We introduce a novel tableau-based classical simulation method for quantum computation, formulated within the phase space framework of the extended stabilizer theory of closed non-contextual operators. This method enables the efficient…
In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the normalized variance, $V/E^2$, is bounded if and only if a certain…
An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely $k$ inversion pairs is said to be…
We study the correlators of irregular vertex operators in two-dimensional conformal field theory (CFT) in order to propose an exact analytic formula for calculating numbers of partitions, that is: 1) for given $N,k$, finding the total…
It is known that for the Young diagram of any partition of an integer $n$, the sum of squares of the hook lengths of its cells is exactly $n^2$ more than that of the contents of its cells. That is, for any partition $\lambda$ of an integer…
Consider an ensemble of $N\times N$ non-Hermitian matrices in which all entries are independent identically distributed complex random variables of mean zero and absolute mean-square one. If the entry distributions also possess bounded…
The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…
Define $I_n^k(\alpha)$ to be the set of involutions of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid the pattern $\alpha \in S_i$, for some $i \geq 2$, and define $I_n^k(\emptyset;\alpha)$ to be the set of involutions of…
An element of the algebra $M_n(\mathbb{F})$ of $n \times n$ matrices over a field $\mathbb{F}$ is called an involution if its square equals the identity matrix. Gustafson, Halmos, and Radjavi proved that any product of involutions in…