On an inverse problem of Erd\H os, Kleitman, and Lemke
Qinghai Zhong

TL;DR
This paper investigates the inverse problem related to tiny product-one sequences in finite groups, focusing on cyclic, dihedral, and dicyclic groups, and aims to characterize sequences lacking such subsequences.
Contribution
It provides new characterizations of long sequences without tiny product-one subsequences for specific finite groups, advancing understanding of their structural properties.
Findings
Characterized the structure of sequences over cyclic groups without tiny product-one subsequences.
Extended analysis to dihedral and dicyclic groups for both direct and inverse problems.
Determined the minimal length thresholds for the existence of tiny product-one subsequences.
Abstract
Let be a finite group and let be a nonempty sequence over . We say is a tiny product-one sequence if its terms can be ordered such that their product equals and . Let be the smallest integer such that every sequence over with has a tiny product-one subsequence. The direct problem is to obtain the exact value of , while the inverse problem is to characterize the structure of long sequences over which have no tiny product-one subsequences. In this paper, we consider the inverse problem for cyclic groups and we also study both direct and inverse problems for dihedral groups and dicyclic groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Graph theory and applications
