相关论文: A user's guide to the topological Tverberg conject…
The type A colored Tverberg theorem of Blagojevi\'{c}, Matschke, and Ziegler provides optimal bounds for the colored Tverberg problem, under the condition that the number of intersecting rainbow simplices is a prime number. We extend this…
The Tijdeman-Zagier conjecture states no integer solution exists for $A^X+B^Y=C^Z$ with positive integer bases and integer exponents greater than 2 unless gcd$(A,B,C)>1$. Any set of values that satisfy the conjecture correspond to a lattice…
This paper investigates a Tate algebra version of the Jacobian conjecture, referred to as the Tate-Jacobian conjecture, for commutative rings $R$ equipped with an $I$-adic topology. We show that if the $I$-adic topology on $R$ is Hausdorff…
We prove (and improve) the Muir-Suffridge conjecture for holomorphic convex maps. Namely, let $F:\mathbb B^n\to \mathbb C^n$ be a univalent map from the unit ball whose image $D$ is convex. Let $\mathcal S\subset \partial \mathbb B^n$ be…
Thomassen [Problem 1 in Factorizing regular graphs, J. Combin. Theory Ser. B, 141 (2020), 343-351] asked whether every $r$-edge-connected $r$-regular graph of even order has $r-2$ pairwise disjoint perfect matchings. We show that this is…
I describe the history of Topological Tverberg Theorem. I present some important constructions and discuss their properties. In particular, I describe in details the cell structure of the classifying space $K\left( S_{r},1\right),$ where…
Given $d+1$ sets of points, or colours, $S_1,\ldots,S_{d+1}$ in $\mathbb R^d$, a colourful simplex is a set $T\subseteq\bigcup_{i=1}^{d+1}S_i$ such that $|T\cap S_i|\leq 1$, for all $i\in\{1,\ldots,d+1\}$. The colourful Carath\'eodory…
Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…
In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…
We prove a conjecture of Toponogov on complete convex planes, namely that such planes must contain an umbilic point, albeit at infinity. Our proof is indirect. It uses Fredholm regularity of an associated Riemann-Hilbert boundary value…
The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative…
Let P be a d-dimensional n-point set. A Tverberg-partition of P is a partition of P into r sets P_1, ..., P_r such that the convex hulls conv(P_1), ..., conv(P_r) have non-empty intersection. A point in the intersection of the conv(P_i)'s…
We prove that every $n$-vertex complete simple topological graph generates at least $\Omega(n)$ pairwise disjoint $4$-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every $n$-vertex complete simple…
We prove the Tree Alternative Conjecture for the topological minor relation: letting $[T]$ denote the equivalence class of $T$ under the topological minor relation we show that: $|[T]| = 1$ or $|[T]|\geq \aleph_0$ and $\forall r\in V(T)$,…
Tverberg's theorem states that for any $k \ge 2$ and any set $P \subset \mathbb{R}^d$ of at least $(d + 1)(k - 1) + 1$ points in $d$ dimensions, we can partition $P$ into $k$ subsets whose convex hulls have a non-empty intersection. The…
A topological space is introduced in this paper. Just liking the plane, it's continuous, however its $n+1$ regions couldn't be mutually adjacent. Some important phenomenon about its cross-section are discussed. The geometric generating…
Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…
A famous conjecture of Ryser is that in an $r$-partite hypergraph the covering number is at most $r-1$ times the matching number. If true, this is known to be sharp for $r$ for which there exists a projective plane of order $r-1$. We show…
The colorful Helly theorem and Tverberg's theorem are fundamental results in discrete geometry. We prove a theorem which interpolates between the two. In particular, we show the following for any integers $d \geq m \geq 1$ and $k$ a prime…
We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K,…