Related papers: The bunkbed conjecture is false

We provide various counter-examples to the long-standing so-called "Omnibus Conjecture" in Rational Homotopy Theory. That is, we show that a space with finite dimensional even-degree rational cohomology and finite dimensional spherical…

We give a counter example to a conjecture of E. Bueler stating the equality between the DeRham cohomology of complete Riemannian manifold and a weighted $L^2$ cohomology where the weight is the heat kernel.

We present a counterexample to Conjecture~14.1.6 from [Vladimir Kanovei, Borel equivalence relations], regarding Borel equivalence relations on product spaces.

This paper has been removed by the author due to a misstatement in Theorem 1 and a gap in its proof. A corrected and largely extended successor (a joint work with Thomas Bauer and Tomasz Szemberg) can be found under math.AG/0312211,

Kippenhahn discovered a real algebraic plane curve whose convex hull is the numerical range of a matrix. The correctness of this theorem was called into question when Chien and Nakazato found an example where the spatial analogue fails.…

We found a counterexample to the conjecture of Karvatskyi and Pratsiovytyi concerning the topological type of the achievement set of an intermediate series (Proceedings of the International Geometry Center, 2023.…

In the paper it is demonstrated that Bells theorem is an unprovable theorem.

The complex conjecture of Stefan Banach states that if V is a Banach space over the complex numbers where for some n, 1<n<dim(V), all of its n-dimensional subspaces are isometric, then V is a Hilbert space. Mikhail Gromov proved it for n…

Let $\lambda_\mathbb{K}(m)$ denote the maximal absolute projection constant over the subspaces of dimension $m$. Apart from the trivial case for $ m=1$, the only known value of $\lambda_\mathbb{K}(m)$ is for $ m=2$ and…

Menger's well-known theorem from 1927 characterizes when it is possible to find $k$ vertex-disjoint paths between two sets of vertices in a graph $G$. Recently, Georgakopoulos and Papasoglu and, independently, Albrechtsen, Huynh, Jacobs,…

For $n \geq 2$ we construct a measurable subset of the unit ball in $\mathbb{R}^n$ that does not contain pairs of points at distance 1 and whose volume is greater than $(1/2)^n$ times the volume of the ball. This disproves a conjecture of…

Given a graph $G$, its independence sequence is the integral sequence $a_1,a_2,...,a_n$, where $a_i$ is the number of independent sets of vertices of size i. In the late 80's Alavi, Erdos, Malde, Schwenk showed that this sequence need not…

For an arbitrary integer N that is at least 2, this paper gives a construction of a strictly stationary, N-tuplewise independent sequence of (non-degenerate) bounded random variables such that the Central Limit Theorem fails to hold. The…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

The Reconstruction Conjecture of Ulam asserts that, for $n\geq 3$, every $n$-vertex graph is determined by the multiset of its induced subgraphs with $n-1$ vertices. The conjecture is known to hold for various special classes of graphs but…

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

Twenty years ago Bondy and Vince conjectured that for any nonnegative integer $k$, except finitely many counterexamples, every graph with $k$ vertices of degree less than three contains two cycles whose lengths differ by one or two. The…

Remarkable progress has been made in recent years to establish log-Sobolev type inequalities under the assumption of discrete Ricci curvature bounds. More specfically, Salez and Youssef have proven that the log-Sobolev constant can be lower…

We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…

In this very short note, we give a counterexample to a recent conjecture of Gilmer which would have implied the union-closed conjecture.