相关论文: Random Young Tableaux and Combinatorial Identities

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the…

We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…

A probabilistic approach is provided to establish new hypergeometric identities. It is based on the calculation of moments of the limiting distribution of the position of the elephant random walk in the superdiffusive regime.

In this note, we find a combinatorial identity which is closely related to the multi-dimensional integral $\gamma_{m}$ in the study of divisor functions. As an application, we determine the finite dual of the group algebra of infinite…

We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…

One of the main concepts in quantum physics is a density matrix, which is a symmetric positive definite matrix of trace one. Finite probability distributions are a special case where the density matrix is restricted to be diagonal. Density…

Moments of secular and inverse secular coefficients, averaged over random matrices from classical groups, are related to the enumeration of non-negative matrices with prescribed row and column sums. Similar random matrix averages are…

A new method involving particle diagrams is introduced and developed into a rigorous framework for carrying out embedded random matrix calculations. Using particle diagrams and the attendant methodology including loop counting it becomes…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

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…

Starting from the characteristic polynomial for ordinary matrices we give a combinatorial deduction of the Mandelstam identities and viceversa, thus showing that the two sets of relations are equivalent. We are able to extend this…

We generalize the Abel--Hurwitz identities to an almost entirely noncommutative setting. Namely, let $V$ be a finite set of size $n$, and let $\mathbb{L}$ be any noncommutative ring. For each $s\in V$, let $x_{s}\in\mathbb{L}$. Set $x\left(…

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

We consider a rectangular grid induced by the south-west records from the planar Poisson point process in $R^2_+$. A random symmetry property of the matrix whose entries are the areas of tiles of the grid implies cute multivariate…

We study multiplicative nested sums, which are generalizations of harmonic sums, and provide a calculation through multiplication of index matrices. Special cases interpret the index matrices as stochastic transition matrices of random…

Tasks such as social network analysis, human behavior recognition, or modeling biochemical reactions, can be solved elegantly by using the probabilistic inference framework. However, standard probabilistic inference algorithms work at a…

The ensemble inter-relations to be considered are special features of classical cases, where the joint eigenvalue probability density can be computed explicitly. Attention will be focussed too on the consequences of these inter-relations,…