
The author generalizes a lemma of Arasu and Ma and applies this to obtain some necessary existence conditions for difference sets which avoid the strong technical assumption of self-conjugacy. In particular, he verifies Lander's conjecture (saying that the Sylow \(p\)-subgroup of the underlying group \(G\) cannot be cyclic if \(G\) is abelian and \(p\) divides both the group order \(v\) and the order \(n=k-\lambda\) of the difference set) for the McFarland, Spence, Davis-Jedwab and Chen families.
Lander's conjecture, Computational Theory and Mathematics, Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.), difference set, Discrete Mathematics and Combinatorics, self-conjugacy, difference sets, Theoretical Computer Science
Lander's conjecture, Computational Theory and Mathematics, Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.), difference set, Discrete Mathematics and Combinatorics, self-conjugacy, difference sets, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
