Partial sequencings and other combinatorial aspects of large groups

arXiv:2511.19285 · math.CO, math.GR · Submitted 2025-11-24 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: I'm Ada.

Emmy: And I'm Emmy, here with Kolya.

Ada: We're looking at the paper: "Partial sequencings and other combinatorial aspects of large groups".

Emmy: Here's the gist of the paper. We prove that Anderson’s conjecture on symmetric sequencings and Bailey’s conjecture on 2-sequencings hold for sufficiently large groups In addition, we discuss extensions of partial harmonious sequences and partial R-sequencings Sequenceability Foundations The paper begins by defining a sequenceable group as one where there exists an ordering such that the partial products are all distinct Gordon proved that a finite abelian group is sequenceable if and only if it is binary Keedwell’s conjecture states that every non-abelian group of order at least 10 is sequenceable, and the authors use results from M¨uesser and Pokrovskiy to establish that all sufficiently large groups are sequenceable.

Ada: Properties of Derived Sequences The paper introduces derived sequences such as g¯i, ˇg, and ˆg based on a sequence g in G.

Emmy: Definition 3 defines symmetric sequenceable as a property involving the derived sequence where g1 “ 1G and ¯g P P1pAq such that g¯i “ g¯m´i “ 1G for all i.

Ada: It also defines R-sequenceable and harmonious properties based on similar conditions involving the derived sequences.

Paper summary: Ada: So we're looking at this paper today titled "Partial sequencings and other combinatorial aspects of large groups" by Mohammad Javaheri. Basically, the authors are tackling some big conjectures about how sequences work in large mathematical groups.

Emmy: Right, they're proving that Anderson’s conjecture on symmetric sequencings and Bailey’s conjecture on two-sequencings hold for sufficiently large groups, plus they look at extensions of partial harmonious sequences and partial R-sequencings <ref:2511.19285#pg1,that Anderson’s conjecture on symmetric sequencings and Bailey’s conjecture on>.

Kolya: So what does that actually mean for the world? It means if you pick a group that is just really big, these conjectures turn out to be true. But how big is "sufficiently large" in this context? Does it have to be orders of magnitude bigger than some specific number?

Ada: That's exactly the question I want to ask. The paper sets up the foundation by defining what a sequenceable group is—one where you can order all its elements so that the partial products are all distinct. Gordon proved that for finite abelian groups, sequenceability boils down to them being binary groups, which means they have a unique element of order two >

Emmy: And then this paper extends that idea into these more complex structures called derived sequences like g bar i and g bar m. They define symmetric sequenceable and R-sequenceable properties based on these derived sequences, essentially looking at how the structure behaves under different operations.

Kolya: So when we look at the abelian groups specifically, they show that almost all of them—every abelian group except for Z2—are doubly sequenceable, which is a stronger property than just being sequenceable >

Ada: They establish that every abelian group except Z2 is doubly sequenceable, and they also verify Conjecture three for sufficiently large groups, which covers being doubly R-sequenceable, doubly harmonious, and doubly R-harmonious for all groups with order at least four >

Emmy: That's a lot of structure being confirmed in the abelian case. Then they move into general group extensions. They prove a theorem that if you take a group made by combining another symmetric sequenceable group K with an odd group H, the resulting group G is also symmetric sequenceable >

Kolya: That’s interesting because it connects the property across different types of groups, not just abelian ones. So what about non-abelian groups? Is this work covering those too, or is it mostly focusing on the large enough condition?

Ada: They do address non-abelian groups by showing that all sufficiently large non-abelian groups are sequenceable, and they prove that all sufficiently large groups are supersequenceable >

Emmy: And looking at those results for larger groups, Corollary seven supports Bailey’s conjecture by proving that all sufficiently large groups, except for elementary two-groups of order at least four, are two-sequenceable >

Kolya: So the numbers here are important. If you're dealing with a group that's huge, like we might see in physics or some combinatorial settings, this paper suggests a lot of things about its sequenceability properties >

Ada: It really boils down to this: when the group gets large enough, these complex sequencing conjectures start holding true for almost everything, whether it’s binary groups or just any large group >

Emmy: And they also extend this idea into partial sequences. They show that if you have a partial harmonious sequence or a partial R-sequencing shorter than the whole group size, it can always be extended in a sufficiently large group that satisfies the Hall-Paige condition >

Kolya: So we've talked about what these properties mean for big groups, and now we see how these specific combinatorial structures—like partial sequences—can be built up within them. What’s the practical implication of those extensions?

