Related papers: Refuting Feder, Kinne and Rafiey
We show that Hofman's claim of a "counter-example" to Diaby's LP formulation of the TSP is invalid.
The Promise Constraint Satisfaction Problem (PCSP) is a generalization of the Constraint Satisfaction Problem (CSP) that includes approximation variants of satisfiability and graph coloring problems. Barto [LICS '19] has shown that a…
withdrawed due to a substantial error.
Robin's Conjecture is strengthened, deformed, and proved. Nicolas conjecture follows.
We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1)…
Promise Constraint Satisfaction Problems (PCSPs) are a generalization of Constraint Satisfaction Problems (CSPs) where each predicate has a strong and a weak form and given a CSP instance, the objective is to distinguish if the strong form…
In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the form #CSP($\mathcal{C}$,-), in which the goal is, given a relational structure $\mathbf{A}$ from a class $\mathcal{C}$ of structures and an…
The main result of this paper, Simon's conjecture for fibered knots, was previously proven by Silver and Whitten math.GT/0405462 with essentially the same proof. This paper is therefore being withdrawn. The author would like to apologize…
In astro-ph/0702542v2, Linder and Miquel seek to criticize the use of Bayesian model selection for data analysis and for survey forecasting and design. Their discussion is based on three serious misunderstandings of the conceptual…
Under a weakened version of Hardy-Littlewood Conjecture on the number of representations in Goldbach problem, J. H. Fei proved bounds for the Siegel zeros. Recently G. Bhowmik and K. Halupczok generalized Fei's result under a weaker…
Building on recent work of Mattheus and Verstra\"ete, we establish a general connection between Ramsey numbers of the form $r(F,t)$ for $F$ a fixed graph and a variant of the Zarankiewicz problem asking for the maximum number of 1s in an…
A proposed solution to the Riemann Hypothesis
We give a simple proof of a recent inequality by W.M. Schmidt and L. Summerer concerning Diophantine exponents for a linear form in three real variables.
We show that the equation in the title (with $\Phi_m$ the $m$th cyclotomic polynomial) has no integer solution with $n\ge 1$ in the cases $(m,p)=(15,41), (15,5581),(10,271)$. These equations arise in a recent group theoretical investigation…
This paper has been withdrawn by the authors due to crucial error in the main proof (located in Section 2.4). The authors apologize for any inconveniences.
Homotopy Lie groups, recently invented by W.G. Dwyer and C.W. Wilkerson, represent the culmination of a long evolution. The basic philosophy behind the process was formulated almost 25 years ago by Rector in his vision of a homotopy…
We construct a finitely generated group that does not satisfy the generalized Burghelea conjecture.
The purpose of this article is to survey the developments on the Kakeya problem in recent years, concentrating on the period after the excellent 1999 survey of Wolff, and including some recent work by the authors. We will focus on the…
The following is a concise exposition of the conjecture and three of its proofs for the case of positive entropy by D. Rudolph [22] , B. Host [14] and W. Parry [21]. A simpler theorem of R. Lyons [19] - preceding them - is also presented…
Parvan [arXiv:0911.0383v1] [1] has recently presented some calculations in order to demonstrate the incorrectness of the results obtained from the generalized multinomial coefficients (GMC) presented in Ref. [2]. According to Parvan, the…