相关论文: Almost-tiling the plane by ellipses

Every body knows that identical regular triangles or squares can tile the whole plane. Many people know that identical regular hexagons can tile the plane properly as well. In fact, even the bees know and use this fact! Is there any other…

In this work, we will explore some polygons that individually are capable of filling the plane in an aperiodic way. These polygons were recently discovered by some researchers and constitute a great discovery for Mathematics. We will…

Motivated in part by the recent observation of liquid glass in suspensions of ellipsoidal colloids, we examine the structure of jammed ellipse packings over a much wider range of particle aspect ratios ($\alpha$) than has been previously…

Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…

We study the symplectic embedding capacity function $C_{\beta}$ for ellipsoids $E(1,\alpha)\subset R^4$ into dilates of polydisks $P(1,\beta)$ as both $\alpha$ and $\beta$ vary through $[1,\infty)$. For $\beta=1$ Frenkel and Mueller showed…

In this paper we present a combinatorial generalization of the fact that the number of plane partitions that fit in a $2a\times b\times b$ box is equal to the number of such plane partitions that are symmetric, times the number of such…

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

Suppose one has a collection of disks of various sizes with disjoint interiors, a packing in the plane, and suppose the ratio of the smallest radius divided by the largest radius lies between $1$ and $q$. In his 1964 book Regular Figures…

Given N points in the plane $P_1 P_2...P_N$ and a location $\Omega$, the union of discs with diameters $[\Omega P_i], i = 1, 2,...N$ covers the convex hull of the points. The location $\Omega_s$ minimizing the area covered by the union of…

Random tilings or packings in the plane are characterized by a size distribution of individual elements (domains) and by the statistics of neighbor relations between the domains. Most systems occurring in nature or technology have a…

In a previous paper we introduced examples of Hamiltonian mappings with phase space structures resembling circle packings. We now concentrate on one particular mapping and present numerical evidence which supports the conjecture that the…

Given a finite set S in $[0,1]^2$ including the origin, an anchored rectangle packing is a set of non-overlapping rectangles in the unit square where each rectangle has a point of S as its left-bottom corner and contains no point of S in…

Let R be a four-sided convex polygon in the xy plane and let M1 and M2 be the midpoints of the diagonals of R. It is well-known that if E is an ellipse inscribed in R, then the center of E must lie on Z, the open line segment connecting M1…

We extend the conformal mapping approach elaborated for the radial Diffusion Limited Aggregation model (DLA) to the cylindrical geometry. We introduce in particular a complex function which allows to grow a cylindrical cluster using as…

In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

We consider certain point patterns of an Euclidean space and calculate the Ellis enveloping semigroup of their associated dynamical systems. The algebraic structure and the topology of the Ellis semigroup, as well as its action on the…

We give a simple proof of T. Stehling's result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.

It is known that for every $\alpha \geq 1$ there is a planar triangulation in which every ball of radius $r$ has size $\Theta(r^\alpha)$. We prove that for $\alpha <2$ every such triangulation is quasi-isometric to a tree. The result…

We consider tilings of a triangle $ABC$ by congruent copies of a triangle that has one angle equal to $120^\circ$, has non-commensurable angles (that is, not all angles are rational multiples of $\pi$), and is not similar to $ABC$. We prove…