Related papers: Constant-Depth Frege Systems with Counting Axioms …

A theorem of Hoischen states that given a positive continuous function $\varepsilon:\mathbb{R}\to\mathbb{R}$, an integer $n\geq 0$, and a closed discrete set $E\subseteq\mathbb{R}$, any $C^n$ function $f:\mathbb{R}\to\mathbb{R}$ can be…

It was shown in arXiv:0912.1456 that the large-$N$ reduction holds on group manifolds in the sense that a large-$N$ gauge theory on a group manifold is realized by a matrix model which is obtained by dimensionally reducing the original…

The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-studied and thoroughly classified. Now, fragments of…

Reverse Mathematics (RM for short) is a program in the foundations of mathematics where the aim is to find the minimal axioms needed to prove a given theorem of ordinary mathematics. Generally, the minimal axioms are equivalent to the…

We introduce new semi-algebraic proof systems for Quantified Boolean Formulas (QBF) analogous to the propositional systems Nullstellensatz, Sherali-Adams and Sum-of-Squares. We transfer to this setting techniques both from the QBF…

We consider a typical integration of induction in saturation-based theorem provers and investigate the effects of Skolem symbols occurring in the induction formulas. In a practically relevant setting we establish a Skolem-free…

Given a quadratic module, we construct its universal C*-algebra, and then use methods and notions from the theory of C*-algebras to study the quadratic module. We define residually finite-dimensional quadratic modules, and characterize them…

Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be a field, $S_1,S_2,..., S_n$ be finite nonempty subsets of…

We introduce the notion of nonevasive reduction, and show that for any monotone poset map $\phi:P\to P$, the simplicial complex $\Delta(P)$ {\tt NE}-reduces to $\Delta(Q)$, for any $Q\supseteq{\text{\rm Fix}}\phi$. As a corollary, we prove…

We present DeepFDM, a differentiable finite-difference framework for learning spatially varying coefficients in time-dependent partial differential equations (PDEs). By embedding a classical forward-Euler discretization into a convolutional…

We give a poly$(s,1/\epsilon)$-query algorithm for testing whether an unknown and arbitrary function $f: \{0,1\}^n \to \{0,1\}$ is an $s$-term DNF, in the challenging relative-error framework for Boolean function property testing that was…

Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…

Recently, the second and the third author developed sums of nonnegative circuit polynomials (SONC) as a new certificate of nonnegativity for real polynomials, which is independent of sums of squares. In this article we show that the SONC…

The field identification problem, including fixed point resolution, is solved for the non-hermitian symmetric $N=2$ superconformal coset theories. Thereby these models are finally identified as well-defined modular invariant CFTs. As an…

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…

First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…

We investigate an analogue of the Grothendieck $p$-curvature conjecture, where the vanishing of the $p$-curvature is replaced by the stronger condition, that the module with connection mod $p$ underlies a $\mathcal{D}_X$-module structure.…

We show that Connes' embedding conjecture (CEC) is equivalent to a real version of the same (RCEC). Moreover, we show that RCEC is equivalent to a real, purely algebraic statement concerning trace positive polynomials. This purely algebraic…