Related papers: Constant-Depth Frege Systems with Counting Axioms …
The approximate degree of a Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is the minimum degree of a real polynomial $p$ that approximates $f$ pointwise: $|f(x)-p(x)|\leq1/3$ for all $x\in\{0,1\}^n.$ For every $\delta>0,$ we construct CNF…
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…
The Sum-of-Squares (SoS) hierarchy, also known as Lasserre hierarchy, has emerged as a promising tool in optimization. However, it remains unclear whether fixed-degree SoS proofs can be automated [O'Donnell (2017)]. Indeed, there are…
Let $A$ be the algebra of all $n \times n$ matrices with entries from $\RR[x_1,\ldots,x_d]$ and let $G_1,\ldots,G_m,F \in A$. We will show that $F(a)v=0$ for every $a \in \RR^d$ and $v \in \RR^n$ such that $G_i(a)v=0$ for all $i$ if and…
Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of matrix identities as hard instances for strong proof systems. A matrix identity of $d \times d$ matrices over a field $\mathbb{F}$, is a…
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…
In this article, we study a calibrated version of Reifenberg theorem "with holes". In particular we study sets that are suitably approximable at all points and scales by calibrated planes and show that, without any additional hypotheses on…
In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gr\"obner basis computations and the heuristic first fall degree assumption and is not based on any…
Interest in anti-unification, the dual problem of unification, is on the rise due to applications within the field of software analysis and related areas. For example, anti-unification-based techniques have found uses within clone detection…
We prove that cancellation of reflexive modules over affine rings holds under some restrictions. We construct examples to show that this is false even over polynomial rings without the extra assumptions.
We present new, explicit, volume-preserving vector fields for polynomial divergence-free vector fields of arbitrary degree (both positive and negative). The main idea is to decompose the divergence polynomial by means of an appropriate…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…
Representation of the algebra of FP (anti)ghosts in string theory is studied by generalizing the recursive fermion system in the Cuntz algebra constructed previously. For that purpose, the pseudo Cuntz algebra, which is a $\ast$-algebra…
Hilbert's Nullstellensatz characterizes polynomials that vanish on the vanishing set of an ideal in C[x]. In the free algebra C<X> the vanishing set of a two-sided ideal I is defined in a dimension-free way using images in…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
We improve the accuracy of the GN Polynomial Closed-Form Model (PCFM) by incorporating the spectral NLI PSD and the coherent accumulation along the link. The proposed model is capable of accurately evaluating the NLI over any rectangular…
Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…
We study $\mathbb Z$-graded modules of nonzero level with arbitrary weight multiplicities over Heisenberg Lie algebras and the associated generalized loop modules over affine Kac-Moody Lie algebras. We construct new families of such…
A practical version of the polynomial canonical formalism is developed for normal mesoscopic systems consisting of N independent electrons. Drastic simplification of calculations is attained by means of proper ordering excited states of the…