Grid Graphs and Lattice Surfaces

نویسندگان

  • W. PATRICK HOOPER
  • PATRICK HOOPER
چکیده

First, we apply Thurston’s construction of pseudo-Anosov homeomorphisms to grid graphs and obtain translation surfaces whose Veech groups are commensurable to (m, n,∞) triangle groups. Many (if not all) of the surfaces we construct were first discovered by Bouw and Möller, however our treatment of the surfaces differs. We construct these surfaces by gluing together polygons in two ways. We use these elementary descriptions to compute the Veech groups, resolve primitivity questions, and describe the surfaces algebraically. Second, we show that some (m, n,∞) triangle groups can not arise as Veech groups. This generalizes work of Hubert and Schmidt.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonicity of Topological Grid Graphs

In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of the usual square lattice graph of the plane. The main results are as follows. The shortness coefficient of the family of all topological grid graphs is at most 16/17. Every 3-connected topological grid graph is hamiltonian.

متن کامل

Maximum Leaf Spanning Tree Problem for Grid Graphs

The complexity of the maximum leaf spanning tree problem for grid graphs is currently unknown. We determine the maximum number of leaves in a grid graph with up to 4 rows and with 6 rows. Furthermore, we give some constructions of spanning trees of grid graphs with a large number of leaves.

متن کامل

Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs

In 2007, Arkin et al. [3] initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we pro...

متن کامل

Hamiltonian Cycles in Solid Grid Graphs

A grid graph is a nite node-induced subgraph of the innnite two-dimensional integer grid. A solid grid graph is a grid graph without holes. For general grid graphs, the Hamiltonian cycle problem is known to be NP-complete. We give a polynomial-time algorithm for the Hamiltonian cycle problem in solid grid graphs, resolving a longstanding open question posed in IPS82]. In fact, our algorithm can...

متن کامل

On Median Graphs and Median Grid Graphs on Median Graphs and Median Grid Graphs

Let e be an edge of a median graph G which is contained in exactly one 4-cycle. Then it is proved that G n e is a median graph. The converse holds as well provided that e is not contained is a subgraph isomorphic to the 3-cube minus a vertex. These results are used to give several characterizations of median grid graphs. (Grid graphs are subgraphs of complete grids, i.e. of the Cartesian produc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009