Related papers: Refuting Feder, Kinne and Rafiey
We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs on a finite domain, and therefore a new…
We give a short proof of a slightly weaker version of the multilinear Kakeya inequality proven by Bennett, Carbery, and Tao.
For a $k$-ary predicate $P$, a random instance of CSP$(P)$ with $n$ variables and $m$ constraints is unsatisfiable with high probability when $m \gg n$. The natural algorithmic task in this regime is \emph{refutation}: finding a proof that…
The said paper [Su2] entitled "Proof Of Two Dimensional Jacobian Conjecture" is false.
Asaf Karagila pointed out that Remark 3.4 [1], directly contradicts Theorem 3.3 (c) [2] which was incorrectly stated. This note contains a proof of this remark. [1] Miller, Arnold W.; A Dedekind Finite Borel Set, Arch. Math. Logic 50…
Boucksom, Favre and Jonsson establish in [4] an analog of Diskant's inequality in convex geometry for nef and big line bundles on a complete algebraic variety over an algebraically closed field of characteristic zero (Theorem F [4]), from…
We present an algorithm for strongly refuting smoothed instances of all Boolean CSPs. The smoothed model is a hybrid between worst and average-case input models, where the input is an arbitrary instance of the CSP with only the negation…
Conservative constraint satisfaction problems (CSPs) constitute an important particular case of the general CSP, in which the allowed values of each variable can be restricted in an arbitrary way. Problems of this type are well studied for…
Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of instances defined by excluding subproblems. This approach…
We present a Rainbow Ramsey version of the well-known Ramsey-type theorem of Richard Rado. We use techniques from the Geometry of Numbers. We also disprove two conjectures proposed in the literature.
In [1, arXiv:1102.1844] the author disputes the conclusion of our paper [2, arXiv:1006.0714]. He claims that the Feynman graphs of three dimensional group field theory always represent pseudo manifolds. However, [1] uses a different…
We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…
This paper proves the existence of a dichotomy which being formally derived from the topological successiveness of w-order leads to the same absurdity of Zeno's Dichotomy II. It also derives a contradictory result from the first Zeno's…
We give a counterexample to a recently conjectured variant of the Penrose inequality.
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…
The logic MMSNP is a restricted fragment of existential second-order logic which allows to express many interesting queries in graph theory and finite model theory. The logic was introduced by Feder and Vardi who showed that every MMSNP…
In recent years, we have seen several approaches to the graph isomorphism problem based on "generic" mathematical programming or algebraic (Gr\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has…
A new classification theorem for links by the authors and Roger Fenn leads to computable link invariants. As an illustration we distinguish the left and right trefoils and recover the result of Carter et al that the 2-twist-spun trefoil is…
Gives a short proof of Dehornoy's latest result. The same simple argument (and more) was discovered by Laver's student Larue.
Feder and Vardi showed that the class Monotone Monadic SNP without inequality (MMSNP) has a P vs NP-complete dichotomy if and only if such a dichotomy holds for finite-domain Constraint Satisfaction Problems (CSPs). Moreover, they showed…