Related papers: The bunkbed conjecture is false

Let $X \subset \mathbb{P}^{n}$ be an unramified real curve with $X(\mathbb{R}) \neq \emptyset$. If $n \geq 3$ is odd, Huisman conjectures that $X$ is an $M$-curve and that every branch of $X(\mathbb{R})$ is a pseudo-line. If $n \geq 4$ is…

We prove `twisted' versions of Kirchhoff's network theorem and Kirchhoff's matrix-tree theorem on connected finite graphs. Twisting here refers to chains with coefficients in a flat unitary line bundle.

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.

We give a minimal counterexample for a conjecture of Ross and Yong (2015) which proposes a K-Kohnert rule for Grothendieck polynomials. We conjecture a revised version of this rule. We then prove both rules hold in the $321$-avoiding case.

J.-P. Roudneff conjectured in 1991 that every arrangement of $n \ge 2d+1\ge 5$ pseudohyperplanes in the real projective space $\mathbb{P}^d$ has at most $\sum_{i=0}^{d-2} \binom{n-1}{i}$ complete cells (i.e., cells bounded by each…

A 1972 duality conjecture due to Pietsch asserts that the entropy numbers of a compact operator acting between two Banach spaces and those of its adjoint are (in an appropriate sense) equivalent. This is equivalent to a dimension free…

We give a new proof of Zariski's multiplicity conjecture in the case of isolated hypersurface singularities; this was first proved by de Bobadilla-Pe\l ka \cite{BobadillaPelka}. Our proof uses the TQFT structure of fixed-point Floer…

In earlier work, we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an oracle separating the decision versions would follow from what we called the Generalized Linial-Nisan (GLN)…

A full understanding of the behavior of a large language model (LLM) requires our grasp of its input token space. If this space differs from our assumptions, our comprehension of and conclusions about the LLM will likely be flawed. We…

We verify conjecture 5.11 of Panyushev [\emph{Antichains in weight posets associated with gradings of simple Lie algebras}, Math Z 281(3):1191--1214, 2015].

Manin's conjecture predicts an asymptotic formula for the number of rational points of bounded height on a smooth projective variety in terms of its global geometric invariants. The strongest form of the conjecture implies certain…

In this paper we present a complete proof of a conjecture due to V. V. Prelov in 2010 about an information inequality for the binary entropy function.

For a graph $G$, and a nonnegative integer $g$, let $a_g(G)$ be the number of $2$-cell embeddings of $G$ in an orientable surface of genus $g$ (counted up to the combinatorial homeomorphism equivalence). In 1989, Gross, Robbins, and Tucker…

We give a short proof that Strassen's asymptotic rank conjecture implies that for every $\varepsilon > 0$ there exists a $(3/2^{2/3} + \varepsilon)^n$-time algorithm for set cover on a universe of size $n$ with sets of bounded size. This…

In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…

This paper has been withdrawn by the author due to an error in Lemma 3, making the (bijective) proof of Theorem 4 and Corollary 5 invalid (symmetry of k-nonnesting and k-noncrossing set partitions).

For a compact set $A$ in $\mathbb{R}^n$ the Hausdorff distance from $A$ to $\text{conv}(A)$ is defined by \begin{equation*} d(A):=\sup_{a\in\text{conv}(A)}\inf_{x\in A}|x-a|, \end{equation*} where for $x=(x_1,\dots,x_n)\in\mathbb{R}^n$ we…

In this article, we give a counterexample to the Lefschetz hyperplane theorem for non-singular quasi-projective varieties. A classical result of Hamm-L\^{e} shows that Lefschetz hyperplane theorem can hold for hyperplanes in general…

Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…