Related papers: The Kropholler Conjecture
In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.
There is a gap in the proof of Lemma VII.4 in [Ann. of Math. (2) 145 (1997), 81--137]. We present an alternative proof of Theorem B (C^1 Omega-stable vector fields satisfy Axiom A). The novel and essential part in the proof of the stability…
In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.
This is a summary of the proof of BAB conjecture. All material are taken from the two BAB paper in the reference. The aim of this summary is to help reader to understand the more technical side of the proof of BAB.
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
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 the paper we complete a case by case proof of Reeder's Conjecture started in our previous work, proving the conjecture for simple Lie algebras of type $D$ and for the exceptional cases.
We prove a number of conjectures [arXiv:2005.04066] recently stated by P. Barry, related to the paperfolding sequence and the Rueppel sequence.
In this paper we present a surprisingly general extension of the main result of a paper that appeared in this journal: I. Montes et al., Sklar's theorem in an imprecise setting, Fuzzy Sets and Systems, 278 (2015), 48--66. The main tools we…
We propose several Hodge theoretic analogues of the conjectures of Hopf and Singer, and prove them in some special cases.
In this paper we present a convergence theorem for continued fractions of the form $K_{n=1}^{\infty}a_{n}/1$. By deriving conditions on the $a_{n}$ which ensure that the odd and even parts of $K_{n=1}^{\infty}a_{n}/1$ converge, these same…
In this paper, we present a possible theoretical explanation for benford's law. We develop a recursive relation between the probabilities, using simple intuitive ideas. We first use numerical solutions of this recursion and verify that the…
In Diophantine approximation, Vaaler's theorem was an important partial result towards the Duffin--Schaeffer conjecture, which was open for almost eighty years before it was recently proven by Koukoulopoulos and Maynard. A version of this…
Deficiencies in Kauffman's proposal regarding a new way for building scientific theories are pointed out. A suggestion to overcome them, and in fact, independently construct mathematical theories which are beyond the reach of Goedel's…
G\"odel's first and second incompleteness theorems are corner stones of modern mathematics. In this article we present a new proof of these theorems for ZFC and theories containing ZFC, using Chaitin's incompleteness theorem and a very…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
This paper examines a denumerable version of the nested-set theorem and derives from it a contradiction involving the formal consistency of the actual infinity assumed by the Axiom of Infinity.
We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…
Provides a counterexample to a long standing conjecture of A. Adem regarding the behaviour of the integral cohomology of a p-group.
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).