Skip to content

Research at St Andrews

Characterising bimodal collections of sets in finite groups

Research output: Contribution to journalArticlepeer-review

Abstract

A collection of disjoint subsets A = {A1, A2, ..., Am} of a finite abelian group has the bimodal property if each non-zero group element δ either never occurs as a difference between an element of Ai and an element of Aj with j ≠ i, or else for every element ai in Ai there is an element aj ∈ Aj for some j ≠ i with ai - aj = δ. This property arises in familiar situations, such as cosets of a fixed subgroup or in a group partition, and has applications to the construction of optimal algebraic manipulation detection codes. In this paper, we obtain a structural characterisation for bimodal collections of sets.
Close

Details

Original languageEnglish
Number of pages10
JournalArchiv der Mathematik
VolumeFirst Online
Early online date9 Jul 2019
DOIs
Publication statusE-pub ahead of print - 9 Jul 2019

    Research areas

  • Finite groups, Disjoint subsets, External differences

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Strong external difference families in abelian and non-abelian groups

    Huczynska, S., Jefferson, C. & Nepšinská, S., Mar 2021, In: Cryptography and Communications . 13, 2, p. 331–341 11 p.

    Research output: Contribution to journalArticlepeer-review

  2. Weighted external difference families and R-optimal AMD codes

    Huczynska, S. & Paterson, M., Mar 2019, In: Discrete Mathematics. 342, 3, p. 855-867

    Research output: Contribution to journalArticlepeer-review

  3. Existence and non-existence results for strong external difference families

    Huczynska, S. & Paterson, M. B., Jan 2018, In: Discrete Mathematics. 341, 1, p. 87-95

    Research output: Contribution to journalArticlepeer-review

  4. Near-complete external difference families

    Davis, J. A., Huczynska, S. & Mullen, G. L., Sep 2017, In: Designs, Codes and Cryptography. 84, 3, p. 415-424 10 p.

    Research output: Contribution to journalArticlepeer-review

  5. On well quasi-order of graph classes under homomorphic image orderings

    Huczynska, S. & Ruškuc, N., Jun 2017, In: European Journal of Combinatorics. 63, p. 164-175 12 p.

    Research output: Contribution to journalArticlepeer-review

Related by journal

  1. The intersection graph of a finite simple group has diameter at most 5

    Freedman, S. D., 13 Feb 2021, (E-pub ahead of print) In: Archiv der Mathematik. First Online, 7 p.

    Research output: Contribution to journalArticlepeer-review

  2. A note on the probability of generating alternating or symmetric groups

    Morgan, L. & Roney-Dougal, C. M., Sep 2015, In: Archiv der Mathematik. 105, 3, p. 201-204 4 p.

    Research output: Contribution to journalArticlepeer-review

  3. Finite groups are big as semigroups

    Dolinka, I. & Ruskuc, N., Sep 2011, In: Archiv der Mathematik. 97, 3, p. 209-217 9 p.

    Research output: Contribution to journalArticlepeer-review

  4. Finite 3-groups of class 3 whose elements commute with their automorphic images

    Abdollahi, A., Faghihi, A., Linton, S. A. & O'Brien, E. A., 2010, In: Archiv der Mathematik. 95, 1, p. 1-7 7 p.

    Research output: Contribution to journalArticlepeer-review

ID: 259266617

Top