Related papers: Monotone Classes Beyond VNP

For each pair $(m,n)$ of positive integers with $(m,n)\not= (1,1)$ and an arbitrary field $\bf F$ with algebraic closure $\overline{\bf F}$, let $\rm Po^{d,m}_n(\bf F)$ denote the space of $m$-tuples $(f_1(z),\cdots ,f_m(z))\in \bf F [z]^m$…

The most fundamental model of a molecule is a cloud of unordered atoms, even without chemical bonds that can depend on thresholds for distances and angles. The strongest equivalence between clouds of atoms is rigid motion, which is a…

In the late 80s, V.~Arnold and V.~Vassiliev initiated the topological study of the space of real univariate polynomials of a given degree which have no real roots of multiplicity exceeding a given positive integer. Expanding their studies,…

In recent years, monotone double Hurwitz numbers were introduced as a naturally combinatorial modification of double Hurwitz numbers. Monotone double Hurwitz numbers share many structural properties with their classical counterparts, such…

We will give a geometric description of the nth transversal homotopy monoid of k-dimensional complex projective space, where we stratify by lower dimensional complex projective spaces in the usual way. Transversal homotopy monoids are…

We study the dynamics of polynomial-like mappings in several variables. A special case of our results is the following theorem. Let f be a proper holomorphic map from an open set U onto a Stein manifold V, $U\subset\subset V$. Assume f is…

The article is devoted to investigation of the classes of functions belonging to the gaps between classes $P_{n+1}(I)$ and $P_{n}(I)$ of matrix monotone functions for full matrix algebras of successive dimensions. In this paper we address…

We generalize the theory of base norm spaces to the complex case, and further to the noncommutative setting relevant to `quantum convexity'. In particular, we establish the duality between complex Archimedean order unit spaces and complex…

Volume polynomials form a distinguished class of log-concave polynomials with remarkable analytic and combinatorial properties. I will survey realization problems related to them, review fundamental inequalities they satisfy, and discuss…

We derive sharp, explicit constants in inverse trace inequalities for polynomial functions belonging to $\mathbb{P}_p(T)$ (polynomial space with total degree $p$) that are orthogonal to the lower-order subspace $\mathbb{P}_n(T)$, $n\leq p$,…

We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

We prove that QCSP$(\mathbb{N};x=y\rightarrow y=z)$ is PSpace-complete, settling a question open for more than ten years. This completes the complexity classification for the QCSP over equality languages as a trichotomy between Logspace,…

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

In a recent result, Knop, Lovett, McGuire and Yuan (STOC 2021) proved the log-rank conjecture for communication complexity, up to log n factor, for any Boolean function composed with AND function as the inner gadget. One of the main tools…

In the early 1990's, Billera and Sturmfels introduced the monotone path polytope (MPP), a special case of the general theory of fiber polytopes that associates a polytope to a pair $(P,\varphi)$ of a polytope $P$ and linear functional…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

We present a new similarity measure based on information theoretic measures which is superior than Normalized Compression Distance for clustering problems and inherits the useful properties of conditional Kolmogorov complexity. We show that…

Adversarially robust PAC learning has proved to be challenging, with the currently best known learners [Montasser et al., 2021a] relying on improper methods based on intricate compression schemes, resulting in sample complexity exponential…