Related papers: CD(4) has bounded width

We investigate the evaluation of conjunctive queries over static and dynamic relations. While static relations are given as input and do not change, dynamic relations are subject to inserts and deletes. We characterise syntactically three…

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…

We construct polynomial conformal invariants, the vanishing of which is necessary and sufficient for an $n$-dimensional suitably generic (pseudo-)Riemannian manifold to be conformal to an Einstein manifold. We also construct invariants…

Let $C$ be an irreducible algebraic curve defined over a number field and inside an algebraic torus of dimension at least 3. We partially answer a question posed by Levin on points on $C$ for which a non-trivial power lies again on $C$. Our…

We consider a system of rotators subject to a small quasi-periodic forcing. We require the forcing to be analytic and satisfy a time-reversibility property and we assume its frequency vector to be Bryuno. Then we prove that, without…

We look at nondeterministic finite automata augmented with multiple reversal-bounded counters where, during an accepting computation, the behavior of the counters is specified by some fixed pattern. These patterns can serve as a useful…

This paper proves a long standing conjecture in formal language theory. It shows that all regular languages are Church-Rosser congruential. The class of Church-Rosser congruential languages was introduced by McNaughton, Narendran, and Otto…

We study orientability in spaces with Ricci curvature bounded below. Building on the theory developed by Honda, we establish equivalent characterizations of orientability for Ricci limit and RCD spaces in terms of the orientability of their…

In this paper, we study the $C$-width of HNN extension of a group via its proper isomorphic subgroups and amalgamated free product of two groups via their proper isomorphic subgroups with respect to conjugation invariant generating set. We…

We prove that functions defined on a lattice in a finite dimensional torus with bounded finite differences can be smoothly extended to the whole torus, and relate the bounds on the extension's derivatives with bounds on the original…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

We investigate a class of models in 1+1 dimensions with four fermion interaction term. At each order of the perturbation expansion, the models are ultraviolet finite and Lorentz non-invariant. We show that for certain privileged values of…

We study the satisfiability of string constraints where context-free membership constraints may be imposed on variables. Additionally a variable may be constrained to be a subword of a word obtained by shuffling variables and their…

We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…

A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of…

We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…