Skip to content
Home
About
Copyright
Login
Search
Basic
Advanced
Search full text
Search
Field
Keyword
Content
Access
Bowdoin Department or Program
Contributor
Creator
Date
Description
Embargo End Date
Extent
Identifier
Location
Restriction End Date
Rights
Subject
Title
Condition
Must
Must not
Should
Type of search
Contain
Equal
Multi values
Regex
Range
Starts with
Ends with
Value
Value
Value
Value
Field
Keyword
Content
Access
Bowdoin Department or Program
Contributor
Creator
Date
Description
Embargo End Date
Extent
Identifier
Location
Restriction End Date
Rights
Subject
Title
Condition
Must
Must not
Should
Type of search
Contain
Equal
Multi values
Regex
Range
Starts with
Ends with
Value
Value
Value
Value
Add more criteria
Clear
Search
Previous
Back
Next
Faculty Scholarship
Higher rank lamplighter groups are graph automatic
Your browser does not support iframes.
We show that the higher rank lamplighter groups, or Diestel–Leader groups Γd(q) for d≥3, are graph automatic. This introduces a new family of graph automatic groups which are not automatic.
About this item
Creator
Sophie Bérubé
Tara Palnitkar
Jennifer Taback
Date
2018-02-15
Bowdoin Department or Program
Mathematics
Subject
(Cayley) graph automatic group
Automatic group
Diestel–Leader group
Higher rank lamplighter group
Access
Open access
Supplemental Files
Loading...
Current image, full-size
Current image, reduced-size
Other download options:
Other download options
×
Current document
Format
JPG
Max. 10 page(s)
PDF
Pages
All
Range
The defined range is higher than allowed