Dan Archdeacon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Dan Archdeacon has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- C. Paul Bonnington
Monash University, Melbourne, VIC, Australia
4 shared publications - Diane Donovan
University of Queensland
2 shared publications - Emine Şule Yazıcı
Department of Mathematics, Koç University, Istanbul, Turkey
2 shared publications - Jeffrey H. Dinitz
University of Vermont
2 shared publications - Joanna A. Ellis Monaghan
Korteweg-de Vries Institute for Mathematics University of Amsterdam Science Park 105-107 1098 XH Amsterdam the Netherlands
2 shared publications - Atsuhiro Nakamoto
Faculty of Environment and Information Sciences, Yokohama National University, Yokohama, Japan
1 shared publication
Latest Publications
- 17 May 2015
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 77 (2-3) , 409-426
Square integer Heffter arrays with empty cells
- 17 May 2015
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 77 (2-3) , 409-426
Square integer Heffter arrays with empty cells
- Open Access
Square Integer Heffter Arrays with Empty Cells
A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and $iii)$ no element from $\{x,-x\}$ appears twice. Heffter arrays are useful in embedding the complete graph $K_{2nm+1}$ on an orientable surface where the embedding has the property that each edge borders exactly one $s-$cycle and one $t-$cycle. Archdeacon, Boothby and Dinitz proved that these arrays can be constructed in the case when $s=m$, i.e. every cell is filled. In this paper we concentrate on square arrays with empty cells where every row sum and every column sum is $0$ in $\mathbb{Z}$. We solve most of the instances of this case.Open AccessSquare Integer Heffter Arrays with Empty Cells
A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and $iii)$ no element from $\{x,-x\}$ appears twice. Heffter arrays are useful in embedding the complete graph $K_{2nm+1}$ on an orientable surface where the embedding has the property that each edge borders exactly one $s-$cycle and one $t-$cycle. Archdeacon, Boothby and Dinitz proved that these arrays can be constructed in the case when $s=m$, i.e. every cell is filled. In this paper we concentrate on square arrays with empty cells where every row sum and every column sum is $0$ in $\mathbb{Z}$. We solve most of the instances of this case. - Open Access
Heffter Arrays and Biembedding Graphs on Surfaces
A Heffter array is an m by n matrix with nonzero entries from Z_{2mn+1} such that i) every row and column sum to 0, and ii) no element from {x,-x} appears twice. We construct some Heffter arrays. These arrays are used to build current graphs used in topological graph theory. In turn, the current graphs are used to embed the complete graph K_{2mn+1} so that the faces can be 2-colored, called a biembedding. Under certain conditions each color class forms a cycle system. These generalize biembeddings of Steiner triple systems. We discuss some variations including Heffter arrays with empty cells, embeddings on nonorientable surfaces, complete multigraphs, and using integer in place of modular arithmetic.
Open AccessHeffter Arrays and Biembedding Graphs on Surfaces
A Heffter array is an m by n matrix with nonzero entries from Z_{2mn+1} such that i) every row and column sum to 0, and ii) no element from {x,-x} appears twice. We construct some Heffter arrays. These arrays are used to build current graphs used in topological graph theory. In turn, the current graphs are used to embed the complete graph K_{2mn+1} so that the faces can be 2-colored, called a biembedding. Under certain conditions each color class forms a cycle system. These generalize biembeddings of Steiner triple systems. We discuss some variations including Heffter arrays with empty cells, embeddings on nonorientable surfaces, complete multigraphs, and using integer in place of modular arithmetic.
- Open Access
- 20 June 2014
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 9 (1) , 51-61
Maximum genus, connectivity, and Nebeský's Theorem
Maximum genus, connectivity, and Nebeský's Theorem
- 20 June 2014
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 9 (1) , 51-61
Open AccessMaximum genus, connectivity, and Nebeský's Theorem
Maximum genus, connectivity, and Nebeský's Theorem
- Open Access
- 6 December 2013
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 366 (8) , 4491-4512
Trinity symmetry and kaleidoscopic regular maps
A cellular embedding of a connected graph (also known as a map) on an orientable surface has trinity symmetry if it is isomorphic to both its dual and its Petrie dual. A map is regular if for any two incident vertex-edge pairs there is an automorphism of the map sending the first pair onto the second. Given a map M M with all vertices of the same degree d d , for any e e relatively prime to d d the power map M e M^e is formed from M M by replacing the cyclic rotation of edges at each vertex on the surface with the e e\, th power of the rotation. A map is kaleidoscopic if all of its power maps are pairwise isomorphic. In this paper, we present a covering construction that gives infinite families of kaleidoscopic regular maps with trinity symmetry.
- 6 December 2013
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 366 (8) , 4491-4512
Open AccessTrinity symmetry and kaleidoscopic regular maps
A cellular embedding of a connected graph (also known as a map) on an orientable surface has trinity symmetry if it is isomorphic to both its dual and its Petrie dual. A map is regular if for any two incident vertex-edge pairs there is an automorphism of the map sending the first pair onto the second. Given a map M M with all vertices of the same degree d d , for any e e relatively prime to d d the power map M e M^e is formed from M M by replacing the cyclic rotation of edges at each vertex on the surface with the e e\, th power of the rotation. A map is kaleidoscopic if all of its power maps are pairwise isomorphic. In this paper, we present a covering construction that gives infinite families of kaleidoscopic regular maps with trinity symmetry.
- 9 August 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (6) , 1351-1361
Steiner Triple Systems, Pinched Surfaces, and Complete Multigraphs
- 9 August 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (6) , 1351-1361
Steiner Triple Systems, Pinched Surfaces, and Complete Multigraphs
- 16 January 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (2) , 255-266
Representing Graphs in Steiner Triple Systems
- 16 January 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (2) , 255-266
Representing Graphs in Steiner Triple Systems
- 1 October 2007
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 38 (3) , 573-594
How to Exhibit Toroidal Maps in Space
- 1 October 2007
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 38 (3) , 573-594
How to Exhibit Toroidal Maps in Space
- 7 April 2004
- Published by Wiley in Journal of Graph Theory
- Vol. 46 (3) , 207-210
Some remarks on domination
We prove a conjecture of Favaron et al. that every graph of order n and minimum degree at least three has a total dominating set of size at least n/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bound is tight, and (3) a type of bipartite domination and its relation to transversals in hypergraphs. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 207–210, 2004
- 7 April 2004
- Published by Wiley in Journal of Graph Theory
- Vol. 46 (3) , 207-210
Some remarks on domination
We prove a conjecture of Favaron et al. that every graph of order n and minimum degree at least three has a total dominating set of size at least n/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bound is tight, and (3) a type of bipartite domination and its relation to transversals in hypergraphs. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 207–210, 2004
- 1 April 2004
- Published by Elsevier in Discrete Mathematics
- Vol. 281 (1-3) , 13-25
Halin's theorem for cubic graphs on an annulus
- 1 April 2004
- Published by Elsevier in Discrete Mathematics
- Vol. 281 (1-3) , 13-25
Halin's theorem for cubic graphs on an annulus