Compression theorems for periodic tilings and consequences.
Benjamin, Arthur T., Eustis, Alex K., Shattuck, Mark A. (2009)
Journal of Integer Sequences [electronic only]
H. Martini (1991)
Discrete & computational geometry
Ruskey, Frank, Woodcock, Jennifer (2009)
The Electronic Journal of Combinatorics [electronic only]
N. Alon, D.J. Kleitman (1986)
Discrete & computational geometry
J. Pach (1986)
Discrete & computational geometry
Szabó, Sándor (1993)
Beiträge zur Algebra und Geometrie
J.C. Lagarias, P.W. Shor (1994)
Discrete & computational geometry
Roland Bacher (1999)
Annales de l'institut Fourier
This paper describes local configurations of some planar triangulations. A Gauss-Bonnet-like formula holds locally for a kind of discrete “curvature” associated to such triangulations.
M. Laczkovich (1995)
Discrete & computational geometry
Breda, Ana M., Santos, Altino F. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Breda, Ana M.d'Azevedo, Santos, Altino F. (2004)
Beiträge zur Algebra und Geometrie
E.A. Kasimatis (1989)
Discrete & computational geometry
Diane M. Donovan, James G. Lefevre, Thomas A. McCourt, Nicholas J. Cavenagh (2012)
Commentationes Mathematicae Universitatis Carolinae
We define a proper triangulation to be a dissection of an integer sided equilateral triangle into smaller, integer sided equilateral triangles such that no point is the vertex of more than three of the smaller triangles. In this paper we establish necessary and sufficient conditions for a proper triangulation of a convex region to exist. Moreover we establish precisely when at least two such equilateral triangle dissections exist. We also provide necessary and sufficient conditions for some convex...
Broughton, S.Allen, Haney, Dawn M., McKeough, Lori T., Smith Mayfield, Brandy (2000)
The New York Journal of Mathematics [electronic only]
Sellers, James A. (2002)
Journal of Integer Sequences [electronic only]
Paz Morillo Bosch, Miguel Angel Fiol Mora (1986)
Stochastica
This paper studies some diameter-related properties of the 3-step circulant digraphs with set of vertices V≡ZN and steps (± a,b). More precisely, it concentrates upon maximizing their order N for any fixed value of their diameter k. In the proposed geometrical approach, each digraph is fully represented by a T-shape tile which tessellates periodically the plane. The study of these tiles leads to the optimal solutions.
Helfgott, Harald A., Gessel, Ira M. (1999)
The Electronic Journal of Combinatorics [electronic only]
Sándor Szabó (2010)
Discussiones Mathematicae - General Algebra and Applications
It is a known result that if a finite abelian group of odd order is a direct product of lacunary cyclic subsets, then at least one of the factors must be a subgroup. The paper gives an elementary proof that does not rely on characters.
Corrádi, Keresztély, Szabó, Sándor (2009)
Integers
Kolountzakis, Mihail N. (2004)
The Electronic Journal of Combinatorics [electronic only]