Ada: It means that if you are working with a very large structure, you have more flexibility when trying to build or complete these sequences because the necessary conditions for extension are met in those large settings >

Emmy: So, looking at the title again, "Partial sequencings and other combinatorial aspects of large groups," it sounds like this paper is laying out a comprehensive map for understanding how these sequencing properties behave when you move past small, specific examples into the realm of very large mathematical structures >

Kolya: It feels like they’re showing that for sufficiently large groups, the constraints on sequenceability relax quite a bit, and most of the interesting structure is found in those larger cases >

Conclusion: Ada: So we've seen how this paper looks at sequenceability in big groups, and now we're wrapping up what it means for those concepts of partial sequences and R-sequencings.

Emmy: It really boils down to these conjectures about how these groups can be ordered so their partial products stay distinct when the group gets very large.

Kolya: The authors are showing that for groups big enough, like those with order at least four, almost all of them have these strong properties called doubly sequenceable and doubly R-sequenceable.

Ada: And they're doing this by looking at derived sequences, which are these internal structures the group has based on a single initial sequence.

Emmy: That's the algebraic side of it; they define symmetric sequenceable and R-sequenceable properties based on how those derived sequences behave across all indices.

Kolya: And for the probabilistic side, they prove that these extensions of partial harmonious sequences can always be extended in a group that is big enough and satisfies a certain condition called the Hall-Paige condition.

Ada: So what this means for us is that when we look at really massive groups, these complicated combinatorial structures aren't just theoretical; they seem to be built up consistently.

Emmy: It suggests that the structure of these large groups imposes strong constraints on their sequences, and those constraints are surprisingly permissive once the group gets big enough.

Kolya: The caveat is that we still need that group to be sufficiently large, which means there's a threshold you have to cross before these results kick in for everyone.

Ada: Exactly. So the authors are confirming that beyond a certain size, these sequences and their extensions become much more predictable than we might expect from smaller examples.

Emmy: They've also touched on extensions of R-sequencings, which is another way of looking at those same underlying structural behaviors in the group.

Kolya: The paper sets up a solid foundation for understanding how these sequencing properties behave when you move into more complex, non-abelian settings.

Ada: And it opens the door to asking what else we can extend this logic to, like partial sequences that aren't quite complete yet.

Mohammad Javaheri

Siena University, School of Science

math.CO, math.GR

Submitted: 2025-11-24

Updated: 2026-11-10

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 90/100

The gist: We prove that Anderson’s conjecture on symmetric sequencings and Bailey’s conjecture on 2-sequencings hold for sufficiently large groups In addition…

Key concepts

Sequenceable Group
A group is sequenceable if there exists an ordering of its elements such that all partial products are distinct. This property relates to the ability to order the group elements in a way that ensures unique partial products during sequential multiplication.
Symmetric Sequenceable
This property involves a derived sequence where specific conditions on the derived sequences ($ar{g}_i$) are met, ensuring that $ar{g}_i = ar{g}_{m+i}$ for all $i$. It is a condition used to define more complex sequenceability properties.
Doubly Sequenceable (DR-sequenceable)
An abelian group is doubly sequenceable if it satisfies specific conditions related to its structure. The paper proves that every abelian group except $\mathbb{Z}_2$ possesses this property, indicating a strong structural regularity in these groups.
Partial Harmonious Sequence
This concept deals with sequences shorter than the full group size. The paper shows that any partial harmonious sequence or R-sequencing shorter than $|G|$ can be extended within a sufficiently large group satisfying the Hall-Paige condition.

Terminology

Summary

We prove that Anderson’s conjecture on symmetric sequencings and Bailey’s conjecture on 2-sequencings hold for sufficiently large groups In addition, we discuss extensions of partial harmonious sequences and partial R-sequencings

Sequenceability Foundations

The paper begins by defining a sequenceable group as one where there exists an ordering such that the partial products are all distinct Gordon proved that a finite abelian group is sequenceable if and only if it is binary Keedwell’s conjecture states that every non-abelian group of order at least 10 is sequenceable, and the authors use results from M¨uesser and Pokrovskiy to establish that all sufficiently large groups are sequenceable.

Properties of Derived Sequences

The paper introduces derived sequences such as g¯i, ˇg, and ˆg based on a sequence g in G. Definition 3 defines symmetric sequenceable as a property involving the derived sequence where g1 “ 1G and ¯g P P1pAq such that g¯i “ g¯m´i “ 1G for all i. p. 1 It also defines R-sequenceable and harmonious properties based on similar conditions involving the derived sequences. p. 0

