相关论文: The Varchenko Determinant of an Oriented Matroid
This article evaluates the determinants of two classes of special matrices, which are both from a number theory problem. Applications of the evaluated determinants can be found in [arXiv:math.NT/0509523]. Note that the two determinants are…
The multi-indexed orthogonal polynomials (the Meixner, little $q$-Jacobi (Laguerre), ($q$-)Racah, Wilson, Askey-Wilson types) satisfying second order difference equations were constructed in discrete quantum mechanics. They are polynomials…
We compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to…
The entropic discriminant is a non-negative polynomial associated to a matrix. It arises in contexts ranging from statistics and linear programming to singularity theory and algebraic geometry. It describes the complex branch locus of the…
Let $(p_n)_n$ be a sequence of orthogonal polynomials with respect to the measure $\mu$. Let $T$ be a linear operator acting in the linear space of polynomials $\PP$ and satisfying that $\dgr(T(p))=\dgr(p)-1$, for all polynomial $p$. We…
The Gelfand-Yaglom formula relates functional determinants of the one-dimensional second order differential operators to the solutions of the corresponding initial value problem. In this work we generalise the Gelfand-Yaglom method by…
The derivation of the time-dependent variational equations of the Multi-Configuration Time-Dependent Hartree (MCTDH) method for high-dimensional quantum propagation is revisited from the perspective of tangent space projection methods. In…
The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like "item $i$ is closer to item $j$ than item $k$". Ordinal constraints like…
The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\mathcal{H}$-matroids by the greedy algorithm. In this…
We consider the problem of construction of determinant formulas for the partition function of the six-vertex model with domain wall boundary conditions. In pioneering works of Korepin and Izergin a determinant formula was proposed and…
Given a bichromatic point set $P=\textbf{R} \cup \textbf{B}$ of red and blue points, a separator is an object of a certain type that separates $\textbf{R}$ and $\textbf{B}$. We study the geometric separability problem when the separator is…
Las Vergnas and Hamidoune studied the number of circuits needed to determine an oriented matroid. In this paper we investigate this problem and some new variants, as well as their interpretation in particular classes of matroids. We present…
I present a partly pedagogic discussion of the Gel'fand-Yaglom formula for the functional determinant of a one-dimensional, second order difference operator, in the simplest settings. The formula is a textbook one in discrete…
One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…
We set up a general theory for a quantum Wasserstein distance of order 1 in an operator algebraic framework, extending recent work in finite dimensions. In addition, this theory applies not only to states, but also to channels, giving a…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the traces of a small number of matrix powers of a specially…
We introduce the triangulant of two matrices, and relate it to the existence of orthogonal eigenvectors. We also use it for a new characterization of mutually unbiased bases. Generalizing the notion, we introduce higher order triangulants…
The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. This improves previous upper bounds, which were of the form an exponential times the factorial. Our upper bound comes from an explicit power sum…
The Cholesky decomposition is a popular way of decomposing positive definite matrices; in particular it leads to a simple formula for computing the determinant. We present and proof an equivalent formula for computing the Fredholm…