# Difference Necklaces

@article{White2020DifferenceN, title={Difference Necklaces}, author={E. P. White and Richard K. Guy and Renate Scheidler}, journal={arXiv: Combinatorics}, year={2020} }

An $(a,b)$-difference necklace of length $n$ is a circular arrangement of the integers $0, 1, 2, \ldots , n-1$ such that any two neighbours have absolute difference $a$ or $b$. We prove that, subject to certain conditions on $a$ and $b$, such arrangements exist, and provide recurrence relations for the number of $(a,b)$-difference necklaces for $( a, b ) = ( 1, 2 )$, $( 1, 3 )$, $( 2, 3 )$ and $( 1, 4 )$. Using techniques similar to those employed for enumerating Hamiltonian cycles in certain…

## Figures and Tables from this paper

## References

SHOWING 1-10 OF 22 REFERENCES

### The Diophantine Frobenius Problem

- Mathematics
- 2006

Let X ⊂ N be a finite subset such that gcd(X) = 1. The Frobenius number of X (denoted by G(X)) is the greatest integer without an expression as a sum of elements of X. We write f(n,M) = max{G(X);…

### Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results

- MathematicsALENEX/ANALCO
- 2005

The goal of this paper is to demonstrate that, with some minor modifications, the transfer matrix technique can also be easily used to count structures in fixed height grid-cylinders and tori.

### Fibonacci Plays Billiards

- Mathematics
- 2020

A chain is an ordering of the integers 1 to n such that adjacent pairs have sums of a particular form, such as squares, cubes, triangular numbers, pentagonal numbers, or Fibonacci numbers. For…

### Enumeration of Hamiltonian Circuits in Rectangular Grids

- Mathematics
- 1996

We describe an algorithm for computing the number hm,n of Hamiltonian circuits in a rectangular grid graph consisting of m × n squares. For any fixed m, the set of Hamiltonian circuits on such graphs…

### Rational generating functions

- MathematicsGraduate Studies in Mathematics
- 2018

The theory of binomial posets developed in the previous chapter sheds considerable light on the “meaning” of generating functions and reduces certain types of enumerative problems to a routine…

### On the robustness of interconnections in random graphs: a symbolic approach

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 2002

### The On-Line Encyclopedia of Integer Sequences

- Computer ScienceElectron. J. Comb.
- 1994

The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.

### Enumerating Hamiltonian Cycles

- PhysicsElectron. J. Comb.
- 2014

A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented, and results are obtained for larger cases than previously published.

### A Matrix Method for Counting Hamiltonian Cycles on Grid Graphs

- PhysicsEur. J. Comb.
- 1994

The matrix method is used to determine the number of Hamiltonian cycles and its more generalized version, transfer-matrix method, may give easier solution to cases in which m ⩾ 6.