English
Related papers

Related papers: Counterexamples to the topological Tverberg conjec…

200 papers

We show that every complete $n$-vertex simple topological graph contains a topological subgraph on at least $(\log n)^{1/4 - o(1)}$ vertices that is weakly isomorphic to the complete convex geometric graph or the complete twisted graph.…

Combinatorics · Mathematics 2022-09-08 Andrew Suk , Ji Zeng

We continue our study of 'no-dimension' analogues of basic theorems in combinatorial and convex geometry in Banach spaces. We generalize some results of the paper \cite{adiprasito2019theorems} and prove no-dimension versions of colorful…

Metric Geometry · Mathematics 2021-01-20 Grigory Ivanov

A multiobjective optimization problem is $C^r$ simplicial if the Pareto set and the Pareto front are $C^r$ diffeomorphic to a simplex and, under the $C^r$ diffeomorphisms, each face of the simplex corresponds to the Pareto set and the…

Optimization and Control · Mathematics 2020-04-17 Naoki Hamada , Shunsuke Ichiki

We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each…

Differential Geometry · Mathematics 2009-12-15 Ricardo Sá Earp , Eric Toubiana

In this paper, we present a minimal counterexample to a conjecture of Perles that answers a question of Haase and Ziegler. The example is a simple 4-polytope that has an induced 3-connected 3-regular subgraph, whose graph complement is…

Combinatorics · Mathematics 2018-09-10 Joseph Doolittle

Given an arbitrary (commutative) field K, let V be a linear subspace of M_n(K) consisting of matrices of rank lesser than or equal to some r<n. A theorem of Atkinson and Lloyd states that, if dim V>nr-r+1 and #K>r, then either all the…

Rings and Algebras · Mathematics 2013-03-05 Clément de Seguins Pazzis

Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…

Algebraic Geometry · Mathematics 2013-01-21 L. Andrew Campbell

A \textit{$k$-transversal} to family of sets in $\mathbb{R}^d$ is a $k$-dimensional affine subspace that intersects each set of the family. In 1957 Hadwiger provided a necessary and sufficient condition for a family of pairwise disjoint,…

Combinatorics · Mathematics 2024-01-19 Daniel McGinnis

We prove that the slice rank of a 3-tensor (a combinatorial notion introduced by Tao in the context of the cap-set problem), the analytic rank (a Fourier-theoretic notion introduced by Gowers and Wolf), and the geometric rank (an…

Combinatorics · Mathematics 2022-10-04 Alex Cohen , Guy Moshkovitz

In this article we prove the topological minimality of unions of several almost orthogonal planes of arbitrary dimensions. A particular case was proved in arXiv:1103.1468, where we proved the Almgren minimality (which is a weaker property…

Classical Analysis and ODEs · Mathematics 2013-12-13 Xiangyu Liang

The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…

Combinatorics · Mathematics 2013-04-30 Francisco Santos

Discrete conformal mappings based on circle packing, vertex scaling, and related structures has had significant activity since Thurston proposed circle packing as a way to approximate conformal maps in the 1980s. The first convergence…

Differential Geometry · Mathematics 2025-08-06 David Glickenstein , Lee Sidbury

In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…

Differential Geometry · Mathematics 2023-11-21 Minghao Li , Ling Yang , Taiyang Zhu

We prove that if an $n$-dimensional space $X$ satisfies certain topological conditions then any triangulation of $X$ as well as any its representation as a simplicial set with contractible faces has at least $2^n$ faces of dimension $n$.…

Algebraic Topology · Mathematics 2024-08-07 Sergey Avvakumov , Roman Karasev

We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…

Algebraic Topology · Mathematics 2024-06-27 Ben Knudsen

We prove some analogues of the central point theorem and Tverberg's theorem, where instead of points, we consider hyperplanes or affine flats of given dimension.

Combinatorics · Mathematics 2011-07-06 R. N. Karasev

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

Combinatorics · Mathematics 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

We develop a topological framework in an attempt to generalize the classical colourful Caratheodory theorem by imposing an additional constraint. For that we introduce the notion of zero-avoding complexes and covering criteria for the…

Algebraic Topology · Mathematics 2025-12-30 Pavle V. M. Blagojevic

Suppose that $n\neq p^k$ and $n\neq 2p^k$ for all $k$ and all primes $p$. We prove that for any Hausdorff compactum $X$ with a free action of the symmetric group $\mathfrak S_n$ there exists an $\mathfrak S_n$-equivariant map $X \to…

Geometric Topology · Mathematics 2021-05-10 Sergey Avvakumov , Sergey Kudrya

$\newcommand{\floor}[1]{\left\lfloor {#1} \right\rfloor} \renewcommand{\Re}{\mathbb{R}}$ Tverberg's theorem states that a set of $n$ points in $\Re^d$ can be partitioned into $\floor{n/(d+1)}$ sets with a common intersection. A point in…

Computational Geometry · Computer Science 2023-05-03 Sariel Har-Peled , Timothy Zhou