Related papers: IDP for 2-Partition Maximal Symmetric Polytopes

Using a hyperbolic complex plane, we study the realization of the underlying hyperbolic symmetry as an internal symmetry that enables the unification of scalar fields of cosmological and particle physics interest. Such an unification is…

We introduce a new non-degeneracy condition at infinity for a real or a mixed polynomial mapping $F$ which allows us to approximate its bifurcation locus in terms of certain Newton polyhedra. We derive a sufficiency result for the Jacobian…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple…

The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…

Let $R$ be a polynomial ring and $I \subset R$ be a perfect ideal of height two minimally generated by forms of the same degree. We provide a formula for the multiplicity of the saturated special fiber ring of $I$. Interestingly, this…

This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…

We show that there exists a saturated graded ideal in a standard graded polynomial ring which has the largest total Betti numbers among all saturated graded ideals for a fixed Hilbert polynomial.

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…

We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are…

We study harmonic surfaces in $\mathbb{R}^3$ through the framework of harmonic Enneper immersions and prove a superposition principle for such surfaces. We prove that minimal and maximal surfaces admit a decomposition into harmonic…

Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…

We develop a special multilinear complex interpolation theorem that allows us to prove an optimal version of the bilinear H\"ormander multiplier theorem concerning symbols that lie in the Sobolev space $L^r_s(\mathbb R^{2n})$, $2\le…

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…

Superintegrable systems are a class of physical systems which possess more conserved quantities than their degrees of freedom. The study of these systems has a long history and continues to attract significant international attention. This…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…

Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…

In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…