Related papers: A Local Characterization of Combinatorial Multihed…

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

In this paper we introduce a class of polygonal complexes for which we can define a notion of sectional combinatorial curvature. These complexes can be viewed as generalizations of 2-dimensional Euclidean and hyperbolic buildings. We focus…

Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…

In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…

We study incidence geometries that are thin and residually connected. These geometries generalise abstract polytopes. In this generalised setting, guided by the ideas from the polytopes theory, we introduce the concept of chirality, a…

It is known that for each combinatorial type of convex 3-dimensional polyhedra, there is a representative with edges tangent to the unit sphere. This representative is unique up to projective transformations that fix the unit sphere. We…

We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…

This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

Equifacetal simplices, all of whose codimension one faces are congruent to one another, are studied. It is shown that the isometry group of such a simplex acts transitively on its set of vertices, and, as an application, equifacetal…

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. One extreme of the finite problem is single tile tilings. We develop the algorithm for finding all the single tile tilings and present the…

A chiral polyhedron has a geometric symmetry group with two orbits on the flags, such that adjacent flags are in distinct orbits. Part I of the paper described the discrete chiral polyhedra in ordinary Euclidean 3-space with finite skew…

Skeletal polyhedra are discrete connected structures consisting of finite (planar or skew) or infinite (linear, planar, or spatial) polygons as faces, with two faces on each edge and a circular vertex figure at each vertex. The present…

We describe a characterization of convex polyhedra in $\h^3$ in terms of their dihedral angles, developed by Rivin. We also describe some geometric and combinatorial consequences of that theory. One of these consequences is a combinatorial…

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

Orbit portraits were introduced by Milnor as a combinatorial tool to describe the patterns of all periodic dynamical rays landing on a periodic cycle of a quadratic polynomial. This encodes information about the dynamics and the parameter…

This paper investigates the rigidity of bordered polyhedral surfaces. Using the variational principle, we show that bordered polyhedral surfaces are determined by boundary value and discrete curvatures on the interior edges. As a corollary,…

The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…