English
Related papers

Related papers: CD(4) has bounded width

200 papers

We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive cycles. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating conditions are…

Computational Complexity · Computer Science 2013-03-04 Florent Madelaine , Barnaby Martin

We extend the validity of Kiss's characterization of the commutator from congruence modular varieties to varieties with a difference term. This fixes a recently discovered gap in our paper [A finite basis theorem for difference-term…

Rings and Algebras · Mathematics 2022-02-16 Keith A. Kearnes , Ágnes Szendrei , Ross Willard

The separability problem for word languages of a class $\mathcal{C}$ by languages of a class $\mathcal{S}$ asks, for two given languages $I$ and $E$ from $\mathcal{C}$, whether there exists a language $S$ from $\mathcal{S}$ that includes…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Wojciech Czerwiński , Wim Martens , Lorijn van Rooijen , Marc Zeitoun , Georg Zetzsche

A plank is the part of space between two parallel planes. The following open problem, posed 45 years ago, can be viwed as the converse of Tarski's plank problem (Bang's theorem): Is it true that if the total width of a collection of planks…

Combinatorics · Mathematics 2025-11-26 Andrey Kupavskii , Janos Pach

We extend the notion of a strong backdoor from the CSP setting to the Valued CSP setting (VCSP, for short). This provides a means for augmenting a class of tractable VCSP instances to instances that are outside the class but of small…

Data Structures and Algorithms · Computer Science 2016-12-20 Robert Ganian , M. S. Ramanujan , Stefan Szeider

We derive upper bounds on the fluctuations of a class of random surfaces of the $\nabla \phi$-type with convex interaction potentials. The Brascamp-Lieb concentration inequality provides an upper bound on these fluctuations for uniformly…

Probability · Mathematics 2024-01-23 Paul Dario

We propose a set of 4 recurrence relations whose linear combination gives the number of group invariants, equivalently the dimension of the invariant subspace, in the tensor product of an arbitrary number of adjoint representations of the…

Representation Theory · Mathematics 2020-01-30 Prarit Agarwal , June Nahmgoong

In recent years, there has been increasing interest in explanation methods for neural model predictions that offer precise formal guarantees. These include abductive (respectively, contrastive) methods, which aim to compute minimal subsets…

Machine Learning · Computer Science 2023-05-03 Ouns El Harzli , Bernardo Cuenca Grau , Ian Horrocks

We establish a correspondence between the disk invariants of the complex projective line $\bP^1$ with boundary condition specified by an $S^1$-invariant Lagrangian sub-manifold $L$ and the genus-zero closed Gromov-Witten invariants of a…

Algebraic Geometry · Mathematics 2025-05-19 Zhengyu Zong

Castelnuovo-Mumford regularity is an important invariant of projective algebraic varieties. A well known conjecture due to Eisenbud and Goto gives a bound for regularity in terms of the codimension and degree. This conjecture is known to be…

Algebraic Geometry · Mathematics 2007-05-23 Sijong Kwak

Improved upper and lower bounds on the number of square-free ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised…

Combinatorics · Mathematics 2007-05-23 Uwe Grimm

About 20 years ago, J-P.~Serre announced a bound on the trace of elements of compact Lie groups under the adjoint representation together with related results, provided indications of his proofs, and invited a better proof. This note…

Representation Theory · Mathematics 2025-09-04 Skip Garibaldi , Robert M. Guralnick , Eric M. Rains

The constraint satisfaction probem (CSP) is a well-acknowledged framework in which many combinatorial search problems can be naturally formulated. The CSP may be viewed as the problem of deciding the truth of a logical sentence consisting…

Logic in Computer Science · Computer Science 2007-05-23 Hubie Chen

In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…

Combinatorics · Mathematics 2020-02-24 Laurent Lyaudet

We examine 4-dimensional string backgrounds compactified over a two torus. There exist two alternative effective Lagrangians containing each two $SL(2)/U(1)$ sigma-models. Two of these sigma-models are the complex and the K\"ahler…

High Energy Physics - Theory · Physics 2010-11-19 Alexandros A. Kehagias

In a non-uniform Constraint Satisfaction problem CSP(G), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the…

Computational Complexity · Computer Science 2020-07-20 Andrei A. Bulatov

We consider the incompressible Euler equations in a bounded domain in three space dimensions. Recently, the first two authors proved Onsager's conjecture for bounded domains, i.e., that the energy of a solution to these equations is…

Analysis of PDEs · Mathematics 2019-07-24 Claude Bardos , Edriss Titi , Emil Wiedemann

We study approximations of compact linear multivariate operators defined over Hilbert spaces. We provide necessary and sufficient conditions on various notions of tractability. These conditions are mainly given in terms of sums of certain…

Numerical Analysis · Mathematics 2018-07-10 Peter Kritzer , Henryk Wozniakowski

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

The boundary conditions of the bosonic string theory in non-zero $B$-field background are equivalent to the second class constraints of a discretized version of the theory. By projecting the original canonical coordinates onto the…

High Energy Physics - Theory · Physics 2015-06-25 M. A. De Andrade , M. A. Santos , I. V. Vancea
‹ Prev 1 4 5 6 7 8 10 Next ›