English
Related papers

Related papers: Envelopes created by circle families in the plane

200 papers

We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…

Algebraic Geometry · Mathematics 2010-03-29 Gábor Megyesi , Frank Sottile

We determine the distribution of nearest neighbour spacings between the tangencies to a fixed circle in a class of circle packings generated by reflections. We use a combination of geometric tools and the theory of automorphic forms.

Number Theory · Mathematics 2015-09-11 Zeev Rudnick , Xin Zhang

Suppose we put an $\epsilon$-disk around each lattice point in the plane, and then we rotate this object around the origin for a set $\Theta$ of angles. When do we cover the whole plane, except for a neighborhood of the origin? This is the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alex Iosevich , Mihail N. Kolountzakis , Mate Matolcsi

Families of boxes in $\mathbb R^d$ are considered. In the paper an upper bound on the size of a minimum transversal in terms of the space dimension and the independence number of the given family was improved.

Combinatorics · Mathematics 2008-10-21 Arseny Akopyan

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

Computational Geometry · Computer Science 2024-08-07 Mikkel Abrahamsen , Tillmann Miltzow , Nadja Seiferth

In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…

Optimization and Control · Mathematics 2012-01-04 Boris S. Mordukhovich , Nguyen Mau Nam , Cristina Villalobos

Bounded Apollonian circle packings (ACP's) are constructed by repeatedly inscribing circles into the triangular interstices of a configuration of four mutually tangent circles, one of which is internally tangent to the other three. If the…

Number Theory · Mathematics 2010-01-12 Elena Fuchs , Katherine Sanden

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

We study a family of tessellations of the Euclidean plane which are obtained by local developments of algebraic equations satisfied by the Pauli matrices.

Group Theory · Mathematics 2020-09-07 Sylvain Barre , Mikael Pichot

We consider circle packings in the plane with circles of sizes $1$, $r\simeq 0.834$ and $s\simeq 0.651$. These sizes are algebraic numbers which allow a compact packing, that is, a packing in which each hole is formed by three mutually…

Computational Geometry · Computer Science 2019-12-06 Thomas Fernique

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…

Computational Geometry · Computer Science 2024-02-13 Michael N. Vrahatis

Enveloping algebras of Hom-Lie and Hom-Leibniz algebras are constructed.

Rings and Algebras · Mathematics 2008-12-07 Donald Yau

We describe a search for plane-filling curves traversing all edges of a grid once. The curves are given by Lindenmayer systems with only one non-constant letter. All such curves for small orders on three grids have been found. For all…

Combinatorics · Mathematics 2018-07-04 Jörg Arndt

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry…

Combinatorics · Mathematics 2010-07-28 Michel Deza , Mathieu Dutour Sikiric

Recently, we enumerate up to isometry, all locally rigid circle packings on the unit sphere with number of circles N<12. This problem is equivalent to the enumeration of irreducible contact graphs. In this paper we show that by using the…

Metric Geometry · Mathematics 2015-04-21 Oleg R. Musin , Alexey S. Tarasov

We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…

Combinatorics · Mathematics 2019-08-15 Stefan Felsner

Approximate but reliable solutions of a quantum system with $N$ identical particles can be easily computed with the envelope theory, also known as the auxiliary field method. This technique has been developed for Hamiltonians with arbitrary…

Quantum Physics · Physics 2017-07-20 C. Semay , F. Buisseret

Spiral Galaxies is a pencil-and-paper puzzle played on a grid of unit squares: given a set of points called centers, the goal is to partition the grid into polyominoes such that each polyomino contains exactly one center and is 180{\deg}…

Computational Geometry · Computer Science 2022-07-22 Erik D. Demaine , Maarten Löffler , Christiane Schmidt

An infinite family of exactly-solvable and integrable potentials on a plane is introduced. It is shown that all already known rational potentials with the above properties allowing separation of variables in polar coordinates are particular…

Mathematical Physics · Physics 2015-05-13 Frédérick Tremblay , Alexander V. Turbiner , Pavel Winternitz

Consider a curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding $P$ in the Euclidean space $\boldsymbol R^3$. The singular set $C$ of $P$ as a space curve is…

Differential Geometry · Mathematics 2020-07-23 Atsufumi Honda , Kosuke Naokawa , Kentaro Saji , Masaaki Umehara , Kotaro Yamada
‹ Prev 1 3 4 5 6 7 10 Next ›