Related papers: Refuting Feder, Kinne and Rafiey

We study the complexity of local search for the Boolean constraint satisfaction problem (CSP), in the following form: given a CSP instance, that is, a collection of constraints, and a solution to it, the question is whether there is a…

We provide a numerical refutation of the developments of Fiorini et al. (2015)* for models with disjoint sets of descriptive variables. We also provide an insight into the meaning of the existence of a one-to-one linear map between…

We give a short proof of an inequality, conjectured by Tsfasman and proved by Serre, for the maximum number of points on hypersurfaces over finite fields. Further, we consider a conjectural extension, due to Tsfasman and Boguslavsky, of…

Finite valued constraint satisfaction problems are a formalism for describing many natural optimization problems, where constraints on the values that variables can take come with rational weights and the aim is to find an assignment of…

We prove that the intersection of a Hirsch polytope and a cube may be a non-Hirsch polytope.

A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…

We give an alternative proof of a (former) conjecture of Bj\"orner stating that the matrix expressing face numbers in terms of g numbers is totally non-negative. We briefly discuss the case of simple flag polytopes.

From some works of P. Furtw\"angler and H.S. Vandiver, we put the basis of a new cyclotomic approach to Fermat's last theorem for p>3 and to a stronger version called SFLT, by introducing governing fields of the form Q(exp(2 i pi/q-1)) for…

We present a proof of the Chevalley-Weil Theorem that is somewhat different from the proofs appearing in the literature and with somewhat weaker hypotheses, of purely topological type. We also provide a discussion of the assumptions, and an…

We propose a new conjecture on hardness of low-degree $2$-CSP's, and show that new hardness of approximation results for Densest $k$-Subgraph and several other problems, including a graph partitioning problem, and a variation of the Graph…

We prove results that falsify Silver's dichotomy for Borel equivalence relations on the generalised Baire space under the assumption V=L.

We describe a program to construct a counterexample to the Deift conjecture, that is, an almost periodic function whose evolution under the KdV equation is not almost periodic in time. The approach is based on a dichotomy found by Volberg…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

We show that an earlier conjecture of the author, on diophantine approximation of rational points on varieties, implies the ``abc conjecture'' of Masser and Oesterl'e. In fact, a weak form of the former conjecture is sufficient, involving…

The argument of Bunkov, L`vov and Volovik contains errors, making the obtained result non-convincing.

The Shapiro conjecture in the real Schubert calculus, while likely true for Grassmannians, fails to hold for flag manifolds, but in a very interesting way. We give a refinement of the Shapiro conjecture for the flag manifold and present…

The constraint satisfaction problem asks to decide if a set of constraints over a relational structure $\mathcal{A}$ is satisfiable (CSP$(\mathcal{A})$). We consider CSP$(\mathcal{A} \cup \mathcal{B})$ where $\mathcal{A}$ is a structure and…

Constraint satisfaction problems (or CSPs) have been extensively studied in, for instance, artificial intelligence, database theory, graph theory, and statistical physics. From a practical viewpoint, it is beneficial to approximately solve…

We prove that the Jacobian conjecture is false if and only if there exists a solution to a certain system of polynomial equations. We analyse the solution set of this system. In particular we prove that it is zero dimensional.

We prove the following dichotomy: if $n=2,3$ and $f\in C^1(\mathbb{S}^{n+1},\mathbb{S}^n)$ is not homotopic to a constant map, then there is an open set $\Omega\subset\mathbb{S}^{n+1}$ such that $\mathrm{rank}\, df=n$ on $\Omega$ and…