相关论文: CD(4) has bounded width

In this article we prove that the Weinstein conjecture holds for contact manifolds $(\Sigma,\xi)$ for which $\mathrm{Cont}_0(\Sigma,\xi)$ is non-orderable in the sense of Eliashberg-Polterovich [EP00]. More precisely, we establish a link…

We generalise the main theorems from the paper "The Borel cardinality of Lascar strong types" by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between…

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

In this paper we classify the laws of three-dimensional and four-dimensional nilpotent Jordan algebras over the field of complex numbers. We describe the irreducible components of their algebraic varieties and extend contractions and…

In [Directed tree-width, J. Combin. Theory Ser. B 82 (2001), 138-154] we introduced the notion of tree-width of directed graphs and presented a conjecture, formulated during discussions with Noga Alon and Bruce Reed, stating that a digraph…

We perform a fundamental investigation of the complexity of conjunctive query evaluation from the perspective of parameterized complexity. We classify sets of boolean conjunctive queries according to the complexity of this problem. Previous…

We prove that an infinite (bounded) involution lattice and even pseudo--Kleene algebra can have any number of congruences between $2$ and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals…

Affine-invariant codes are codes whose coordinates form a vector space over a finite field and which are invariant under affine transformations of the coordinate space. They form a natural, well-studied class of codes; they include popular…

The tractability conjecture for finite domain Constraint Satisfaction Problems (CSPs) stated that such CSPs are solvable in polynomial time whenever there is no natural reduction, in some precise technical sense, from the 3-SAT problem;…

For a fixed finite solvable group $G$ and number field $K$, we prove an upper bound for the number of $G$-extensions $L/K$ with restricted local behavior (at infinitely many places) and ${\rm inv}(L/K)<X$ for a general invariant $"{\rm…

We show an invariance result for the L2-torsion of groups under uniform measure equivalence provided a measure-theoretic version of the determinant conjecture holds. The measure-theoretic determinant conjecture is discussed and, for…

Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…

Sufficient conditions for the invariance of evolution problems governed by perturbations of (possibly nonlinear) $m$-accretive operators are provided. The conditions for the invariance with respect to sublevel sets of a constraint…

In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…

Counting the number of answers to conjunctive queries is a fundamental problem in databases that, under standard assumptions, does not have an efficient solution. The issue is inherently #P-hard, extending even to classes of acyclic…

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

Constraint Satisfaction Problem (CSP) is a framework for modeling and solving a variety of real-world problems. Once the problem is expressed as a finite set of constraints, the goal is to find the variables' values satisfying them. Even…

We prove that the subvariety of $SL(2)\times SL(2)$ given by the matrix equation $w(X,Y)=\alpha$, where $w$ is a word in two letters, is closely related to an explicit smooth conic bundle over the associated `trace surface' in the…

Incorporating constraints is a major concern in probabilistic machine learning. A wide variety of problems require predictions to be integrated with reasoning about constraints, from modelling routes on maps to approving loan predictions.…