Related papers: Geometric constructibility of polygons lying on a …
We present explicit filtration/backprojection-type formulae for the inversion of the spherical (circular) mean transform with the centers lying on the boundary of some polyhedra (or polygons, in 2D). The formulae are derived using the…
It is well-known that every isosceles tetrahedron (disphenoid) admits infinitely many simple closed geodesics on its surface. They can be naturally enumerated by pairs of co-prime integers $n > m > 1$ with two additional cases $(1,0)$ and…
The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior…
In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…
Hohlweg and Lange (2007) and Santos (2004, unpublished) have found two different ways of constructing exponential families of realizations of the n-dimensional associahedron with normal vectors in {0,1,-1}^n, generalizing the constructions…
A "ham sandwich" theorem is derived for n complex Borel measures on C^n. For each integer m>=2, it shown that there exists a regular m-fan centered about a complex hyperplane, satisfying the condition that for each complex measure, the "Z_m…
We prove that the number of tile types required to build squares of size n x n, in Winfree's abstract Tile Assembly Model, when restricted to using only non-cooperative tile bindings, is at least 2n-1, which is also the best known upper…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
In this note we consider the problem of manufacturing a convex polyhedral object via casting. We consider a generalization of the sand casting process where the object is manufactured by gluing together two identical faces of parts cast…
We show that every $4$-chromatic graph on $n$ vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most $\tfrac12\,(1+\sqrt{8n-7})$. Let $G$ be a non-bipartite quadrangulation of the projective plane on $n$…
In this article, we introduce a systematic and uniform construction of non-singular plane curves of odd degrees $n \geq 5$ which violate the local-global principle. Our construction works unconditionally for $n$ divisible by $p^2$ for some…
This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton…
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…
An m x n cobweb network consists of n radial lines emanating from a center and connected by $m$ concentric n-sided polygons. A conjecture of Tan, Zhou and Yang for the resistance from center to perimeter of the cobweb is proved by extending…
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…
Using the formalism of flag algebras, we prove that every triangle-free graph $G$ with $n$ vertices contains at most $(n/5)^5$ cycles of length five. Moreover, the equality is attained only when $n$ is divisible by five and $G$ is the…
A spherical n-gon is a bordered surface homeomorphic to a closed disk, with n distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the boundary arcs…
We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…
We study the structure of the unit sphere of polygonal Radon planes from a geometric point of view. In particular, we prove that a $ 2 $-dimensional real polygonal Banach space $ \mathbb{X} $ cannot be a Radon plane if the number of…