Related papers: Approximate factorization and concentration for ch…
We introduce notions of absolutely non-free and perfectly non-free group actions and use them to study the associated unitary representations. We show that every weakly branch group acts absolutely non-freely on the boundary of the…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
We introduce new invariants associated to collections of compact subsets of a symplectic manifold. They are defined through an elementary-looking variational problem involving Poisson brackets. The proof of the non-triviality of these…
Considering that words with different characteristic in the text have different importance for classification, grouping them together separately can strengthen the semantic expression of each part. Thus we propose a new text representation…
Statistical properties of infinite products of random isotropically distributed matrices are investigated. Both for continuous processes with finite correlation time and discrete sequences of independent matrices, a formalism that allows to…
This paper provides a theoretical explanation on the clustering aspect of nonnegative matrix factorization (NMF). We prove that even without imposing orthogonality nor sparsity constraint on the basis and/or coefficient matrix, NMF still…
It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group…
These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…
The centre of the symmetric group algebra $\mathbb{C}[\mathfrak{S}_n]$ has been used successfully for studying important problems in enumerative combinatorics. These include maps in orientable surfaces and ramified covers of the sphere by…
In this monograph, we prove an asymptotic approximation for integrals of probability densities over sets in finite dimensional euclidean space, which are far away from the origin (asymptotic sets). We use this approximation to investigate…
A potential scattering theory from deterministic and random $\mathcal{PT}$ collections of particles with gain and loss is introduced and the forms of their structure and pair-structure factors are elucidated. An example relating to light…
The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…
In this note, presented as a ``community service", followed by the PhD research of the author, we draw the relation between Casselman's theorem regarding the asymptotic behavior of matrix coefficients of reductive algebraic groups over…
We consider random character values X(g) of the symmetric group on n symbols, where X is chosen at random from the set of irreducible characters and g is chosen at random from the group, and we show that X(g)=0 with probability tending to…
This paper deduces exponential matrix concentration from a Poincar\'e inequality via a short, conceptual argument. Among other examples, this theory applies to matrix-valued functions of a uniformly log-concave random vector. The proof…
We study asymptotics of characters of the symmetric groups on a fixed conjugacy class. It was proved by Kerov that such a character can be expressed as a polynomial in free cumulants of the Young diagram (certain functionals describing the…
In his classic book on symmetric functions, Macdonald describes a remarkable result by Green relating the character theory of the finite general linear group to transition matrices between bases of symmetric functions. This connection…
We compute the limit distribution of partial transposes (when both the number and the size of blocks tends to infinity) for a large class of ensembles of unitarily invariant random matrices. Furthermore, it is shown the asymptotic freeness…
We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…
We investigate multiple Charlier polynomials and in particular we will use the (nearest neighbor) recurrence relation to find the asymptotic behavior of the ratio of two multiple Charlier polynomials. This result is then used to obtain the…