May 30, 2017 · We adapt their proof to show that for sufficiently large t the number of additive permutations on [−t, t] is greater than (3.246)2t+1 and we go ...
For example, it is shown that for sufficiently large t = 0 or 3 (mod 4), the number of split Skolem sequences of order n = 7t+3 is greater than (3:246)6t+3.
On the number of additive permutations and Skolem-type sequences · D. Donovan, M. Grannell · Published in Ars Math. Contemp. 9 November 2017 · Mathematics · Ars ...
A new relation between extended Skolem sequences (i.e., Skolem sequences with one zero element) and additive permutations is presented.
On the number of additive permutations and Skolem-type sequences ; (3.246)n ; −t,t ; (3.246)2t+1 ; t≡0 ; t≡0 ...
May 29, 2020 · On the number of additive permutations and Skolem-type sequences ; Contibutor(s). Donovan, Diane M. (author) · Grannell, Michael J. (author).
A b r h a m [2] gave a construction using additive permutations, called Skolem permutations, to determine a lower bound on the number of Skolem sequences.
People also ask
What is a permutation of a sequence?
What is the number of permutations of n different things taken r at a time while each thing may be repeated any number of times in any permutation?
Abrham and Kotzig noted in [l] that each extended Skolem sequence generates exactly one additive permutation, an extended Skolem sequence being a Skolem.
a lower bound for the number of Skolem sequences using a construction called additive permutations. He showed that if n ≡ 0, 1 mod 4, then |Sn| ≥ 2L n. 3 l ...
Oct 1, 2023 · Let m 1, m 2, n be three positive integers, m 1 < m 2 ≤ n. ... In this paper, we mainly show the existence of ( m 1, m 2 )-near-Skolem sequences ...