Related papers: A combinatorial interpretation for certain plethys…
In this paper, we give a combinatorial rule to calculate the decomposition of the tensor product (Kronecker product) of two irreducible complex representations of the symmetric group ${\mathfrak S}_n$, when one of the representations…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
We give a probalistic proof of the famous Meinardus' asymptotic formula for the number of weighted partitions with weakened one of the three Meinardus' conditions, and extend the resulting version of the theorem to other two classis types…
This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left) and the strong order or Bruhat order. The first part deals with bases of…
A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two \S_r-irreducibles into irreducibles.…
The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.
We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
Let $V(1)$ be the natural representation of $U(\mathfrak{sl}_2).$ The multiplicities of $V(k)$ in $V(1)^{\otimes N}$ have multiple interpretations in combinatorics. In this paper, we investigate one such combinatorial interpretation of…
It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…
It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…
We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of…
For any integer $k$, M.Kaneko defined $k$-th poly-Bernoulli numbers as a kind of generalization of classical Bernoulli numbers using $k$-th polylogarithm. In case when $k$ is positive, $k$-th poly-Bernoulli numbers is a sequence of rational…
We consider two families of polynomials that play the same role in the Temperley Lieb algebra of a Coxeter group as the Kazhdan Lusztig and R polynomials play in the Hecke algebra of the group. We study these polynomials from a…
Using the expansion of the inverse of the Kostka matrix in terms of tabloids as presented by Egecioglu and Remmel, we show that the fusion coefficients can be expressed as an alternating sum over cylindric tableaux. Cylindric tableaux are…
We investigate the combinatorial properties of the functional equation $\phi[h(z)]=h(qz)$ for the conjugation of a formal diffeomorphism $\phi$ of $\mathbb{C}$ to its linear part $z\mapsto qz$. This is done by interpreting the functional…
Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley-Menger ideal for $n$ points in 2D. We…
The $1/k$-Eulerian polynomials $A^{(k)}_{n}(x)$ were introduced as ascent polynomials over $k$-inversion sequences by Savage and Viswanathan. The bi-$\gamma$-positivity of the $1/k$-Eulerian polynomials $A^{(k)}_{n}(x)$ was known but to…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.