Related papers: Envelopes created by circle families in the plane
We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give…
We received a solution of the shadow problem in n-dimensional Euclidean space for a family of sets, constructing from any convex domain having nonempty interior with the help of parallel translations and homotheties. We find a number of…
We describe four special families of ellipse-inscribed Poncelet triangles about the incircle which maintain certain triangle centers stationary and which also display interesting conservations.
Let A be a line arrangement in the complex projective plane CP2. We define and describe the inclusion map of the boundary manifold --the boundary of a close regular neighborhood of A-- in the exterior of the arrangement. We obtain two…
Two-, three- and four-dimensional representations of Penrose tilings of the plane are described. The vertices that occur in these representations lie on lattices. Symmetries and methods of visualizing these representations are discussed.…
In this note we construct an infinite family of ancient solutions to the Curve Shortening Flow which span the halfplane.
Given a family of complex affine planes, we show that it is trivial over a Zariski open subset of the base. The proof relies upon a relative version of the contraction theorem.
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
It is shown that the parameters contained in any two complete solutions of the Hamilton-Jacobi equation, corresponding to a given Hamiltonian, are related by means of a time-independent canonical transformation and that, in some cases, a…
In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…
We introduce two notions of convexity for an infinite regular tree. For these two notions we show that given a continuous boundary datum there exists a unique convex envelope on the tree and characterize the equation that this envelope…
There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the areas of which are bounded from below by a positive constant.…
Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…
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…
The paper is devoted to some extremal problems, related to convex polygons in the Euclidean plane and their perimeters. We present a number of results that have simple formulations, but rather intricate proofs. Related and still unsolved…
We present a new class of electrostatics problems that are exactly solvable by adding finitely many image charges. Given a charge at some location inside a cavity bounded by up to four conducting grounded segments of spheres: if the spheres…
We classify all functions satisfying non-trivial families of PVI equations. It turns out that, up to an Okamoto equivalence, there are exactly four families parameterized by affine planes or lines. Each affine space is generated by points…
This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…
A brief report on recent work on the sphere-packing problem.