Related papers: The Entropic Discriminant
We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…
We introduce a new framework for characterizing identified sets of structural and counterfactual parameters in econometric models. By reformulating the identification problem as a set membership question, we leverage the separating…
A differential module is a module equipped with a square-zero endomorphism. This structure underpins complexes of modules over rings, as well as differential graded modules over graded rings. We establish lower bounds on the class--a…
Generalized entropic projections and dominating points are solutions to convex minimization problems related to conditional laws of large numbers. They appear in many areas of applied mathematics such as statistical physics, information…
Entropy is a measure of heterogeneity widely used in applied sciences, often when data are collected over space. Recently, a number of approaches has been proposed to include spatial information in entropy. The aim of entropy is to…
In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…
The discriminant of a polynomial map is central to problems from affine geometry and singularity theory. Standard methods for characterizing it rely on elimination techniques that can often be ineffective. This paper concerns polynomial…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
We study a generalization of the discriminant of a polynomial, which we call the tolerant. The tolerant differs by multiplication by a square from the duplicant, which was discovered in recent work on $\mathbb{P}^1$-loop spaces in motivic…
These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…
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…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
We study a quantity called discrete layered entropy, which approximates the Shannon entropy within a logarithmic gap. Compared to the Shannon entropy, the discrete layered entropy is piecewise linear, approximates the expected length of the…
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…
Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…
A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…
In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
Similarity-sensitive entropy measures the uncertainty of a probability law relative to a similarity kernel that encodes the distinguishability between states. We develop a measure-theoretic treatment covering both finite similarity matrices…
For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the…