Related papers: Viro's patchworking and the signed reduced A-discr…
Hilbert specialization is an important tool in Field Arithmetic and Arithmetic Geometry, which has usually been intended for polynomials, hence hypersurfaces, and at scalar values. In this article, first, we extend this tool to prime…
We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
A recent novel derivation of the representation of Virasoro singular vectors in terms of Jack polynomials is extended to the supersymmetric case. The resulting expression of a generic super-Virasoro singular vector is given in terms of a…
Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and…
We discuss a cheap and stable approach to polynomial moment-based compression of multivariate measures by discrete signed measures. The method is based on the availability of an orthonormal basis and a low-cardinality algebraic quadrature…
This paper undertakes the study of the topology of T-manifolds of arbitrary codimension obtained by combinatorial patchworking with real phase structure as described by Brugall\'e, L\'opez de Medrano and Rau (2024). We prove new bounds on…
Let $F(X,Y)=Y^d+a_1(X)Y^{d-1}+...+a_d(X)$ be a polynomial in $n+1$ variables $(X,Y)=(X_1,...,X_n,Y)$ with coefficients in an algebraically closed field K. Assuming that the discriminant $D(X)=\disc_Y F(X,Y)$ is nonzero we investigate the…
Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…
By applying Seifert's algorithm to a special alternating diagram of a link L, one obtains a Seifert surface F of L. We show that the support of the sutured Floer homology of the sutured manifold complementary to F is affine isomorphic to…
We consider a generalized discriminant associated to a symmetric space which generalizes the discriminant of real symmetric matrices, and note that it can be written as a sum of squares of real polynomials. A method to estimate the minimum…
Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…
Let $f(\mathbb{z},\bar{\mathbb{z}})$ be a convenient Newton non-degenerate mixed polynomial with strongly polar non-negative mixed weighted homogeneous face functions. We consider a convenient regular simplicial cone subdivision $\Sigma^*$…
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…
We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…
We study the topology of the real algebraic hypersurfaces in $\mathbb{P}^n$ that can be constructed via combinatorial patchworking using triangulations that are dilations by two of other triangulations. By examining the real critical points…
In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…