相关论文: Constant-Depth Frege Systems with Counting Axioms …
This article extends the classical Real Nullstellensatz to matrices of polynomials in a free $\ast$-algebra $\RR\axs$ with $x=(x_1, \ldots, x_n)$. This result is a generalization of a result of Cimpri\vc, Helton, McCullough, and the author.…
We study the power of negation in the Boolean and algebraic settings and show the following results. * We construct a family of polynomials $P_n$ in $n$ variables, all of whose monomials have positive coefficients, such that $P_n$ can be…
Grigoriev and Podolskii (2018) have established a tropical analogue of the effective Nullstellensatz, showing that a system of tropical polynomial equations is solvable if and only if a linearized system obtained from a truncated Macaulay…
We give upper bounds for the differential Nullstellensatz in the case of ordinary systems of differential algebraic equations over any field of constants $K$ of characteristic $0$. Let $\vec{x}$ be a set of $n$ differential variables,…
Random 3CNF formulas constitute an important distribution for measuring the average-case behavior of propositional proof systems. Lower bounds for random 3CNF refutations in many propositional proof systems are known. Most notably are the…
We present bounds for the sparseness and for the degrees of the polynomials in the Nullstellensatz. Our bounds depend mainly on the unmixed volume of the input polynomial system. The degree bounds can substantially improve the known ones…
We study the complexity of inverse cellular automata on configurations of bounded size. Deciding injectivity in this setting is co-NP-complete by a theorem of Durand. We give a simpler proof of this theorem by a direct reduction from UNSAT…
In this paper, we investigate the proof complexity of a wide range of substructural systems. For any proof system $\mathbf{P}$ at least as strong as Full Lambek calculus, $\mathbf{FL}$, and polynomially simulated by the extended Frege…
In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…
We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…
We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…
We analyse how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semi-algebraic proof systems, the classical constructions of…
We introduce power term polynomial algebra, a representation language for Boolean formulae designed to bridge conjunctive normal form (CNF) and algebraic normal form (ANF). The language is motivated by the tiling mismatch between these…
We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi, where the circuits comprising the proof come from various restricted algebraic…
In this paper, we prove explicit reciprocity laws for a class of formal Drinfeld modules having stable reduction of height one, in the spirit of those existing in characteristic zero (cf. the work of Wiles). We begin by defining the Kummer…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
This article gives a class of Nullstellens\"atze for noncommutative polynomials. The singularity set of a noncommutative polynomial $f=f(x_1,\dots,x_g)$ is $Z(f)=(Z_n(f))_n$, where $Z_n(f)=\{X \in M_n^g: \det f(X) = 0\}.$ The first main…
The basic strategy underlying models of spontaneous wave function collapse (collapse models) is to modify the Schroedinger equation by including nonlinear stochastic terms, which tend to localize wave functions in space in a dynamical…
We present sharp estimates for the degree and the height of the polynomials in the Nullstellensatz over $\Z$. The result improves previous work of Philippon, Berenstein-Yger and Krick-Pardo. We also present degree and height estimates of…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…