Related papers: The method of shifted partial derivatives cannot s…

Let $A = - \sum \partial_k \, c_{kl} \, \partial_l$ be a degenerate sectorial differential operator with complex bounded mesaurable coefficients. Let $\Omega \subset \mathds{R}^d$ be open and suppose that $A$ is strongly elliptic on…

We show that every (possibly unbounded) convex polygon $P$ in $R^2$ with $m$ edges can be represented by inequalities $p_1 \ge 0,...,p_n \ge 0,$ where the $p_i$'s are products of at most $k$ affine functions each vanishing on an edge of $P$…

We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the…

We show that there is a sequence of explicit multilinear polynomials $P_n(x_1,\ldots,x_n)\in \mathbb{R}[x_1,\ldots,x_n]$ with non-negative coefficients that lies in monotone VNP such that any monotone algebraic circuit for $P_n$ must have…

Let $d$ and $n$ be positive integers, and $E/F$ be a separable field extension of degree $m=\binom{n+d}{n}$. We show that if $|F| > 2$, then there exists a point $P\in \mathbb{P}^n(E)$ which does not lie on any degree $d$ hypersurface…

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…

The weak maximum principle of finite element methods for parabolic equations is proved for both semi-discretization in space and fully discrete methods with $k$-step backward differentiation formulae for $k = 1,... ,6$, on a two-dimensional…

The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…

We show that the permanent of a matrix can be written as the expectation value of a function of random variables each with zero mean and unit variance. This result is used to show that Glynn's theorem and a simplified MacMahon theorem…

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

We prove an analogue of the Yomdin-Gromov Lemma for $p$-adic definable sets and more broadly in a non-archimedean, definable context. This analogue keeps track of piecewise approximation by Taylor polynomials, a nontrivial aspect in the…

Let $x_1, \dots, x_n$ be $n$ independent and identically distributed random variables with mean zero, unit variance, and finite moments of all remaining orders. We study the random polynomial $p_n$ having roots at $x_1, \dots, x_n$. We…

The permanent of a non-negative square matrix can be well approximated by finding the minimum of the Bethe free energy functions associated with some suitably defined factor graph; the resulting approximation to the permanent is called the…

We consider the massive scalar field equation $\Box_{g_{RN}} \phi = m^2 \phi$ on any subextremal Reissner--Nordstr\"{o}m exterior metric $g_{RN}$. We prove that solutions with localized initial data decay pointwise-in-time at the polynomial…

The \emph{Orbit Problem} consists of determining, given a linear transformation $A$ on $\mathbb{Q}^d$, together with vectors $x$ and $y$, whether the orbit of $x$ under repeated applications of $A$ can ever reach $y$. This problem was…