Jack deformations of Plancherel measures and traceless Gaussian random matrices.
Jamming and geometric representations of graphs.
Jensen proof of a curious binomial identity.
Ještě o kostrách souvislých grafů
Join graphs of trees
Join of two graphs admits a nowhere-zero -flow
Let be a graph, and the smallest integer for which has a nowhere-zero -flow, i.e., an integer for which admits a nowhere-zero -flow, but it does not admit a -flow. We denote the minimum flow number of by . In this paper we show that if and are two arbitrary graphs and has no isolated vertex, then except two cases: (i) One of the graphs and is and the other is -regular. (ii) and is a graph with at least one isolated vertex or a component whose every block is an...
Jucys-Murphy element and walks on modified Young graph
Biane found out that irreducible decomposition of some representations of the symmetric group admits concentration at specific isotypic components in an appropriate large n scaling limit. This deepened the result on the limit shape of Young diagrams due to Vershik-Kerov and Logan-Shepp in a wider framework. In particular, it is remarkable that asymptotic behavior of the Littlewood-Richardson coefficients in this regime was characterized in terms of an operation in free probability of Voiculescu....
Jucys-Murphy elements and the unitary Weingarten function
We describe an approach to the unitary Weingarten function based on the JM elements of symmetric group algebras. When combined with previously known properties of the Weingarten function, this gives a surprising connection with the Moebius function of the lattice of noncrossing partitions.
Just Two Total Graphs are Complementary.