English
Related papers

Related papers: A new upper bound for mutually touching infinite c…

200 papers

We consider the following question: Given $n$ lines and $n$ circles in $\mathbb{R}^3$, what is the maximum number of intersection points lying on at least one line and on at least one circle of these families. We prove that if there are no…

Combinatorics · Mathematics 2020-05-29 Andrey Sergunin

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…

Metric Geometry · Mathematics 2016-07-21 Oleg R. Musin , Anton V. Nikitenko

We initiate the study of chromatic numbers for contact graphs of configurations of integer-sized cuboids in three dimensions, all of which are mutually congruent. Disallowing rotations, we show a global upper bound of 8 for the chromatic…

Combinatorics · Mathematics 2025-12-23 Søren Eilers , Rune Johansen , Rasmus Veber Rasmussen , Carsten Thomassen

Objects with large symmetry groups have been an interest for many mathematicians. A classical question in geometry is whether a surface with certain geometric features, such as completeness, curvature, etc..., can embed in $\mathbb{R}^3.$…

Differential Geometry · Mathematics 2022-09-05 Dami Lee , Casey Zhao

According to a conjecture of Pach, there are $O(n)$ tangent pairs among any family of $n$ Jordan arcs in which every pair of arcs has precisely one common point and no three arcs share a common point. This conjecture was proved for two…

Combinatorics · Mathematics 2026-03-13 Eyal Ackerman , Balázs Keszegh

We show that the maximum number of pairwise non-overlapping $k$-rich lenses (lenses formed by at least $k$ circles) in an arrangement of $n$ circles in the plane is $O\left(\frac{n^{3/2}\log{(n/k^3)}}{k^{5/2}} + \frac{n}{k} \right)$, and…

Combinatorics · Mathematics 2020-12-09 Esther Ezra , Orit E. Raz , Micha Sharir , Joshua Zahl

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)$…

Geometric Topology · Mathematics 2017-04-24 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann

We prove upper bounds on the average kissing number $k(\mathcal{P})$ and contact number $C(\mathcal{P})$ of an arbitrary finite non-congruent sphere packing $\mathcal{P}$, and prove an upper bound on the packing density…

Metric Geometry · Mathematics 2015-10-05 Samuel Reid

We show that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $20$, and that if equality is attained, then the…

Algebraic Geometry · Mathematics 2021-10-08 Fabrizio Catanese

What is the maximum number of intersections of the boundaries of a simple $m$-gon and a simple $n$-gon, assuming general position? This is a basic question in combinatorial geometry, and the answer is easy if at least one of $m$ and $n$ is…

Combinatorics · Mathematics 2023-05-17 Eyal Ackerman , Balázs Keszegh , Günter Rote

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

Combinatorics · Mathematics 2025-09-30 Lotrenzo Mella , Gloria Rinaldi

We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…

Combinatorics · Mathematics 2015-02-11 Felix Günther

A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…

Number Theory · Mathematics 2019-08-27 William Banks , Paul Pollack , Carl Pomerance

An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…

Discrete Mathematics · Computer Science 2008-12-06 Jinshan Zhang

In this paper we will discuss optimal lower and upper density of non-parallel cylinder packings in $R^{3}$ and similar problems. The main result of the paper is a proof of the conjecture of K. Kuperberg for upper density (existence of a…

Metric Geometry · Mathematics 2023-10-12 Ofek Eliyahu

We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…

Combinatorics · Mathematics 2026-04-01 Andrey Egorov

Let the kissing number $K(d)$ be the maximum number of non-overlapping unit balls in $\mathbb R^d$ that can touch a given unit ball. Determining or estimating the number $K(d)$ has a long history, with the value of $K(3)$ being the subject…

Combinatorics · Mathematics 2023-12-19 Irene Gil Fernández , Jaehoon Kim , Hong Liu , Oleg Pikhurko

We improve the upper bound for the maximum possible number of stable matchings among $n$ jobs and $n$ applicants from $131072^n+O(1)$ to $3.55^n+O(1)$. To establish this bound, we state a novel formulation of a certain entropy bound that is…

Combinatorics · Mathematics 2021-06-07 Cory Palmer , Dömötör Pálvölgyi

We discuss the problem of finding an upper bound for the number of equilibrium points of a potential of several fixed point charges in R^n. This question goes back to J.C.Maxwell and M.Morse. Using fewnomial theory we show that for a given…

Mathematical Physics · Physics 2007-05-23 Andrei Gabrielov , Dmitry Novikov , Boris Shapiro

For fixed $k\ge 2$, determining the order of magnitude of the number of edges in an $n$-vertex bipartite graph not containing $C_{2k}$, the cycle of length $2k$, is a long-standing open problem. We consider an extension of this problem to…

Combinatorics · Mathematics 2024-02-21 Sayan Mukherjee