Related papers: IDP for 2-Partition Maximal Symmetric Polytopes
In this paper we investigate the ability of a neural network to approximate algebraic properties associated to lattice simplices. In particular we attempt to predict the distribution of Hilbert basis elements in the fundamental…
In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…
In our paper, we consider the following general problems: check feasibility, count the number of feasible solutions, find an optimal solution, and count the number of optimal solutions in $P \cap Z^n$, assuming that $P$ is a polyhedron,…
We identify a new way to divide the $\delta$-neighborhood of surfaces $\mathcal{M}\subset\mathbb{R}^3$ into a finitely-overlapping collection of rectangular boxes $S$. We obtain a sharp $(l^2,L^p)$ decoupling estimate using this…
In previous work, we have considered Hamiltonians associated with 3 dimensional conformally flat spaces, possessing 2, 3 and 4 dimensional isometry algebras. Previously our Hamiltonians have represented free motion, but here we consider the…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
We derive necessary and sufficient conditions for all global symmetries of the most general two Higgs doublet model (2HDM) scalar potential entirely in terms of reparametrization independent, i.e. basis invariant, objects. This culminates…
This is an expository version of our paper [arXiv:1902.07384]. Our aim is to present recent Macaulay2 algorithms for computation of mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over…
We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with…
We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…
A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…
In this paper we investigate the Ehrhart Theory of the independence matroid polytope of uniform matroids. It is proved that these polytopes have an Ehrhart polynomial with positive coefficients. To do that, we prove that indeed all…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
A systematic search for superintegrable quantum Hamiltonians describing the interaction between two particles with spin 0 and 1/2, is performed. We restrict to integrals of motion that are first-order (matrix) polynomials in the components…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…
Many probabilistic inference tasks involve summations over exponentially large sets. Recently, it has been shown that these problems can be reduced to solving a polynomial number of MAP inference queries for a model augmented with randomly…
In this work we introduce the concept of a sub-space decomposition, subject to a partition of the coordinates. Considering metrics determined by partial orders in the set of coordinates, the so called poset metrics, we show the existence of…
In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…
Using ultrafilter techniques we show that in any partition of $\mathbb{N}$ into 2 cells there is one cell containing infinitely many exponential triples, i.e. triples of the kind $a,b,a^b$ (with $a,b>1$). Also, we will show that any…