Related papers: A Note on Semi-Algebraic Proofs and Gaussian Elimi…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
We consider Complex Ginzburg-Landau equations with a polynomial nonlinearity in the real line. We use splitting-methods to prove well-posedness for a subset of almost periodic spaces. Specifically, we prove that if the initial condition has…
Polynomial $n\times n$ matrices $A(\lambda)$ and $B(\lambda)$ over a field $\mathbb F $ are called semi-scalar equivalent if there exist a nonsingular $n\times n$ matrix $P$ over the field $\mathbb F $ and an invertible $n\times n$ matrix…
This paper is devoted to studying difference indices of quasi-prime difference algebraic systems. We define the quasi dimension polynomial of a quasi-prime difference algebraic system. Based on this, we give the definition of the difference…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…
The question about maximal size of independent system of word equations is one of the most striking problems in combinatorics on words. Recently, Aleksi Saarela has introduced a new approach to the problem that is based on linear-algebraic…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.
We prove large sieve inequalities with multivariate polynomial moduli and deduce a general Bombieri--Vinogradov type theorem for a class of polynomial moduli having a sufficient number of variables compared to its degree. This sharpens…
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…
A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…
This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…
In a first contribution, we revisit two certificates of positivity on (possibly non-compact) basic semialgebraic sets due to Putinar and Vasilescu [Comptes Rendus de l'Acad\'emie des Sciences-Series I-Mathematics, 328(6) (1999) pp.…
We overview classifications of simple infinite-dimensional complex $\mathbb{Z}$-graded Lie (super)algebras of polynomial growth, and their deformations. A subset of such Lie (super)algebras consist of vectorial Lie (super)algebras whose…
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead of clauses. We demonstrate polynomial-size refutations for…
Strong algebraic proof systems such as IPS (Ideal Proof System; Grochow-Pitassi [GP18]) offer a general model for deriving polynomials in an ideal and refuting unsatisfiable propositional formulas, subsuming most standard propositional…
The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…
We consider the forced surface quasi-geostrophic equation with supercritical dissipation. We show that linear instability for steady state solutions leads to their nonlinear instability. When the dissipation is given by a fractional…
Verification methods based on SAT, SMT, and Theorem Proving often rely on proofs of unsatisfiability as a powerful tool to extract information in order to reduce the overall effort. For example a proof may be traversed to identify a minimal…