James Hammer Circa Summer 2014

Publications

  1. James Hammer, Joshua Harrington, and Lenny Jones. On the congruence $x^x \equiv x \pmod{n}$. Integers, 16:Paper No. A74, 17, 2016

  2. John Asplund, Joe Chaffee, and James M. Hammer. Some bounds on the size of DI-pathological graphs. J. Combin. Math. Combin. Comput., 99:107–129, 2016

  3. John Asplund, Joe Chaffee, and James M. Hammer. Decomposition of a complete bipartite multigraph into arbitrary cycle sizes. Graphs and Combinatorics, 33(4):715–728, 2017

  4. James Hammer and Dean Hoffman. Factor pair Latin squares. Australas. J. Combin., 69:41–57, 2017

  5. Kelly B. Guest, James M. Hammer, Peter D. Johnson, and Kenneth Roblee. Regular clique assemblies, configurations, and friendship in edge-regular graphs. Tamkang J. Math., 48(4):301–320, 2017

  6. Braxton Carrigan and James Hammer. Traveling in networks with blinking node. Theory Appl. Graphs, 5(1):Art. 2, 2018

  7. John Asplund, Joe Chaffee, James Hammer, and Matt Noble. $\gamma’$-Realizability and Other Musings on Inverse Domination. Theory and Applications of Graphs, 5(1):Art 5, 7, 2018.

  8. James Hammer and John Lorch. Orthogonal factor-pair latin squares of prim-power order. Journal of Combinatorial Designs, 27(9):552-561, 2019.

  9. Graph Polynomials for a Class of DI-Pathological Graphs, joint work with Joshua Harrington. Accepted in AKCE International Journal of Graphs and Combinatorics.

  10. Odd Coverings of Subsets of the Integers, joint work with Joshua Harrington and Kristina Marotta. Accepted to the Journal of Combinatorics and Number Theory Volume 10 Issue 2.

  11. A Regional Kronecker Product and Sudoku-Pair Latin Squares, joint work with Braxton Carrigan and John Lorch. Accepted in Discrete Mathematics Volume 343 Issue 3.

  12. H-Decompositions of Generalized Johnson Graphs, joint work with Braxton Carrigan and Aaron Clark. Accepted in Congressus Numerantium.

  13. On the domination Number of Permutation Graphs and an Application to Strong Fixed Points, joint work with T. Baren, M. Cory, M. Friedberg, P. Gardner, J. Hammer, J. Harrington, D. McGinnis, R. Waechter, and T. W. H. Wong. ArXiv:1810.03409. Accepted in the journal Discrete Applied Mathematics.

  14. List colorings count rokudoku-pair squares, joint work with Braxton Carrigan, John Lorch, Robert Lorch, and Caitlin Owens. Accepted in Bull. Inst. Combin. Appl., 92:62–77, 2021.

  15. Constructing (3, b)-Sudoku pair Latin squares, joint work with Braxton Carrigan, David Diaz, John Lorch, and Robert Lorch. Accepted in the Australas. J. Combin., 82:31–58, 2022.

Articles Submitted or In Preparation

  1. Magic Sudoku-Pair Latin Squares, joint work with Braxton Carrigan and John Lorch. In preparation.

  2. Very strong proper connection number, joint work with Rey Anaya, Madeline Kohutka, Caitlin Owens, emily Robinson, and Chen Sun. In preparation.

  3. Strong proper connection number of classes of graphs, joint work with Paige Geneieve Beidelman, Johnna Farnham, Rob Lorch, Emma Miller, Jelena Mojsilovic, Jonathan Tyler Moore, and Caitlin Owens. In preparation

  4. Maximum minimum distance in latin squares, joint work with Omar Aceval, Paige Beidelman, Jieqi Di, Mitchel L. O’Connor, Caitlin Owens, and Yewen Sun. In preparation.

  5. 1-HP in cographs, joint work with Arthur Bernardo, Cameron Lee Byer, Johnna Ann Farnham, Jonathan Tyler Moore, Caitlin Owens, and Xiangyi Tao. In preparation.

OEIS Contributions

  1. Makkah Davis, James Hammer, Bob Kuo, Jordan Lenchitz, Leah S. Miller, and Boyang Su. A289849, August 2017. Cardinality of the maximal set of ordered factor pairs such that a Quasi-Factor Pair Latin Square of order n exists.

  2. Makkah Davis, James Hammer, Bob Kuo, Jordan Lenchitz, Leah S. Miller, and Boyang Su. A289812, August 2017. n for which a Factor Pair Latin Square of order n exists.

  3. N. J. A. Sloane. A006932, October 2018. Addition Exact Formula to: Number of permutations of [n] with at least one strong fixed point (a permutation p of {1,2,…,n} is said to have j as a strong fixed point if $p(k) < j$ for $k < j$ and $p(k) > j$ for $k > j$).

  4. Daniel A. McGinnis & James Hammer. A320578, October 2018. Triangle read by rows: $T(n,k)$ is the number of permutation graphs on n vertices with domination number k, with $1 \leq k \leq n$.

  5. Daniel A. McGinnis & James Hammer. A320579, October 2018. Triangle read by rows: $T(n,k)$ is the number of disconnected permutation graphs on n vertices with domination number k, with $2 \leq k \leq n$.

  6. Daniel A. McGinnis & James Hammer. A320583, October 2018. Triangle read by rows: $T(n,k)$ is the number of connected permutation graphs on n vertices with domination number k, with $1 \leq k \leq \left\lfloor \frac{n}{2} \right\rfloor$.