English
Related papers

Related papers: A two-page disproof of the Borsuk partition conjec…

200 papers

We relate the n! conjecture (by Garsia and Haiman) to the geometry of principal nilpotent pairs, and state a conjecture generalizing the n! conjecture to arbitrary semisimple algebraic groups. We also show, using Borel's fixed point…

Algebraic Geometry · Mathematics 2007-05-23 Shrawan Kumar , Jesper Funch Thomsen

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

Combinatorics · Mathematics 2025-05-15 Dandan Chen , Rong Chen , Mengjie Zhao

We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…

Combinatorics · Mathematics 2020-12-16 Ben Lund , Giorgis Petridis

In this paper, we prove a conjecture proposed by George Beck, which involves gap-free partitions and partitions with distinct parts.

Number Theory · Mathematics 2018-05-23 Shane Chern

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

Combinatorics · Mathematics 2021-07-19 Aritro Pathak

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

Computational Geometry · Computer Science 2021-10-08 Piotr Indyk , Tal Wagner

We observe that the classical Borsuk-Ulam theorem has an easy generalization to maps from an n-manifold M^n to R^n. We point out a geometric corollary.

Algebraic Topology · Mathematics 2007-05-23 Danny Calegari

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…

Combinatorics · Mathematics 2023-10-24 Juan B. Gil , Jordan O. Tirrell

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

Combinatorics · Mathematics 2020-05-19 Xinhua Xiong , William J. Keith

Borsuk-Ulam's theorem is a useful tool of algebraic topology. It states that for any continuous mapping $f$ from the $n$-sphere to the $n$-dimensional Euclidean space, there exists a pair of antipodal points such that $f(x)=f(-x)$. As for…

Optimization and Control · Mathematics 2023-08-29 Hidefumi Kawasaki

The Rado-Horn theorem provides necessary and sufficient conditions for when a collection of vectors can be partitioned into a fixed number of linearly independent sets. Such partitions exist if and only if every subset of the vectors…

Functional Analysis · Mathematics 2011-12-02 Peter G. Casazza , Jesse Peterson

It is proved that the suspension of a closed n-dimensional manifold M, $n\ge1$, does not embed in a product of n+1 curves. In fact, the ultimate result will be proved in a much more general setting. This is a far-reaching generalization the…

Geometric Topology · Mathematics 2009-06-26 J. Krasinkiewicz , S. Spiez

The Borsuk conjecture and the V\'azsonyi problem are two attractive and famous questions in discrete and combinatorial geometry, both based on the notion of diameter of a bounded sets. In this paper, we present an equivalence between the…

Combinatorics · Mathematics 2025-07-24 Gyivan Lopez-Campos , Deborah Oliveros , Jorge L. Ramírez Alfonsín

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

A theorem of Erdos asserts that every infinite subset of Euclidean n-space R^n has a subset of the same cardinality having no repeated distances. This theorem is generalized here as follows: If (R^n,E) is an algebraic hypergraph that does…

Logic · Mathematics 2017-12-01 James H. Schmerl

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

Optimization and Control · Mathematics 2023-10-10 Ali Taherinassaj , Yiling Chen

Any function from a round $n$-dimensional sphere of radius $r$ into $n$-dimensional Euclidean space must distort the metric additively by at least $\displaystyle \frac{\pi r}{1 + \sqrt{1 - \frac{2}{n+2}}}$ if $n$ is even and $\displaystyle…

Metric Geometry · Mathematics 2026-05-01 James Dibble

Prompted by a recent question of G. Hjorth as to whether a bounded Urysohn space is indivisible, that is to say has the property that any partition into finitely many pieces has one piece which contains an isometric copy of the space, we…

Combinatorics · Mathematics 2007-05-23 Christian Delhomme , Claude Laflamme , Maurice Pouzet , Norbert Sauer

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin
‹ Prev 1 3 4 5 6 7 10 Next ›