Related papers: Combinatorial Reduction of Set Functions and Matro…
The operator product expansion is used to compute the matrix elements of composite renormalized operators on the lattice. We study the product of two fundamental fields in the two-dimensional sigma-model and discuss the possible sources of…
We prove a combinatorial rule for a complete decomposition, in terms of Langlands parameters, for representations of p-adic $GL_n$ that appear as parabolic induction from a large family (ladder representations). Our rule obviates the need…
In this paper, we propose a parametrised factor that enables inference on Gaussian networks where linear dependencies exist among the random variables. Our factor representation is effectively a generalisation of traditional Gaussian…
Fourier transformations of several functions of one and two variables are evaluated and then used to derive some integral and series identities. It is shown that certain double Mordell integrals can be reduced to a sum of products of…
We first summarize joint work on several preliminary canonical Lambert series factorization theorems. Within this article we establish new analogs to these original factorization theorems which characterize two specific primary cases of the…
This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…
We introduce and study a class of determinantal probability measures generalising the class of discrete determinantal point processes. These measures live on the Grassmannian of a real, complex, or quaternionic inner product space that is…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
We give a new method for the evaluation of a class of integrals of rational symmetric functions in N pairs of variables {x_a, y_a}_{a=1,... N} arising in coupled matrix models, valid for a broad class of two-variable measures. The result is…
Brawley and Carlitz introduced diamond products of elements of finite fields and associated composed products of polynomials in 1987. Composed products yield a method to construct irreducible polynomials of large composite degrees from…
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…
The study of images of noncommutative polynomials on algebras has attracted considerable attention. We investigate polynomial images and the additive structures they generate in associative algebras, focusing on sums and products of values.…
We compute all massive partition functions or characteristic polynomials and their complex eigenvalue correlation functions for non-Hermitean extensions of the symplectic and chiral symplectic ensemble of random matrices. Our results are…
We prove a conjecture of Bourn and Willenbring (2020) regarding the palindromicity and unimodality of a certain family of polynomials $N_n(t)$. These recursively defined polynomials arise as the numerators of generating functions in the…
We endow the set of isomorphic classes of matroids with a new Hopf algebra structure, in which the coproduct is implemented via the combinatorial operations of restriction and deletion. We also initiate the investigation of dendriform…
Decomposing tensors into orthogonal factors is a well-known task in statistics, machine learning, and signal processing. We study orthogonal outer product decompositions where the factors in the summands in the decomposition are required to…
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
Products of shifted characteristic polynomials, and ratios of such products, averaged over the classical compact groups are of great interest to number theorists as they model similar averages of L-functions in families with the same…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…