Related papers: CD(4) has bounded width
By considering negative surgeries on a knot $K$ in $S^3$, we derive a lower bound to the non-orientable slice genus $\gamma_4(K)$ in terms of the signature $\sigma(K)$ and the concordance invariants $V_i(\overline{K})$, which strengthens a…
We deal with nonlinear systems of parabolic type satisfying component-wise structural conditions. The nonlinear terms are Carath\'eodory maps having controlled growth with respect to the solution and the gradient and the data are in…
A counting constraint satisfaction problem (#CSP) asks for the number of ways to satisfy a given list of constraints, drawn from a fixed constraint language \Gamma. We study how hard it is to evaluate this number approximately. There is an…
In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP) over a constraint language $\Gamma$ is tractable if and only if $\Gamma$ is preserved by a weak near-unanimity (WNU) operation. After many efforts and partial…
We show that the irreducible variety of 4 x 4 x 4 complex valued tensors of border rank at most 4 is the zero set of polynomial equations of degree 5 (the Strassen commutative conditions), of degree 6 (the Landsberg-Manivel polynomials),…
The width $\wid(G,W)$ of the verbal subgroup $v(G,W)$ of a group $G$ defined by a collection of group words $W$ is the smallest number $m$ in $\mathbb N \cup {+\infty}$ such that every element of $v(G,W)$ is can be represented as the…
We investigate the `local consistency implies global consistency' principle of strict width among structures within the scope of the Bodirsky-Pinsker dichotomy conjecture for infinite-domain Constraint Satisfaction Problems (CSPs). Our main…
Let $B\subset A$ be a left or right bounded extension of finite dimensional algebras. We use the Jacobi-Zariski long nearly exact sequence to show that $B$ satisfies Han's conjecture if and only if $A$ does, regardless if the extension…
In this paper we prove, using a refinement of Terracini's Lemma, a sharp lower bound for the degree of (higher) secant varieties to a given projective variety, which extends the well known lower bound for the degree of a variety in terms of…
We use the Israel condition to treat carefully the weak-field perturbations due to the presence of matter on a 3-brane embedded between two regions of anti-de Sitter (AdS) space with different curvature lengths. A four dimensional Newton's…
Approximating nonlinear dynamics with a truncated perturbative expan- sion may be accurate for a while, but it in general breaks down at a long time scale that is one over the small expansion parameter. There are interesting occasions in…
We show that one-dimensional superspace is isomorphic to a non-trivial but consistent limit as $q\to-1$ of the braided line. Supersymmetry is identified as translational invariance along this line. The supertranslation generator and…
The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…
A quantitative version of the scalar lower bound under $C^0$ convergence was conjectured by Gromov. More recently, Mazurowski and Yao proved that a refined form of Gromov's conjecture holds in dimension three. Furthermore, they constructed…
By studying the variety of J\'{o}nsson-Tarski algebras, we demonstrate two obstacles to the existence of large J\'{o}nsson algebras in certain varieties. First, if an algebra $J$ in a language $L$ has cardinality greater than $|L|^+$ and a…
While several classes of integer linear optimization problems are known to be solvable in polynomial time, far fewer tractability results exist for integer nonlinear optimization. In this work, we narrow this gap by identifying a broad…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…
It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy…