Related papers: Envelopes created by circle families in the plane
A four-bar linkage is a mechanism consisting of four rigid bars which are joined by their endpoints in a polygonal chain and which can rotate freely at the joints (or vertices). We assume that the linkage lies in the 2-dimensional plane so…
We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…
For any delta > 1 we construct a periodic and locally finite packing of the plane with ellipses whose delta-enlargement covers the whole plane. This answers a question of Imre B\'ar\'any. On the other hand, we show that if C is a packing in…
Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
Makeev proved that among centrally symmetric four-dimensional polytopes, with more than twenty facets and circumscribed about the Euclidean ball of diameter one, there is no universal cover for the family of unit diameter sets. In this…
The general d-dimensional twisted group lattice is solved. The irreducible representations of the corresponding group are constructed by an explicit procedure. It is proven that they are complete. All matrix representation solutions to the…
An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…
We construct infinite families of abstract regular polytopes of type $\{4,p_1,\ldots,p_{n-1}\}$ from extensions of centrally symmetric spherical abstract regular $n$-polytopes. In addition, by applying the halving operation, we obtain…
A bisection line divides a convex planar curve into two parts with equal areas. It is natural to study the envelope of these lines, which in general present singularities. The polygonal case is particularly inte\-resting, since there are…
In this note we study the integer solutions of Cayley's cubic equation. We find infinite families of solutions built from recurrence relations. We use these solutions to solve certain general Pell equations. We also show the similarities…
The topic of totally separable sphere packings is surveyed with a focus on regular constructions, uniform tilings, and contact number problems. An enumeration of all regular totally separable sphere packings in $\mathbb{R}^2$,…
We introduce some compact orbifolds on which there is a certain finite group action having a simple convex polytope as the orbit space. We compute the orbifold fundamental group and homology groups of these orbifolds. We calculate the…
The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjoint circles. A well-known generalization is the Primal-Dual Circle Packing Theorem for 3-connected planar…
We give an overview of various recent results concerning the topology of symplectic 4-manifolds and singular plane curves, using branched covers and isotopy problems as a unifying theme. While this paper does not contain any new results, we…
In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…
We classify endomorphisms of the plane that preserve a pencil of curves.
We prove an isoperimetric inequality for filling cellular cycles in a high dimensional cube with cellular chains. In addition, we provide a family of cubical cellular cycles for which the exponent in the inequality is optimal.
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…