中文
相关论文

相关论文: Mutually touching infinite cylinders in the 3D wor…

200 篇论文

We provide a complete classification of possible configurations of mutually pairwise touching infinite cylinders in Euclidian 3D space. It turns out that there is a maximum number of such cylinders possible in 3D independently on the shape…

度量几何 · 数学 2016-05-18 Peter V. Pikhitsa , Stanislaw Pikhitsa

John E. Littlewood posted the question {\em ``Is it possible in 3-space for seven infinite circular cylinders of unit radius each to touch all the others? Seven is the number suggested by counting constants.''} Boz\'oki, Lee, and R\'onyai…

组合数学 · 数学 2026-01-01 Jozsef Solymosi , Josh Zahl

It has been a challenge to make seven straight round cylinders mutually touch before our now 10-year old discovery [Phys. Rev. Lett. 93, 015505 (2004)] of configurations of seven mutually touching infinitely long round cylinders (then…

度量几何 · 数学 2014-03-28 Peter V. Pikhitsa , Mansoo Choi

Let $N$ denote the maximum number of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair of cylinders touches each other. Littlewood posed the question of whether $N=7$, which remains unsolved. In this…

度量几何 · 数学 2025-06-25 Junnosuke Koizumi

Littlewood asked for the maximum number $N$ of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair touches. We improve upon the proof of the second author that $N \leq 18$ to show that $N \leq 10$.…

组合数学 · 数学 2025-10-07 Travis Dillon , Junnosuke Koizumi , Sammy Luo

We solve a problem of Littlewood: there exist seven infinite circular cylinders of unit radius which mutually touch each other. In fact, we exhibit two such sets of cylinders. Our approach is algebraic and uses symbolic and numerical…

度量几何 · 数学 2017-09-18 Sándor Bozóki , Tsung-Lin Lee , Lajos Rónyai

Motivated by a question of W. Kuperberg, we study the 18-dimensional manifold of configurations of 6 non-intersecting infinite cylinders of radius $r,$ all touching the unit ball in $\mathbb{R}^{3}.$ We find a configuration with \[…

度量几何 · 数学 2019-05-13 Oleg Ogievetsky , Senya Shlosman

Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…

组合数学 · 数学 2017-06-20 Péter Györgyi , Bálint Hujter , Sándor Kisfaludi-Bak

In this article we give combinatorial criteria to decide whether a transitive cyclic combinatorial d-manifold can be generalized to an infinite family of such complexes, together with an explicit construction in the case that such a family…

组合数学 · 数学 2019-10-24 Jonathan Spreer

In this paper we study circles tangent to conics. We show there are generically $184$ complex circles tangent to three conics in the plane and we characterize the real discriminant of the corresponding polynomial system. We give an explicit…

代数几何 · 数学 2025-05-07 Paul Breiding , Julia Lindberg , Wern Juin Gabriel Ong , Linus Sommer

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

几何拓扑 · 数学 2018-10-24 Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

几何拓扑 · 数学 2007-05-23 Julia Viro

We consider the problem of finding the maximum number $e_d(n)$ of pairs of touching circles in a packing of $n$ congruent circles of diameter $d$ in the hyperbolic plane of curvature $-1$. In the Euclidean plane, the maximum comes from a…

组合数学 · 数学 2026-01-01 Ádám Sagmeister , Konrad J. Swanepoel

It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…

组合数学 · 数学 2014-10-10 Jürgen Bokowski , Jurij Kovič , Tomaž Pisanski , Arjana Žitnik

Given $n$ lines in general position in the plane, how many bounded triangular faces can the arrangement have? We construct a straight-line affine arrangement of $19$ lines satisfying the conditions of the iterative construction by…

组合数学 · 数学 2026-04-27 Roman Parpalak , Denis Utkin

The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…

几何拓扑 · 数学 2017-04-24 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann

Over the complex numbers, there are 92 plane conics meeting 8 general lines in projective 3-space. Using the Euler class and local degree from motivic homotopy theory, we give an enriched version of this result over any perfect field. This…

代数几何 · 数学 2023-06-01 Cameron Darwin , Aygul Galimova , Miao Pam Gu , Stephen McKean

Let $M$ be an irreducible, compact, connected, orientable 3-manifold whose boundary is a torus. We show that if $M$ is hyperbolic, then it admits at most six finite/cyclic fillings of maximal distance 5. Further, the distance of a…

几何拓扑 · 数学 2016-09-06 Steven Boyer , Xingru Zhang

The absolute upper bound on the number of equiangular lines that can be found in $\mathbf{R}^d$ is $d(d+1)/2$. Examples of sets of lines that saturate this bound are only known to exist in dimensions $d=2,3,7$ or $23$. By considering the…

度量几何 · 数学 2018-11-20 Neil I. Gillespie

We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…

度量几何 · 数学 2016-07-21 Oleg R. Musin , Anton V. Nikitenko
‹ 上一页 1 2 3 10 下一页 ›