Related papers: Maximum Likelihood Duality for Determinantal Varie…

Let $(m_1, m_2)$ be a pair of positive integers. Denote by $\mathbb{P}^1$ the complex projective line, and by $\mathbb{P}^1_{m_1,m_2}$ the orbifold complex projective line obtained from $\mathbb{P}^1$ by adding $\mathbb{Z}_{m_1}$ and…

Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our main results concern relationships with…

We establish the multiplicity conjecture of Herzog, Huneke, and Srinivasan about the multiplicity of graded Cohen-Macaulay algebras over a field, for codimension two algebras and for Gorenstein algebras of codimension three. In fact, we…

The Lichtenbaum-Quillen conjecture for smooth complex varieties states that algebraic and topological K-theory with finite coefficients become isomorphic in high degrees. We define the "Lichtenbaum-Quillen dimension" of a variety in terms…

We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects,…

The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function is equal to the log of the rank of its associated matrix,…

This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on matrix tuples as…

In algebraic statistics, the maximum likelihood degree of a statistical model is the number of complex critical points of its log-likelihood function. A priori knowledge of this number is useful for applying techniques of numerical…

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

The maximum likelihood degree (ML degree) measures the algebraic complexity of a fundamental optimization problem in statistics: maximum likelihood estimation. In this problem, one maximizes the likelihood function over a statistical model.…

As is the case for many curved exponential families, the computation of maximum likelihood estimates in a multivariate normal model with a Kronecker covariance structure is typically carried out with an iterative algorithm, specifically, a…

We obtain the almost sure strong consistency and the Berry-Esseen type bound for the maximum likelihood estimator Ln of the ensemble L for determinantal point processes (DPPs), strengthening and completing previous work initiated in Brunel,…

The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…

This paper deals with multivariate Gaussian models for which the covariance matrix is a Kronecker product of two matrices. We consider maximum likelihood estimation of the model parameters, in particular of the covariance matrix. There is…

Computing all critical points of a monomial on a very affine variety is a fundamental task in algebraic statistics, particle physics and other fields. The number of critical points is known as the maximum likelihood (ML) degree. When the…

For the basic maximum likelihood estimating function of the two parameters Weibull distribution, a simple proof on its global monotonicity is given to ensure the existence and uniqueness of its solution. The boundary of the function's…

We prove the conjecture of Falikman--Friedland--Loewy on the parity of the degrees of projective varieties of $n\times n$ complex symmetric matrices of rank at most $k$. We also characterize the parity of the degrees of projective varieties…

We study the critical points of monomial functions over an algebraic subset of the probability simplex. The number of critical points on the Zariski closure is a topological invariant of that embedded projective variety, known as its…

We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…

We introduce the Double leaves basis, a combinatorial basis for the Hom spaces between two Bott-Samelson-Soergel bimodules. As an application we give a combinatorial algorithm to find, for any given Weyl or affine Weyl group, the set of…