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

Let $M$ be a smooth manifold of dimension $2n$, and let $O_{M}$ be the dense open subbundle in $\wedge^{2}T^{\ast}M$ of $2$-covectors of maximal rank. The algebra of $\operatorname*{Diff}M$-invariant smooth functions of first order on…

Let k be an arbitrary field (of arbitrary characteristic) and let X = [x_{i,j}] be a generic m x n matrix of variables. Denote by I_2(X) the ideal in k[X] = k[x_{i,j}: i = 1, ..., m; j = 1, ..., n] generated by the 2 x 2 minors of X. We…

We give a formula that expresses the Hilbert series of one-sided ladder determinantal rings, up to a trivial factor, in form of a determinant. This allows the convenient computation of these Hilbert series. The formula follows from a…

In this paper, with the help of trinomial coefficients we study some arithmetic properties of certain determiants involving reciprocals of binary quadratic forms over finite fields.

We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…

We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…

Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…

This paper establishes sharp bounds for the second and third-order Toeplitz determinants associated with starlike functions $f$ in the unit disk such that $f(z)-z$ has a zero of order $k+1$ at $z=0$. These bounds are further extended to…

In the work we propose an algorithm for a Wiener -- Hopf factorization of scalar polynomials based on notions of indices and essential polynomials. The algorithm uses computations with finite Toeplitz matrices and permits to obtain…

Determinants and symmetric functions of the eigenvalues of matrices characterizing stochastic processes with indepedent increments. Relationships with Fibonacci numbers are derived.

We obtain a sharp convergence rate for banded covariance matrix estimates of stationary processes. A precise order of magnitude is derived for spectral radius of sample covariance matrices. We also consider a thresholded covariance matrix…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…

We consider path integration of a fermionic oscillator with a one-parameter family of boundary conditions with respect to the time coordinate. The dependence of the fermion determinant on these boundary conditions is derived in a closed…

A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.

Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…

Determinantal point processes are point processes whose correlation functions are given by determinants of matrices. The entries of these matrices are given by one fixed function of two variables, which is called the kernel of the point…

Let $X$ be a Riemann surface of genus $g\ge 1$ endowed with a flat conical metric $m$ and let ${\rm det}\,\Delta$ be the $\zeta$-regularized determinant of the Friedrichs Laplacian on $(X,m)$. We derive variational formulas for ${\rm…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…