相关论文: One-dependent trigonometric determinantal processe…

Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…

The necessary and sufficient conditions for a function to be totally or partially separable are derived. It is shown that a function is totally separable if and only if each component of the gradient vector of depends only on the…

We determine the asymptotics of the block Toeplitz determinants $\det T_n(\phi)$ as $n\to\infty$ for $N\times N$ matrix-valued piecewise continuous functions $\phi$ with a finitely many jumps under mild additional conditions. In particular,…

A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…

The continuous analogue of a Toeplitz determinant identity for Wiener-Hopf operators is proved. An example which arises from random matrix theory is studied and an error term for the asymptotics of the determinant is computed.

As well as arising naturally in the study of non-intersecting random paths, random spanning trees, and eigenvalues of random matrices, determinantal point processes (sometimes also called fermionic point processes) are relatively easy to…

Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…

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 describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients…

Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…

Inspired by the recent work of Glasner, Huang, Shao, Weiss and Ye, we prove that the maximal $\infty$-step pro-nilfactor $X_\infty$ of a minimal system $(X,T)$ is the topological characteristic factor along polynomials in a certain sense.…

Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:…

We study a unitary analog to Redheffer's matrix. It is first proved that the determinant of this matrix is the unitary analogue to that of Redheffer's matrix. We also show that the coefficients of the characteristic polynomial may be…

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. The construction involves an iteration procedure on an infinite-dimensional…

The Determinantal Point Process (DPP) is a parameterized model for multivariate binary variables, characterized by a correlation kernel matrix. This paper proposes a closed form estimator of this kernel, which is particularly easy to…

The present article is concerned with global subelliptic estimates for Kramers-Fokker-Planck operators with polynomials of degree less than or equal to two. The constants appearing in those estimates are accurately formulated in terms of…

We use Jones-Wenzl idempotents to construct bases for the relative Kauffman bracket skein module of a square with n points colored 1 and one point colored h. We consider a natural bilinear form on this skein module. We calculate the…

A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…

In this article, we evaluate determinants of block hook matrices, which are block matrices consist of hook matrices. In particular, we deduce that the determinant of a block hook matrix factorizes nicely. In addition we give a combinatorial…

Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…