Results 21 to 30 of about 1,212,069 (375)
Minimal fragmentation of regular polygonal plates [PDF]
Physical Review E, 2014 Minimal fragmentation models intend to unveil the statistical properties of large ensembles of identical objects, each one segmented in {\it two} parts only. Contrary to what happens in the multifragmentation of a single body, minimally fragmented ensembles are often amenable to analytical treatments, while keeping key features of multifragmentation ...
Laércio Dias, Fernando Parisio
openalex +6 more sources
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes [PDF]
arXiv, 2000 We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration questions in both directions: Given a polygon, how many foldings are there? Given a polytope, how many unfoldings
Demaine, Erik D. +3 more
arxiv +5 more sources
Tilings by regular polygons—II: A catalog of tilings
Computers & Mathematics with Applications, 1989 AbstractSeveral classification theorems involving highly symmetric tilings by regular polygons have been established recently. This paper surveys that work and gives drawings of these tilings—many of which were not shown in the original papers. Included are all tilings with at most three symmetry classes (orbits) of tiles, vertices or edges and those ...
Darrah Chavey
openalex +4 more sources
Some contributions to Regular Polygons [PDF]
arXiv, 2016 The aim of this work is to use Napoleon's Theorem in different regular polygons, and decide whether we can prove Napoleon's Theorem is only limited with triangles or it could be done in other regular polygons that can create regular polygons.
ÖNCEL, Deniz, KİRİŞÇİ, Murat
arxiv +4 more sources
Vortex filament equation for a regular polygon [PDF]
Nonlinearity, 2013 In this paper, we study the evolution of the vortex filament equation, with X(s, 0) being a regular planar polygon. Using algebraic techniques, supported by full numerical simulations, we give strong evidence that X(s, t) is also a polygon at any ...
Francisco de la Hoz, L. Vega
semanticscholar +7 more sources
On Dirichlet eigenvalues of regular polygons
Journal of Mathematical Analysis and ApplicationsWe prove that the first Dirichlet eigenvalue of a regular $N$-gon of area $ $ has an asymptotic expansion of the form $ _1(1+\sum_{n\ge3}C_n( _1)N^{-n})$ as $N\to\infty$, where $ _1$ is the first Dirichlet eigenvalue of the unit disk and $C_n$ are polynomials whose coefficients belong to the space of multiple zeta values of weight $n$.
David Berghaus +3 more
openalex +4 more sources
Some addition to the development of mathematical support for transport navigation [PDF]
E3S Web of Conferences, 2022 Formed in the 1960s, the classical methods of guaranteeing estimation are applied to provide navigation for various modes of transport. Many works of both foreign and domestic authors are devoted to the application of this method.
Ovchintsev Mikhail
doaj +1 more source
In search for a perfect shape of polyhedra: Buffon transformation [PDF]
, 2014 For an arbitrary polygon consider a new one by joining the centres of consecutive edges. Iteration of this procedure leads to a shape which is affine equivalent to a regular polygon.
Schreiber, V. +2 more
core +3 more sources
Constructing and Visualizing Uniform Tilings
Computers, 2023 This paper describes a system which takes user input of a pattern of regular polygons around one vertex and attempts to construct a uniform tiling with the same pattern at every vertex by adding one polygon at a time.
Nelson Max
doaj +1 more source