Related papers: On the strong separation conjecture
We define the infinite dimensional simplex to be the closure of the convex hull of the standard basis vectors in R^infinity, and prove that this space has the 'fixed point property': any continuous function from the space into itself has a…
Let $\sigma(n)$ be the sum of the divisors of $n$. Kalita and Saikia defined a number $n$ to be near superperfect if $2n+d=\sigma(\sigma(n))$ for some positive divisor $d$ of $n$. We extend some of their results about near superperfect…
Menger conjectured that subsets of $\mathbb R$ with the Menger property must be $\sigma$-compact. While this is false when there is no restriction on the subsets of $\mathbb R$, for projective subsets it is known to follow from the Axiom of…
Let $\mathscr{C}_\mathbb{Z}([0,1])$ be the metric space of real-valued continuous functions on $[0,1]$ with integer values at $0$ and $1$, equipped with the uniform (supremum) metric $d_\infty$. It is a classical theorem in approximation…
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed set given by negative information. One of our main results…
In 1951 paper \cite{Ki} Kippenhahn conjectured that if the characteristic polynomial \ $P_A(x_1,x_2,x_3)=\mbox{det}(x_1A_1+x_2A_2-x_3I)$, \ where $A_1$ and $A_2$ are $n\times n$ Hermitian matrices, has a repeated factor in the polynomial…
Goldston and Montgomery [3] proved that the Strong Pair Correlation Conjecture and two second moments of primes in short intervals are equivalent to each other under Riemann Hypothesis. In this paper, we get the second main terms for each…
Consider long-range Bernoulli percolation on $\mathbb{Z}^d$ in which we connect each pair of distinct points $x$ and $y$ by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…
The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…
In 2016 Ananyan and Hochster proved Stillman's conjecture by showing the existence of a uniform upper bound on the length of an $R_\eta$-sequence containing fixed $n$ forms of degree at most $d$ in polynomial rings over a field. This result…
The purpose of this paper is to prove that certain limits of polynomial rings are themselves polynomial rings, and show how this observation can be used to deduce some interesting results in commutative algebra. In particular, we give two…
We state and prove in modern terms a Splitting Principle first claimed by Beniamino Segre in 1938, which should be regarded as a strong form of the classical Principle of Connectedness.
We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in \{0,1\}^n$ to a CNF formula $\varphi$ is shared between two parties, where Alice knows $x_1, \dots, x_{n/2}$, Bob knows…
We present a new, very short proof of a conjecture by I. Ra\c{s}a, which is an inequality involving basic Bernstein polynomials and convex functions. It was affirmed positively very recently by J. Mrowiec, T. Rajba and S. W\k{a}sowicz…
The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…
The Peterson-Thom conjecture asserts that any diffuse, amenable subalgebra of a free group factor is contained in a unique maximal amenable subalgebra. This conjecture is motivated by related results in Popa's deformation/rigidity theory…
Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…
A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…
A remarkable theorem of Besicovitch is that an integrable function $f$ on $\mathbb{R}^2$ is strongly differentiable if and only if its associated strong maximal function $M_S f$ is finite a.e. We provide an analogue of Besicovitch's result…
Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and…