Related papers: Universality for random permutations and some othe…
Orthogonal - unitary and symplectic - unitary crossover ensembles of random matrices are relevant in many contexts, especially in the study of time reversal symmetry breaking in quantum chaotic systems. Using skew-orthogonal polynomials we…
This paper is concerned with certain connections between the ensemble of n x n unitary matrices -- specifically the characteristic function of the random variable tr(U) -- and combinatorics -- specifically Ulam's problem concerning the…
We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with constant coefficients. This generalizes a result of…
We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…
In this paper, we prove Newton-Maclaurin type inequalities for functions obtained by linear combination of two neighboring primary symmetry functions, which is a generalization of the classical Newton-Maclaurin inequality.
In this paper we consider Tyler's robust covariance M-estimator under group symmetry constraints. We assume that the covariance matrix is invariant to the conjugation action of a unitary matrix group, referred to as group symmetry. Examples…
Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ defines a permutation of the elements of $G$. Motivated by a recent generalization of Zolotarev's proof of classic…
This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a…
Let $A^{(n)}_{l;k}\subset S_n$ denote the set of permutations of $[n]$ for which the set of $l$ consecutive numbers $\{k, k+1,\cdots, k+l-1\}$ appears in a set of consecutive positions. Under the uniformly probability measure $P_n$ on…
Modelled on efficient algorithms for solving the conjugacy problem in hyperbolic groups, we define and study the permutation conjugacy length function. This function estimates the length of a short conjugator between words $u$ and $v$, up…
We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of…
A universal sequence for a group or semigroup $S$ is a sequence of words $w_1, w_2, \ldots$ such that for any sequence $s_1, s_2, \ldots\in S$, the equations $w_n = s_n$, $n\in \mathbb{N}$, can be solved simultaneously in $S$. For example,…
We study the total number of occurrences of several vincular (also called generalized) patterns and other statistics, such as the major index and the Denert statistic, on permutations avoiding a pattern of length 3, extending results of…
We consider a random field, defined on an integer-valued d-dimensional lattice, with covariance function satisfying a condition more general than summability. Such condition appeared in the well-known Newman's conjecture concerning the…
A generalized matrix function is a generalization of determinant and permanent function. In this paper, we introduced the formula for the value of a generalized matrix function of a linear sum of permutation matrices. We show that a linear…
Beginning with work of Zeilberger on classical pattern counts, there are a variety of structural results for moments of permutation statistics applied to random permutations. Using tools from representation theory, Gaetz and Ryba…
We give a constructive proof for the superbosonization formula for invariant random matrix ensembles, which is the supersymmetry analog of the theory of Wishart matrices. Formulas are given for unitary, orthogonal and symplectic symmetry,…
The universality phenomenon asserts that the distribution of the eigenvalues of random matrix with i.i.d. zero mean, unit variance entries does not depend on the underlying structure of the random entries. For example, a plot of the…
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear…
The Mallows measure on the symmetric group $S_n$ is the probability measure such that each permutation has probability proportional to $q$ raised to the power of the number of inversions, where $q$ is a positive parameter and the number of…