Related papers: Families of polytopes with rational linear precisi…

We investigate multi-graded Gorenstein semigroup algebras associated with an infinite family of reflexive lattice simplices. For each of these algebras, we prove that their multigraded Poincar\'e series is rational. Our method of proof is…

Let A be an ample line bundle on a projective toric variety X of dimension n. We show that if l>=n-1+p, then A^l satisfies the property N_p. Applying similar methods, we obtain a combinatorial theorem: For a given lattice polytope P we give…

We classify the homogeneous polynomials in three variables whose toric polar linear system defines a Cremona transformation. This classification also includes, as a proper subset, the classification of toric surface patches from geometric…

In many applications involving binary variables, only pairwise dependence measures, such as correlations, are available. However, for multi-way tables involving more than two variables, these quantities do not uniquely determine the joint…

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…

We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes…

It has been shown recently that monomial maps in a large class respecting the action of the infinite symmetric group have, up to symmetry, finitely generated kernels. We study the simplest nontrivial family in this class: the maps given by…

A Ringel ladder can be formed by a self-bar-amalgamation operation on a symmetric ladder, that is, by joining the root vertices on its end-rungs. The present authors have previously derived criteria under which linear chains of copies of…

In this contribution we provide initial findings to the problem of modeling fuzzy rating responses in a psychometric modeling context. In particular, we study a probabilistic tree model with the aim of representing the stage-wise mechanisms…

We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar resolution, we show its Turing-completeness and to illustrate…

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

Construction of phylogenetic trees has traditionally focused on binary trees where all species appear on leaves, a problem for which numerous efficient solutions have been developed. Certain application domains though, such as viral…

We further the study of local profiles of trees. Bubeck and Linial showed that the set of 5-profiles contains a certain polytope, namely the convex hull of d-millipedes, and they proved that the segment [0-millipede, 1-millipede]…

A staged tree model is a discrete statistical model encoding relationships between events. These models are realised by directed trees with coloured vertices. In algebro-geometric terms, the model consists of points inside a toric variety.…

We define a notion of height for rational points with respect to a vector bundle on a proper algebraic stack with finite diagonal over a global field, which generalizes the usual notion for rational points on projective varieties. We…

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

We study the homotopy groups of generic leaves of logarithmic foliations on complex projective manifolds. We exhibit a relation between the homotopy groups of a generic leaf and of the complement of the polar divisor of the logarithmic…

Many machine learning tasks can be formulated in terms of predicting structured outputs. In frameworks such as the structured support vector machine (SVM-Struct) and the structured perceptron, discriminative functions are learned by…

Maximum likelihood estimators are used extensively to estimate unknown parameters of stochastic trait evolution models on phylogenetic trees. Although the MLE has been proven to converge to the true value in the independent-sample case, we…

Maximal mediated sets (MMS), introduced by Reznick, are distinguished subsets of lattice points in integral polytopes with even vertices. MMS of Newton polytopes of AGI-forms and nonnegative circuit polynomials determine whether these…