Related papers: Refuting Feder, Kinne and Rafiey
Nous refutons, sous une certaine hypothese combinatoire, la "nonrevisiting path conjecture". Abstract: In this article, we give, under some hypothesis, a couterexample to the nonrevisiting path conjecture.
In this note we prove the non existence of certain irreducible two dimensional representations of the the absolute Galois group. Such results are predicted by Serre's conjecture and we use Fontaine's methods to verify these predictions in a…
For finite graphs $G$ and $H$, let $\RR(G,H)$ denote the isomorphism classes of Ramsey-minimal graphs for $(G,H)$. We prove two 1981 conjectures of Burr, Erd\H{o}s, Faudree, Rousseau, and Schelp: Ramsey-finiteness is preserved by adjoining…
We point out that an erroneous derivation in the recent paper [Fetecau et al., Nonlinear Anal. RWA 12 (2011) 1] yields a correct solution by accident. Additionally, a number of misrepresentations and inaccuracies in the latter recent paper…
A few families of counterexamples are provided to "A proof that the discrete singular convolution (DSC)/Lagrange-distributed approximation function (LDAF) method is inferior to high order finite differences", Journal of Computational…
In this paper, we reprove a global converse theorem of Cogdell and Piatetski-Shapiro using purely global methods.
Some new identities for Schur functions are proved. In particular, we settle in the affirmative a recent conjecture of Ishikawa-Wakayama and solve a problem raised by Bressoud.
In his 2008 thesis, Tateno claimed a counterexample to the Bonato-Tardif conjecture regarding the number of equimorphy classes of trees. In this paper we revisit Tateno's unpublished ideas to provide a rigorous exposition, constructing…
Constraint Satisfaction Problems (CSPs) form a broad class of combinatorial problems, which can be formulated as homomorphism problems between relational structures. The CSP dichotomy theorem classifies all such problems over finite domains…
An old conjecture of Durfee 1978 bounds the ratio of two basic invariants of complex isolated complete intersection surface singularities: the Milnor number and the singularity (or geometric) genus. We give a counterexample for the case of…
We give some reductions among problems in (nonnegative) weighted #CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our reductions can be applied to both exact and approximate…
We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…
In this paper we disprove three conjectures from [M. Dehmer, F. Emmert-Streib, Y. Shi, Interrelations of graph distance measures based on topological indices, PLoS ONE 9 (2014) e94985] on graph distance measures based on topological indices…
In this note we use a result of Kantor to prove a conjecture of Degos. Specifically we prove the following: let $\mathbb{F}$ be a finite field of order $q$ and let $f, g\in\mathbb{F}[X]$ be distinct polynomials of degree $n$ such that $f$…
In [7], Higashitani, Kummer, and Micha{\l}ek pose a conjecture about the symmetric edge polytopes of complete multipartite graphs and confirm it for a number of families in the bipartite case. We confirm that conjecture for a number of new…
The purpose of this note is to correct an error in a paper of M. Cowling, G. Fendler and J.J.F. Fournier, and to give a counterexample to a conjecture of J.-L. Rubio de Francia.
We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula $F$, 1) It is NP-hard to find a CP refutation of $F$ in time polynomial in the length of the shortest such refutation; and 2)unless Gap-Hitting-Set…
The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs. Signed graphs arise naturally in many…
We prove Faltings Finiteness Theorem using Rieffel's classification of the noncommutative tori.
In this paper we give an example to show Clemens' conjecture is not a first order deformation problem.