Related papers: Viro's patchworking and the signed reduced A-discr…

By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…

We study the complexity of representing polynomials as a sum of products of polynomials in few variables. More precisely, we study representations of the form $$P = \sum_{i = 1}^T \prod_{j = 1}^d Q_{ij}$$ such that each $Q_{ij}$ is an…

For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed…

We give a new practical method for computing subvarieties of projective hypersurfaces. By computing the periods of a given hypersurface X, we find algebraic cohomology cycles on X. On well picked algebraic cycles, we can then recover the…

In this note we prove an effective characterization of when two finite-degree covers of a connected, orientable surface of negative Euler characteristic are isomorphic in terms of which curves have simple elevations, weakening the…

To study any dynamical system it is useful to find a partition that allows essentially faithful encoding (injective, up to a small exceptional set) into a subshift. Most topological and measure-theoretic systems can be represented by…

The classical construction of representations of quivers enables us to consider linear maps between several vector spaces. The mixed representations of quivers helps us to work with linear maps as well as bilinear forms on several vector…

Let $\Sigma$ be an $n$-vertex controllable or almost controllable signed bipartite graph, and let $\Delta_\Sigma$ denote the discriminant of its characteristic polynomial $\chi(\Sigma; x)$. We prove that if (\rmnum{1}) the integer $2^{…

We classify projective toric manifolds whose dual variety is not a hypersurface in the dual projective space. Under the standard dictionary between toric geometry and convex geometry, they correspond to certain convex Delzant integer…

It is well-known that a quiver Q of type A_n is representation-finite, and that its indecomposable representations are thin (all Jordan-Hoelder multiplicities are 0 or 1). By now, various methods of proof are known. The aim of this note is…

Let (G,V) be a regular prehomogeneous vector space (abbreviated to PV), where G is a connected reductive algebraic group over C. If $V= \oplus_{i=0}^{n}V_{i}$ is a decomposition of V into irreducible representations, then, in general, the…

We present a quite efficient method to calculate the roots of Bernstein-Sato polynomial for a defining polynomial $f$ of a projective hypersurface $Z\subset{\mathbb P}^{n-1}$ of degree $d$ having only weighted homogeneous isolated…

Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…

The zero locus of a bivariate polynomial $P(x,y)=0$ defines a compact Riemann surface $\Sigma$. The fundamental second kind differential is a symmetric $1\otimes 1$ form on $\Sigma\times \Sigma$ that has a double pole at coinciding points…

Spectral decomposition of matrices is a recurring and important task in applied mathematics, physics and engineering. Many application problems require the consideration of matrices of size three with spectral decomposition over the real…

We show the existence of systems of n polynomial equations in n variables, with a total of n+k+1 distinct monomial terms, possessing [n/k+1]^k nondegenerate positive solutions. (Here, [x] is the integer part of a positive number x.) This…

Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…

We introduce a variation of the well-known Newton-Hironaka polytope for algebroid hypersurfaces. This combinatorial object is a perturbed version of the original one, parametrized by a real number. For well-chosen values of the parameter,…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Collision detection is a critical functionality for robotics. The degree to which objects collide cannot be represented as a continuously differentiable function for any shapes other than spheres. This paper proposes a framework for…