Related papers: Monotone Classes Beyond VNP
We determine the space of 1-point correlation functions associated with the Moonshine module: they are precisely those modular forms of non-negative integral weight which are holomorphic in the upper half plane, have a pole of order at most…
We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…
Gopal Prasad and A. S. Rapinchuk defined a notion of weakly commensurable lattices in a semisimple group, and gave a classification of weakly commensurable Zariski dense subgroups. A motivation was to classify pairs of locally symmetric…
We introduce linear holonomy on Poisson manifolds. The linear holonomy of a Poisson structure generalizes the linearized holonomy on a regular symplectic foliation. However, for singular Poisson structures the linear holonomy is defined for…
We give a polynomial-time algorithm for learning high-dimensional halfspaces with margins in $d$-dimensional space to within desired TV distance when the ambient distribution is an unknown affine transformation of the $d$-fold product of an…
In this work we present a definition for coherence and compatibility of multilinear mappings and homogenous polynomial classes. These definitions are more restricted than the ones proposed before. We began analyzing this new definition in a…
A system (P_a: a in A) of probability measures on a common state space S indexed by another index set A can be ``realized'' by a system (X_a: a in A) of S-valued random variables on some probability space in such a way that each X_a is…
We study algebraic complexity classes and their complete polynomials under \emph{homogeneous linear} projections, not just under the usual affine linear projections that were originally introduced by Valiant in 1979. These reductions are…
We present a novel, general, and unifying point of view on sparse approaches to polynomial optimization. Solving polynomial optimization problems to global optimality is a ubiquitous challenge in many areas of science and engineering.…
In search of a meaningful 2-dimensional analog to mono- tonicity, we introduce two new definitions and give examples of and dis- cuss the relationship between these definitions and others that we found in the literature. Note: After we…
We study the homotopy types of certain spaces closely related to the spaces of algebraic (rational) maps from the $m$ dimensional real projective space into the $n$ dimensional complex projective space for $2\leq m\leq 2n$ (we conjecture…
We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…
We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension of the well-known size-change termination method.…
The amoeba of a Laurent polynomial $f \in \C[z_1^{\pm 1},\ldots,z_n^{\pm 1}]$ is the image of its zero set $\mathcal{V}(f)$ under the log-absolute-value map. Understanding the space of amoebas (i.e., the decomposition of the space of all…
We prove a comparison result for viscosity solutions of second order parabolic partial differential equations in the Wasserstein space. The comparison is valid for semisolutions that are Lipschitz continuous in the measure in a…
Let $V\subset\R^m$ be a convex body, symmetric about all coordinate hyperplanes, and let $\PP_{aV},\, a\ge 0$, be a set of all algebraic polynomials whose Newton polyhedra are subsets of $aV$. We prove a limit equality as $a\to \iy$ between…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
In this paper, we propose linear maps over the space of all polynomials $f(x)$ in $\mathbb{F}_q[x]$ that map $0$ to itself, through their evaluation map. Properties of these linear maps throw up interesting connections with permutation…
This work demonstrates a methodology for using deep learning to discover simple, practical criteria for classifying matrices based on abstract algebraic properties. By combining a high-performance neural network with explainable AI (XAI)…
In this article, we consider the following class of stochastic partial differential equations (SPDE): \begin{equation*} \left\{\begin{aligned}\mathrm{d} \mathbf{X}(t)&=\mathrm{A}(t,\mathbf{X}(t))\mathrm{d}…