English
Related papers

Related papers: Dividing the circle

200 papers

We consider the problem of locally describing tubular geometry around a submanifold embedded in a (pseudo)Riemannian manifold in its general form. Given the geometry of ambient space in an arbitrary coordinate system and equations…

High Energy Physics - Theory · Physics 2016-08-29 Partha Mukhopadhyay

The leading idea of the paper is to treat the theorem of Wigner with methods inspired by geometry. The exercise mentionned in the title has two functions: On the one hand it can serve as a pedagogical text in order to make the reader…

Mathematical Physics · Physics 2011-07-04 Manfred Buth

In this work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…

Computational Geometry · Computer Science 2024-11-12 Reymond Akpanya , Adi Rivkin , Frederick Stock

This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…

Combinatorics · Mathematics 2012-09-28 Douglas Bowman , Alon Regev

We investigate inequalities for partial sums of complex numbers with bounded modulus and zero total sum, a topic referred to as "polygonal confinement". Starting from Steinitz's classical result, we provide detailed constructions yielding…

Combinatorics · Mathematics 2026-03-18 Jean-Christophe Pain

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

Computational Geometry · Computer Science 2023-03-08 Paolo Amore

We give a complete classification of edge-to-edge tilings of the sphere by regular polygons under a unified framework. Without assuming convexity of the tiles or polyhedrality of the underlying graph, our proof is independent of the…

Combinatorics · Mathematics 2025-12-08 Hoi Ping Luk , Roman Nedela , Christopher Purcell

In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…

Probability · Mathematics 2024-11-06 Dominic Schuhmacher , Leoni Carla Wirth

We develop a generalization of manifold calculus in the sense of Goodwillie-Weiss where the manifold is replaced by a simplicial complex. We consider functors from the category of open subsets of a fixed simplical complex into the category…

Geometric Topology · Mathematics 2017-11-21 Steffen Tillmann

We prove a normal form theorem for Poisson structures around Poisson transversals (also called cosymplectic submanifolds), which simultaneously generalizes Weinstein's symplectic neighborhood theorem from symplectic geometry and Weinstein's…

Symplectic Geometry · Mathematics 2017-04-12 Pedro Frejlich , Ioan Marcut

Polygonalization of any smooth billiard boundary can be carried out in several ways. We show here that the semiclassical description depends on the polygonalization process and the results can be inequivalent. We also establish that…

Chaotic Dynamics · Physics 2009-11-07 Debabrata Biswas

We investigate the ``generalized Heron polynomial'' that relates the squared area of an n-gon inscribed in a circle to the squares of its side lengths. For a (2m+1)-gon or (2m+2)-gon, we express it as the defining polynomial of a certain…

Metric Geometry · Mathematics 2007-05-23 F. Miller Maley , David P. Robbins , Julie Roskies

We study Poncelet's Theorem in finite projective coordinate planes over the field $GF(p)$ and concentrate on a particular pencil of conics. For pairs of such conics we investigate whether we can find polygons with $n$ sides, which are…

Combinatorics · Mathematics 2014-09-11 Norbert Hungerbühler , Katharina Kusejko

This paper gives a new approximation theory for finitely generated modules over commutative Noetherian rings, which unifies two famous approximation theorems; one is due to Auslander and Bridger and the other is due to Auslander and…

Commutative Algebra · Mathematics 2007-05-23 Ryo Takahashi

We study the geometric structure of Poncelet $n$-gons from a projective point of view. In particular we present explicit constructions of Poncelet $n$-gons for certain $n$ and derive algebraic characterisations in terms of bracket…

Combinatorics · Mathematics 2024-08-20 Leah Wrenn Berman , Gábor Gévay , Jürgen Richter-Gebert , Serge Tabachnikov

In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding…

Combinatorics · Mathematics 2016-03-30 Jérôme Bastien

We give a tight upper bound on the polygonal diameter of the interior, resp. exterior, of a simple $n$-gon, $n \ge 3$, in the plane as a function of $n$, and describe an $n$-gon $(n \ge 3)$ for which both upper bounds (for the interior and…

Combinatorics · Mathematics 2010-12-17 Yaakov S. Kupitz , Horst Martini , Micha A. Perles

Given a real cubic function $f(x)$ with three roots, take an equilateral triangle $ABC$, the projections of which vertices are the roots of $f(x)$. There is a folklore fact that the vertical lines through the extrema of $f(x)$ are tangent…

Classical Analysis and ODEs · Mathematics 2024-01-24 Andrey Ryabichev , Konstantin Shcherbakov

In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…

Number Theory · Mathematics 2016-07-05 Damien Roy

We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…

Computational Geometry · Computer Science 2020-11-03 Alon Efrat , Radoslav Fulek , Stephen Kobourov , Csaba D. Tóth