Abelian Group Results

The investigation into abelian groups shows that all abelian groups except Z2 are doubly sequenceable (DR-sequenceable). Theorem 4 proves that every abelian group except Z2 is DR-sequenceable. p. 2 p. 2 Furthermore, the paper verifies Conjecture 3 for sufficiently large groups, stating that all groups of order at least 4 are doubly sequenceable, doubly R-sequenceable, doubly harmonious, and doubly R-harmonious. p. 2

General Group Extensions

The authors prove Theorem 3 which states that if G is a group of the form KˆH where K is a symmetric sequenceable group and H is an odd group, then G is symmetric sequenceable. Theorem 4 establishes that every abelian group except Z2 is DR-sequenceable. p. 2 Finally, Theorem 6 demonstrates that all sufficiently large groups are supersequenceable. p. 2

Sufficiently Large Group Properties

Corollary 7 supports Bailey’s conjecture by proving that all sufficiently large groups, except elementary 2-groups, are 2-sequenceable. Corollary 8 supports Anderson’s conjecture by showing that all sufficiently large binary groups are symmetric sequenceable. p. 6 Corollary 10 proves that all sufficiently large groups are supersequenceable. p. 6 Theorem 6 also shows that all sufficiently large groups satisfy the Hall-Paige condition, which is a necessary condition for complete mappings. p. 1

Partial Sequence Extensions

The paper discusses extensions of partial harmonious sequences and partial R-sequencings. Lemma 12 shows that every partial harmonious sequence or partial R-sequencing shorter than |G| is extendable in a sufficiently large group G satisfying the Hall-Paige condition. Lemma 14 provides necessary and sufficient conditions for a large enough subset of a sufficiently large group to be doubly harmonious and doubly R-sequenceable. p. 8 Theorem 6 also shows that every abelian group except Z2 is doubly R-sequenceable. p. 2

Double Sequencing Results

Theorem 3 proves that if H is a nontrivial odd group, then G “ Z2ˆH is DR-sequenceable. Theorem 4 proves that every abelian group except Z2 is DR-sequenceable. The paper concludes by proving Theorem 4, stating that every abelian group except Z2 is DR-sequenceable. p. 2

Final Conclusions on Large Groups

Theorem 15 states that if G is a sufficiently large group, then G is doubly sequenceable, doubly R-sequenceable, doubly harmonious, and doubly R-harmonious. This result is supported by the fact that all sufficiently large non-abelian groups are sequenceable. p. 0 The proof relies on Lemma 14 since 2 ř G “ 0 for every finite group G. p. 8

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Precise classification of group sequenceability based on order and subgroup structure allows AI systems to predict whether a given finite group will possess certain combinatorial properties like sequenceability or 2-sequenceability without exhaustive computation for large groups.

  2. Ability to utilize results from Theorem 3, which states If G is a KˆH, where K is a symmetric sequenceable group and H is an odd group. Then G is symmetric sequenceable, enables the AI to deduce the symmetry of a direct product group based on the properties of its factors.

  3. Application of Lemma 14 allows AI systems to determine whether a subset W of a sufficiently large group G will be doubly harmonious or doubly R-sequenceable by checking if 2rW is 0.

  4. Implementation of Theorem 15 permits AI to assert that G is doubly sequenceable, doubly R-sequenceable, doubly harmonious, and doubly R-harmonious for sufficiently large groups, providing a high confidence level for these complex combinatorial structures.

  5. Use of the results supporting Corollary 7 allows AI to conclude that All sufficiently large groups, except elementary 2-groups, are 2-sequenceable, enabling efficient filtering of group candidates based on their order or Sylow structure.

  6. Integration of Theorem 4 enables AI to identify if a group G is doubly R-sequenceable by analyzing its structure when G is not binary, specifically focusing on the case where G is not binary, then G is R-sequenceable [1], hence DR-sequenceable.

  7. Utilization of Corollary 8 allows AI to verify if a sufficiently large binary group satisfies symmetric sequenceability by examining whether GZ2 is 2-sequenceable, effectively simplifying the check for this property.

  8. Incorporation of Definition 9 allows AI systems to determine if a finite group G is supersequenceable by checking if for every h P prG, Gs there exists a sequence g1,..., gm such that g “ gm and either ¯g is a sequencing or ˇg is an R-sequencing in G.

  9. Extension of Lemma 12 allows AI to predict whether a partial harmonious or R-sequencing of length k less than |W| is extendable to a full sequence, provided the group satisfies the Hall-Paige condition and certain conditions on W hold.

Related papers