Introduces Wythoff-Fibonacci sequences partitioning the naturals and gives an explicit formula plus greedy generation for an almost-involution permutation q* of the non-negative integers.
Fibonacci Designs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
A Metis design is one for which v=r+k+1. This paper deals with Metis designs that are quasi-residual. The parameters of such designs and the corresponding symmetric designs can be expressed by Fibonacci numbers. Although the question of existence seems intractable because of the size of the designs, the nonexistence of corresponding difference sets can be dealt with in a substantive way. We also recall some inequalities for the number of fixed points of an automorphism of a symmetric design and suggest possible connections to the designs that would be the symmetric extensions of Metis designs.
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Wythoff-Fibonacci Sequences and a Perturbed Greedy Almost-involution
Introduces Wythoff-Fibonacci sequences partitioning the naturals and gives an explicit formula plus greedy generation for an almost-involution permutation q* of the non-negative integers.