English
Related papers

Related papers: CD(4) has bounded width

200 papers

An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP {\Lambda} is tractable…

Computational Complexity · Computer Science 2015-01-08 Jonah Brown-Cohen , Prasad Raghavendra

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Number Theory · Mathematics 2015-05-13 Umberto Zannier

Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time, either the class of languages reducible to A (the lower…

Computational Complexity · Computer Science 2007-05-23 John M. Hitchcock

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…

Logic in Computer Science · Computer Science 2020-07-22 Manuel Bodirsky , Antoine Mottet , Miroslav Olšák , Jakub Opršal , Michael Pinsker , Ross Willard

We establish a framework that allows us to transfer results between some constraint satisfaction problems with infinite templates and promise constraint satisfaction problems. On the one hand, we obtain new algebraic results for…

Logic in Computer Science · Computer Science 2025-03-21 Antoine Mottet

Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter…

Logic in Computer Science · Computer Science 2015-03-13 Stephan Kreutzer , Siamak Tazari

We study the power of the bounded-width consistency algorithm in the context of the fixed-template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that the template of every PCSP that is solvable in bounded…

Computational Complexity · Computer Science 2021-07-14 Albert Atserias , Víctor Dalmau

We continue and extend our earlier investigation ``Strings in a Time-Dependent Orbifold'' (hep-th/0204168). We formulate conditions for an orbifold to be amenable to perturbative string analysis and classify the low dimensional orbifolds…

High Energy Physics - Theory · Physics 2009-11-07 Hong Liu , Gregory Moore , Nathan Seiberg

A discrete temporal constraint satisfaction problem is a constraint satisfaction problem (CSP) whose constraint language consists of relations that are first-order definable over $(\Bbb Z,<)$. Our main result says that every distance CSP is…

Logic · Mathematics 2016-04-27 Manuel Bodirsky , Barnaby Martin , Antoine Mottet

We present in this paper a result about existence and convexity of solutions to a free boundary problem of Bernoulli type, with non constant gradient boundary constraint depending on the outer unit normal. In particular we prove that, in…

Analysis of PDEs · Mathematics 2010-09-08 Chiara Bianchini

In this article, we give a proof for that the cardinality of a function basis of the invariants for a finite dimensional real vector space by a compact group is lower bounded by the intuitive difference of the dimensions of the vector space…

Algebraic Geometry · Mathematics 2018-08-06 Shenglong Hu , Liqun Qi

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

Group Theory · Mathematics 2014-02-26 Gustavo A. Fernández-Alcober , Marta Morigi

We give an elementary proof of a generalization of Bourgain and Tzafriri's Restricted Invertibility Theorem, which says roughly that any matrix with columns of unit length and bounded operator norm has a large coordinate subspace on which…

Functional Analysis · Mathematics 2010-10-05 Daniel A. Spielman , Nikhil Srivastava

For an arbitrary representation $\rho$ of a complex finite-dimensional Lie algebra, we construct a collection of numbers that we call the Jordan-Kronecker invariants of $\rho$. Among other interesting properties, these numbers provide lower…

Representation Theory · Mathematics 2019-12-02 Alexey Bolsinov , Anton Izosimov , Ivan Kozlov

Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…

Logic · Mathematics 2024-02-19 Ali Enayat , Albert Visser

Invariant torus are constructed under assumption that the homogeneous system admits an exponential dichotomy on the semi-axes. The main result is closely related with the well-known Palmer's lemma and results of Boichuk A.A., Samoilenko…

Dynamical Systems · Mathematics 2014-11-13 O. A. Pokutnyi

We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under two kinds of discrete subgroups of $O(3)$ of order four. We also characterize the convex bodies with the minimal volume product…

Metric Geometry · Mathematics 2024-10-02 Hiroshi Iriyeh , Masataka Shibata

A weaker form of the multiplicity conjecture of Herzog, Huneke, and Srinivasan is proven for two classes of monomial ideals: quadratic monomial ideals and squarefree monomial ideals with sufficiently many variables relative to the Krull…

Commutative Algebra · Mathematics 2007-11-13 Michael Goff

We introduce several new notions of (sectional) curvature bounds for Lorentzian pre-length spaces: On the one hand, we provide convexity/concavity conditions for the (modified) time separation function, and, on the other hand, we study…

Differential Geometry · Mathematics 2026-01-14 Tobias Beran , Michael Kunzinger , Felix Rott

We show that there are CNF formulas which can be refuted in resolution in both small space and small width, but for which any small-width proof must have space exceeding by far the linear worst-case upper bound. This significantly…

Computational Complexity · Computer Science 2016-12-22 Christoph Berkholz , Jakob Nordström
‹ Prev 1 3 4 5 6 7 10 Next ›