English
Related papers

Related papers: First Families of Regular Polygons

200 papers

Every regular N-gon defines a canonical family of regular polygons which are conforming to the bounds of the 'star polygons' determined by N. These star polygons are formed from truncated extended edges of the N-gon and the intersection…

Dynamical Systems · Mathematics 2026-04-06 G. H. Hughes

There are multiple mappings that can be used to generate what we call the 'edge geometry' of a regular N-gon, but they are all based on piecewise isometries acting on the extended edges of N to form a 'singularity' set W. This singularity…

Dynamical Systems · Mathematics 2024-07-09 Gordon Hughes

In 1973, J. Moser proposed that his Twist Theorem could be used to show that orbits of the outer billiards map on a sufficiently smooth closed curve were always bounded. Five years later Moser asked the same question for a convex polygon.…

Dynamical Systems · Mathematics 2014-10-09 G. H. Hughes

There are multiple mappings that can be used to generate what we call the 'edge geometry' of a regular N-gon, but they are all based on piecewise isometries acting on the extended edges of N to form a 'singularity' set W. This singularity…

Dynamical Systems · Mathematics 2025-02-04 G. H. Hughes

The investigation of the relation among the distances of an arbitrary point in the Euclidean space $\mathbb{R}^n$ to the vertices of a regular $n$-simplex in that space has led us to the study of simplices having a regular facet. Calling an…

Metric Geometry · Mathematics 2017-02-01 Mowaffaq Hajja , Mostafa Hayajneh , Ismail Hammoudeh

This paper investigates the \textbf{graphical $r$-Stirling numbers of the first kind}, denoted by $\str{G}{k}$, which enumerate partitions of a vertex set $V(G)$ into $k$ disjoint cycles such that $r$ specified vertices occupy distinct…

Combinatorics · Mathematics 2026-02-03 Daniel Yaqubi , Madjid Mirzavaziri

Outer Billiards is a geometrically inspired dynamical system based on a convex shape in the plane. When the shape is a polygon, the system has a combinatorial flavor. In the polygonal case, there is a natural acceleration of the map, a…

Dynamical Systems · Mathematics 2010-07-20 Richard Evan Schwartz

We consider two families of Pascal-like triangles that have all ones on the left side and ones separated by $m-1$ zeros on the right side. The $m=1$ cases are Pascal's triangle and the two families also coincide when $m=2$. Members of the…

Combinatorics · Mathematics 2022-12-21 Michael A. Allen , Kenneth Edwards

We construct a Legendrian version of Envelope theory. A tangential family is a 1-parameter family of rays emanating tangentially from a smooth plane curve. The Legendrian graph of the family is the union of the Legendrian lifts of the…

Differential Geometry · Mathematics 2007-05-23 Gianmarco Capitanio

We describe all families of star-shaped n-polygons in the Euclidean plane with prescribed perimeter and area ; they are leaves of a foliation F on the space of star-shaped n-polygons. By the way, we study some geometric properties of convex…

Differential Geometry · Mathematics 2019-02-13 Aziz El Kacimi Alaoui , Abdellatif Zeggar

A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such a family in $\mathbb{R}^n$ was extensively studied for the…

Combinatorics · Mathematics 2017-06-30 Igor Balla , Felix Dräxler , Peter Keevash , Benny Sudakov

This article is dedicated to the study of singular codimension $1$ foliations $\mathcal{F}$ on a simplicial complete toric variety $X$ and their pullbacks by dominant rational maps $\varphi:\mathbb{P}^n\dashrightarrow X$. First, we describe…

Algebraic Geometry · Mathematics 2023-01-31 Javier Gargiulo Acea , Ariel Molinuevo , Sebastián Velazquez

Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R = K[x_1,\ldots,x_n]$. We initiate a study of…

Combinatorics · Mathematics 2020-03-18 Takayuki Hibi , Kyouko Kimura , Kazunori Matsuda , Adam Van Tuyl

The family of generalized Petersen graphs $G(n, k)$, introduced by Coxeter et al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a…

Combinatorics · Mathematics 2019-11-12 Matjaž Krnc , Tomaž Pisanski

In this paper we present a uniform way to derive families of maps from the corresponding differential equations describing systems which experience periodic kicks. The families depend on a single parameter - the order of a differential…

Chaotic Dynamics · Physics 2013-05-07 Mark Edelman

This paper extends to dimension 4 the results in the article "Second Order Families of Special Lagrangian 3-folds" by Robert Bryant. We consider the problem of classifying the special Lagrangian 4-folds in C^4 whose fundamental cubic at…

Differential Geometry · Mathematics 2007-05-23 Marianty Ionel

Families of oriented lines in $\mathbb{R}^{n+1}$ are studied via their identification with submanifolds of $T\mathbb{S}^n$. In particular, families of oriented lines which are orthogonal to submanifolds in $\mathbb{R}^{n+1}$ are shown to…

Differential Geometry · Mathematics 2026-01-27 Nikos Georgiou , Brendan Guilfoyle , Morgan Robson

In this paper, we provide the first known infinite family of simple graphs, each of which is the skeleton of a chiral map, a skeleton of a reflexible map on an orientable surfaces, as well as a skeleton of a reflexible map on a…

Combinatorics · Mathematics 2025-03-18 Isabel Hubard , Primož Potočnik , Primož Šparl

The E. Cartan's equations defining "simple" spinors (renamed "pure" by C. Chevalley) are interpreted as equations of motions for fermion multiplets in momentum spaces which, in a constructive approach based bilinearly on those spinors,…

High Energy Physics - Theory · Physics 2008-11-26 P. Budinich

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
‹ Prev 1 2 3 10 Next ›