Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Discrete Mathematics and Combinatorics

Mathematics

Institution
Publication Year
Publication
Publication Type

Articles 31 - 33 of 33

Full-Text Articles in Physical Sciences and Mathematics

A Census Of Vertices By Generations In Regular Tessellations Of The Plane, Alice Paul '12, Nicholas Pippenger Apr 2011

A Census Of Vertices By Generations In Regular Tessellations Of The Plane, Alice Paul '12, Nicholas Pippenger

All HMC Faculty Publications and Research

We consider regular tessellations of the plane as infinite graphs in which q edges and q faces meet at each vertex, and in which p edges and p vertices surround each face. For 1/p + 1/q = 1/2, these are tilings of the Euclidean plane; for 1/p + 1/q < 1/2, they are tilings of the hyperbolic plane. We choose a vertex as the origin, and classify vertices into generations according to their distance (as measured by the number of edges in a shortest path) from the origin. For all p ≥ 3 and q ≥ 3 with 1/p + 1/q ≤ 1/2, we give simple combinatorial derivations of the rational generating functions for the number of vertices in each generation.


Fixing Numbers Of Graphs And Groups, Courtney Gibbons, Joshua D. Laison Jan 2009

Fixing Numbers Of Graphs And Groups, Courtney Gibbons, Joshua D. Laison

Articles

The fixing number of a graph G is the smallest cardinality of a set of vertices S such that only the trivial automorphism of G fixes every vertex in S. The fixing set of a group Γ is the set of all fixing numbers of finite graphs with automorphism group Γ. Several authors have studied the distinguishing number of a graph, the smallest number of labels needed to label G so that the automorphism group of the labeled graph is trivial. The fixing number can be thought of as a variation of the distinguishing number in which every label …


Using The Simplex Code To Construct Relative Difference Sets In 2-Groups, James A. Davis, Surinder K. Sehgal Jul 1997

Using The Simplex Code To Construct Relative Difference Sets In 2-Groups, James A. Davis, Surinder K. Sehgal

Department of Math & Statistics Faculty Publications

Relative Difference Sets with the parameters (2a, 2b, 2a, 2a-b) have been constructed many ways (see [2], [3], [5], [6], and [7] for examples). This paper modifies an example found in [1] to construct a family of relative difference sets in 2-groups that gives examples for b = 2 and b = 3 that have a lower rank than previous examples. The Simplex code is used in the construction.