Related papers: A Direct Ultrametric Approach to Additive Complexi…

We investigate the real algebraic complexity of contours of amoebas associated with algebraic hypersurfaces and complete intersections in complex algebraic tori. Motivated by the foundational estimates of Lang--Shapiro--Shustin \cite{LSS},…

The Casas-Alvero conjecture states: if a complex univariate polynomial has a common root with each of its derivatives, then it has a unique root. We show that hypothetical counterexamples must have at least 5 different roots. The first case…

We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…

Let $\mathfrak p$ be a proper parabolic subalgebra of a simple Lie algebra $\mathfrak g$. Writing $\mathfrak p=\mathfrak r\oplus \mathfrak m$, with $\mathfrak r$ being the Levi factor of $\mathfrak p$ and $\mathfrak m$ the nilpotent radical…

The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems --- it contains the maximum clique problem in graphs as a special case. It is known that the problem allows a…

A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…

The topology of Liouville sets of the real forms of the complex generic Neumann system depends indirectly on the roots of the special polynomial $U_{\cal S}(\lambda)$. For certain polynomials, the existence and positions of the real roots,…

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Based upon the general theory, developed by the author, on the parametrization of the irreducible representations of the hyper special compact groups corresponding to the regular adjoint orbit, supercuspidal representations of $SL_n(F)$ are…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Since the seminal works of Strassen and Valiant it has been a central theme in algebraic complexity theory to understand the relative complexity of algebraic problems, that is, to understand which algebraic problems (be it bilinear maps…

In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…

When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…

Bernstein-Sato polynomial of a hypersurface is an important object with numerous applications. It is known, that it is complicated to obtain it computationally, as a number of open questions and challenges indicate. In this paper we propose…

For a simple Lie algebra $\mathfrak{g}$ and an irreducible faithful representation $\pi$ of $\mathfrak{g}$, we introduce the Schur polynomials of $(\mathfrak{g},\pi)$-type. We then derive the Sato-Zhou type formula for tau functions of the…

Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…

We explore computational aspects of maximum likelihood estimation of the mixture proportions of a nonparametric finite mixture model -- a convex optimization problem with old roots in statistics and a key member of the modern data analysis…

Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, e.g. in scheduling…

The Weak Gravity Conjecture imposes stringent constraints on effective field theories to allow for an ultraviolet completion within quantum gravity. While substantial evidence supports the conjecture across broad classes of string…