相关论文: Using Hook Schur Functions to Compute Matrix Cocha…
We provide a unified method to study the adjacency matrices of regular graphs (including infinite ones) using holomorphic functional calculus. By applying this calculus on a specific ellipse that contains the spectrum, we derive an…
We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…
Ehrhart theory measures a polytope P discretely by counting the lattice points inside its dilates P, 2P, 3P, .... We compute the Ehrhart quasipolynomials of the standard Coxeter permutahedra for the classical Coxeter groups, expressing them…
We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of…
This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on…
Classical hypergeometric functions are well-known to play an important role in arithmetic algebraic geometry. These functions offer solutions to ordinary differential equations, and special cases of such solutions are periods of…
We study averages of $L$-functions associated with Hecke-Maass cusp forms for $SL(3,\mathbb{Z})$, multiplied by Dirichlet polynomials built from the Fourier coefficients of the cusp forms. To prove this, we employ a variant of the Kuznetsov…
We discuss how the Hochschild cohomology of a dg category can be computed as the trace of its Serre functor. Applying this approach to the principal block of the Bernstein--Gelfand--Gelfand category $\mathcal{O}$, we obtain its Hochschild…
A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be…
The computation of matrix functions is a well-studied problem. Of special importance are the exponential and the logarithm of a matrix, where the latter also raises existence and uniqueness questions. This is particularly relevant in the…
Using the vertex operator representations for symplectic and orthogonal Schur functions, we define two families of symmetric functions and show thatthey are the skew symplectic and skew orthogonal Schur polynomials defined implicitly by…
We find an exact solution to strongly-coupled matrix models with a single-trace monomial potential. Our solution yields closed form expressions for the partition function as well as averages of Schur functions. The results are fully…
The theme of this paper was motivated by the question: How effective are path-following procedures for tracing the pseudospectral boundary? The present study of the mathematical properties of the boundary of the pseudospectrum is the…
Introduced by Okounkov and Reshetikhin, the Schur process is known to be a determinantal point process, meaning that its correlation functions are minors of a single correlation kernel matrix. Previously, this was derived using…
The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…
A number of applications require the computation of the trace of a matrix that is implicitly available through a function. A common example of a function is the inverse of a large, sparse matrix, which is the focus of this paper. When the…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
We introduce a technique for estimating a structured covariance matrix from observations of a random vector which have been sketched. Each observed random vector $\boldsymbol{x}_t$ is reduced to a single number by taking its inner product…
We derive an augmented Krylov subspace method with subspace recycling for computing a sequence of matrix function applications on a set of vectors. The matrix is either fixed or changes as the sequence progresses. We assume consecutive…
We compute the Hochschild cohomology of Hilbert schemes of points on surfaces and observe that it is, in general, not determined solely by the Hochschild cohomology of the surface, but by its "Hochschild-Serre cohomology": the bigraded…