English
Related papers

Related papers: Pairwise disjoint Moebius bands in space

200 papers

By means of constructing a new edge-bending algorithm, we prove that every locally polyhedral tiling of $\mathbb{R}^3$ can be completely softened. A weaker form of this statement, for polyhedral space tilings, was conjectured by Domokos,…

Metric Geometry · Mathematics 2026-04-21 Gergely Ambrus , Dorottya Dancsó

Feder and Subi conjectured that for any $2$-coloring of the edges of the $n$-dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at most once. We discuss the case of random colorings, and we…

Combinatorics · Mathematics 2015-04-24 Daniel Soltész

Gromov's band-width conjecture gives a precise upper bound for the width of a compact Riemannian band with positive scalar curvature lower bound, assuming that the cross-section of the band admits no positive scalar curvature metrics.…

Differential Geometry · Mathematics 2026-02-09 Peter Hochs , Jinmin Wang

This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…

Differential Geometry · Mathematics 2012-11-21 Tobias H. Colding , William P. Minicozzi

We prove a variant of the Sylvester-Gallai theorem for cubics (algebraic curves of degree three): If a finite set of sufficiently many points in $\mathbb{R}^2$ is not contained in a cubic, then there is a cubic that contains exactly nine of…

Combinatorics · Mathematics 2022-01-04 Alex Cohen , Frank de Zeeuw

We exhibit a distinctly low-dimensional dynamical obstruction to the existence of Liouville cobordisms: for any contact 3-manifold admitting an exact symplectic cobordism to the tight 3-sphere, every nondegenerate contact form admits an…

Symplectic Geometry · Mathematics 2019-05-30 Alexandru Cioba , Chris Wendl

Let $\mathfrak{L}_1$, $\mathfrak{L}_2$, $\mathfrak{L}_3$ be finite collections of $L_1$, $L_2$, $L_3$, respectively, lines in $\mathbb{R}^3$, and $J(\mathfrak{L}_1, \mathfrak{L}_2,\mathfrak{L}_3)$ the set of multijoints formed by them, i.e.…

Combinatorics · Mathematics 2014-01-27 Marina Iliopoulou

In a previous work, the third named author found a combinatorics of line arrangements whose realizations live in the cyclotomic group of the fifth roots of unity and such that their non-complex-conjugate embedding are not topologically…

Algebraic Geometry · Mathematics 2018-05-04 E. Artal , J. I. Cogolludo-Agustín , B. Guerville-Ballé , M. Marco-Buzunáriz

Let b(M) denote the maximal number of disjoint bases in a matroid M. It is shown that if M is a matroid of rank d+1, then for any continuous map f from the matroidal complex M into the d-dimensional Euclidean space there exist t \geq…

Combinatorics · Mathematics 2016-11-29 Imre Bárány , Gil Kalai , Roy Meshulam

Let $R(\phi)$ be the number of $\phi$-conjugacy (or Reidemeister) classes of an endomorphism $\phi$ of a group $G$. We prove for several classes of groups (including polycyclic) that the number $R(\phi)$ is equal to the number of fixed…

Group Theory · Mathematics 2018-04-04 Alexander Fel'shtyn , Evgenij Troitsky

We prove that there is an algorithm which determines whether or not a given 2-polyhedron can be embedded into some integral homology 3-sphere. This is a corollary of the following main result. Let $M$ be a compact connected orientable…

Geometric Topology · Mathematics 2016-06-03 Dmitry Tonkonog

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…

Discrete Mathematics · Computer Science 2020-04-22 Julien Bensmail , Hervé Hocquard , Dimitri Lajou , Eric Sopena

The balanced hypercube $BH_n$, a variant of the hypercube, was proposed as a desired interconnection network topology. It is known that $BH_n$ is bipartite. Assume that $S=\{s_1,s_2,\cdots,s_{2n-2}\}$ and $T=\{t_1,t_2,\cdots,t_{2n-2}\}$ are…

Combinatorics · Mathematics 2020-01-22 Huazhong Lü , Tingzeng Wu

We prove that any $n$-vertex graph whose complement is triangle-free contains $n^2/12-o(n^2)$ edge-disjoint triangles. This is tight for the disjoint union of two cliques of order $n/2$. We also prove a corresponding stability theorem, that…

Combinatorics · Mathematics 2021-01-27 Mykhaylo Tyomkyn

Cocompactness is a property of embeddings between two Banach spaces, similar to but weaker than compactness, defined relative to some non-compact group of bijective isometries. In presence of a cocompact embedding, bounded sequences (in the…

Functional Analysis · Mathematics 2016-01-20 Cyril Tintarev

In 1989 H. Tverberg proposed a quite general conjecture in Discrete geometry, which could be considered as the common basis for many results in Combinatorial geometry and at the same time as a discrete analogue of the common transversal…

Combinatorics · Mathematics 2007-05-23 Sinisa T. Vrecica

In the paper "Broersma and Hoede, {\it Path graphs}, J. Graph Theory {\bf 13} (1989) 427-444", the authors proposed a problem whether there is a triple of mutually nonisomorphic connected graphs which have an isomorphic connected…

Combinatorics · Mathematics 2007-11-26 Xueliang Li , Yan Liu

It was proven in the first author's paper "Contact 3-manifolds twenty years since J. Martinet's work" (Ann. Inst. Fourier, 42(1992), 165--192) that any tight contact structure on the 3-sphere is diffeomorphic to the standard one. It was…

Symplectic Geometry · Mathematics 2021-08-24 Yakov Eliashberg , Nikolai Mishachev

We extend the polydisk theorem of [21], originally established for classical Cartan-Hartogs domains, to Hartogs domains over arbitrary (possibly reducible and exceptional) bounded symmetric domains. We further establish a dual counterpart…

Differential Geometry · Mathematics 2025-11-14 Andrea Loi , Roberto Mossa , Fabio Zuddas

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

Computational Geometry · Computer Science 2008-11-04 Muhammad Abdullah Adnan , Masud Hasan
‹ Prev 1 4 5 6 7 8 10 Next ›