Related papers: Classical Kloosterman sums: representation theory,…
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…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting $PT$-symmetry. Here we show that there is a one-to-one correspondence between complex $PT$-symmetric matrices and split-complex and…
Strong bounds - going beyond Sarnak's density hypothesis - are obtained for the number of automorphic forms for the congruence subgroup Gamma_0(q) of SL_n(Z) violating the Ramanujan conjecture at any given unramified place. The proof is…
We prove a number of new Rogers-Ramanujan type identities involving double, triple and quadruple sums. They were discovered after an extensive search using Maple. The main idea of proofs is to reduce them to some known identities in the…
Krawtchouk's polynomials occur classically as orthogonal polynomials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic…
The saturation theorem of [Knutson-Tao '99] concerns the nonvanishing of Littlewood-Richardson coefficients. In combination with work of [Klyachko '98], it implies [Horn '62]'s conjecture about eigenvalues of sums of Hermitian matrices.…
It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the…
We construct p-adic relative cohomology for a family of toric exponential sums which generalize the classical Kloosterman sums. Under natural hypotheses such as quasi-homogeneity and nondegeneracy, this cohomology is acyclic except in the…
In this paper we study the rotation and spatial inversion symmetry of regular tetrahedron. We obtain the representation matrix, multiplication table,the order of all group elements, all possible combinations of generator elements, the…
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments…
We study oriented graphs whose Hermitian adjacency matrices of the second kind have few eigenvalues. We give a complete characterization of the oriented graphs with two distinct eigenvalues, showing that there are only four such graphs. We…
We examine the lattice generated by two pairs of supplementary vector subspaces of a finite-dimensional vector space by intersection and sum, with the aim of applying the results to the study of representations admitting two pairs of…
We obtain a nontrivial bound on the number of solutions to the equation $$ A^{x_1} + \ldots + A^{x_\nu} = A^{x_{\nu+1}} + \ldots + A^{x_{2\nu}}, \quad 1 \le x_1, \ldots,x_{2\nu} \le \tau, $$ with a fixed $n\times n$ matrix $A$ over a finite…
The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
Linear statistics, a random variable build out of the sum of the evaluation of functions at the eigenvalues of a N times N random matrix,sum[j=1 to N]f(xj) or tr f(M), is an ubiquitous statistical characteristics in random matrix theory.…
Dual multiplicity graphs are those simple, undirected graphs that have a weighted Hermitian adjacency matrix with only two distinct eigenvalues. From the point of view of frame theory, their characterization can be restated as which graphs…
The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…
Chiral conformal blocks in a rational conformal field theory are a far going extension of Gauss hypergeometric functions. The associated monodromy representations of Artin's braid group capture the essence of the modern view on the subject,…