Results 1 to 10 of about 1,140,438 (310)
Vortex Filament Equation for a Regular Polygon in the Hyperbolic Plane [PDF]
The aim of this paper is twofold. First, we show the evolution of the vortex filament equation (VFE) for a regular planar polygon in the hyperbolic space.
Francisco de la Hoz+2 more
semanticscholar +2 more sources
An inequality for regular near polygons [PDF]
Let $G$ denote a near-polygon distance-regular graph with diameter $d\geq 3$, valency $k$ and intersection numbers $a_1>0$, $c_2>1$. Let $ _1$ denote the second largest eigenvalue for the adjacency matrix of $G$. We show $ _1$ is at most $(k-a_1-c_2)/(c_2-1)$. We show the following are equivalent: (i) Equality is attained above; (ii) $G$ is $Q$-
Paul Terwilliger, Chih-wen Weng
openaire +4 more sources
Note on the Chromatic Number of Minkowski Planes: The Regular Polygon Case [PDF]
The famous Hadwiger–Nelson problem asks for the minimum number of colors needed to color the points of the Euclidean plane so that no two points unit distance apart are assigned the same color.
Panna Geh'er
semanticscholar +3 more sources
Card-Based Protocols Using Regular Polygon Cards [PDF]
SUMMARY Cryptographic protocols enable participating parties to compute any function of their inputs without leaking any information beyond the output. A card-based protocol is a cryptographic protocol implemented by physical cards.
Kazumasa Shinagawa+7 more
semanticscholar +2 more sources
Regular ternary polygonal forms [PDF]
Inspired by Dickson's classification of regular ternary quadratic forms, we prove that there are no primitive regular $m$-gonal forms when $m$ is sufficiently large. In order to do so, we construct sequences of primes that are inert in a certain quadratic field and show that they satisfy a certain inequality bounding the next prime by the product of ...
Zilong He, Ben Kane
openaire +5 more sources
This paper describes a robust regular polygon detector. Given image edges, we derive the a posteriori probability for a mixture of regular polygons, and thus the probability density function for the appearance of a set of regular polygons. Likely regular polygons can be isolated quickly by discretising and collapsing the search space into three ...
Nick Barnes, G. Loy, David Shaw
semanticscholar +5 more sources
Regular polygonal complexes in space, I [PDF]
A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular if its symmetry group is transitive on the flags.
Egon Schulte, Daniel Pellicer
openaire +7 more sources
Vortex filament equation for a regular polygon [PDF]
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
Circle packing in regular polygons
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, and we have carried out intensive numerical experiments spanning several polygons (the largest number of sides ...
Paolo Amore
openaire +4 more sources
Minimal fragmentation of regular polygonal plates [PDF]
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
openaire +6 more sources