Related papers: Auto-correlation functions for unitary groups

We discuss some natural maps from a unitary group U(n) to a smaller group U(n-m) (these maps are versions of the Livshic characteristic function). We calculate explicitly the direct images of the Haar measure under some maps. We evaluate…

This paper generalizes Bass' work on zeta functions for uniform tree lattices. Using the theory of von Neumann algebras, machinery is developed to define the zeta function of a discrete group of automorphisms of a bounded degree tree. The…

Let $\Phi:V\to V\otimes U$ be an intertwining operator between representations of a simple Lie algebra (quantum group, affine Lie algebra). We define its generalized character to be the following function on the Cartan subalgebra with…

We construct new families of discrete vector orthogonal polynomials that have the property to be eigenfunctions of some difference operator. They are extensions of Charlier, Meixner and Kravchuk polynomial systems. The ideas behind our…

The universal connected correlations proposed recently between eigenvalues of unitary random matrices is examined numerically. We perform an ensemble average by the Monte Carlo sampling. Although density of eigenvalues and a bare…

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…

The differential systems satisfied by orthogonal polynomials with arbitrary semiclassical measures supported on contours in the complex plane are derived, as well as the compatible systems of deformation equations obtained from varying such…

We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…

Here, we represent a general hypergraph by a matrix and study its spectrum. We extend the definition of equitable partition and joining operation for hypergraphs, and use those to compute eigenvalues of different hypergraphs. We derive the…

We study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field of odd characteristic. We obtain several results about the number of leaves in such graphs. In particular, in the case of graphs…

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

We extend the classical construction of operator colligations and characteristic functions. Consider the group $G$ of finite block unitary matrices of size $\alpha+\infty+...+\infty$ ($k$ times). Consider the subgroup $K=U(\infty)$, which…

Let $n \geq 1$ be an odd integer. We construct an anticyclotomic Euler system for certain cuspidal automorphic representations of unitary groups with signature $(1, 2n-1)$.

We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

We construct a model for the space of automorphisms of a connected p-compact group in terms of the space of automorphisms of its maximal torus normalizer and its root datum. As a consequence we show that any homomorphism to the outer…

Small M-theories unify various models of a given family in the same way as the M-theory unifies a variety of superstring models. We consider this idea in application to the family of eigenvalue matrix models: their M-theory unifies various…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Explicit expressions for multimatrix models with complex and unitary matrices allows to couple these models with well-known unitary, orthogonsl and sympletic ensembles. We consider examples of such mixed ensembles which are solvable in the…

We provide sufficient conditions for a lattice polynomial function to be self-commuting. We explicitly describe self-commuting polynomial functions over chains.