Related papers: Solid Amoebas of Maximally Sparse Polynomials
Density of Lipschitz functions in Newtonian spaces based on quasi-Banach function lattices is discussed. Newtonian spaces are first-order Sobolev-type spaces on abstract metric measure spaces defined via (weak) upper gradients. Our main…
A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…
We consider polynomial differential equations and make a number of contributions to the questions of (i) complexity of deciding stability, (ii) existence of polynomial Lyapunov functions, and (iii) existence of sum of squares (sos) Lyapunov…
In various articles, it is said that the class of all soft topologies on a common universe forms a complete lattice, but in this paper, we prove that it is a complete lattice. Some soft topologies are maximal and some are minimal with…
We introduce an information-theoretic framework for smooth structures on topological manifolds, replacing coordinate charts with small-scale entropy data of local probability probes. A concise set of axioms identifies admissible coordinate…
We prove an analogue of the Oppenheim conjecture for a system comprising an inhomogeneous quadratic form and a linear form in $3$ variables using dynamics on the space of affine lattices.
There is a vast theory of the asymptotic behavior of orthogonal polynomials with respect to a measure on $\mathbb{R}$ and its applications to Jacobi matrices. That theory has an obvious affine invariance and a very special role for…
The classification of loop symmetries in Kitaev's honeycomb lattice model provides a natural framework to study the abelian topological degeneracy. We derive a perturbative low-energy effective Hamiltonian, that is valid to all orders of…
We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…
A Bose-Hubbard model on a dynamical lattice was introduced in previous work as a spin system analogue of emergent geometry and gravity. Graphs with regions of high connectivity in the lattice were identified as candidate analogues of…
In this paper we discuss the notion of smoothness in complex algebraic supergeometry and we prove that all affine complex algebraic supergroups are smooth. We then prove the stabilizer theorem in the algebraic context, providing some useful…
We introduce a new approach to the study of a system of algebraic equations in the algebraic torus whose Newton polytopes have sufficiently general relative positions. Our method is based on the theory of Parshin's residues and tame symbols…
This paper is a survey of our work based on the stratified Morse theory of Goresky and MacPherson. First we discuss the Morse theory of Euclidean space stratified by an arrangement. This is used to show that the complement of a complex…
A variety of codimension $c$ in complex affine space is called positively hyperbolic if the imaginary part of any point in it does not lie in any positive linear subspace of dimension $c$. Positively hyperbolic hypersurfaces are defined by…
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm…
Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and…
Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(complement of L)} is greater than 1. In this paper, we prove that…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
The Folkman-Lawrence topological representation theorem, which states that every (loop-free) oriented matroid of rank $r$ can be represented as a pseudosphere arrangement on the $(r-1)$-dimensional sphere $S^{r-1}$, is one of the most…
Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…