Papers
Topics
Authors
Recent
2000 character limit reached

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

Published 26 Feb 2020 in math.NT and math.CO | (2002.11811v1)

Abstract: Let $(G, 1_G)$ be a finite group and let $S=g_1\bdot \ldots\bdot g_{\ell}$ be a nonempty sequence over $G$. We say $S$ is a tiny product-one sequence if its terms can be ordered such that their product equals $1_G$ and $\sum_{i=1}{\ell}\frac{1}{\ord(g_i)}\le 1$. Let $\mathsf {ti}(G)$ be the smallest integer $t$ such that every sequence $S$ over $G$ with $|S|\ge t$ has a tiny product-one subsequence. The direct problem is to obtain the exact value of $\mathsf {ti}(G)$, while the inverse problem is to characterize the structure of long sequences over $G$ 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.