Papers
Topics
Authors
Recent
Search
2000 character limit reached

$1$-product problems with congruence conditions in nonabelian groups

Published 31 Mar 2020 in math.CO | (2003.14007v1)

Abstract: Let $G$ be a finite group and $D_{2n}$ be the dihedral group of $2n$ elements. For a positive integer $d$, let $\mathsf{s}{d\mathbb{N}}(G)$ denote the smallest integer $\ell\in \mathbb{N}_0\cup {+\infty}$ such that every sequence $S$ over $G$ of length $|S|\geq \ell$ has a nonempty $1$-product subsequence $T$ with $|T|\equiv 0$ (mod $d$). In this paper, we mainly study the problem for dihedral groups $D{2n}$ and determine their exact values: $\mathsf{s}{d\mathbb{N}}(D{2n})=2d+\lfloor log_2n\rfloor$, if $d$ is odd with $n|d$; $\mathsf{s}{d\mathbb{N}}(D{2n})=nd+1$, if $gcd(n,d)=1$. Furthermore, we also analysis the problem for metacyclic groups $C_p\ltimes_s C_q$ and obtain a result: $\mathsf{s}_{kp\mathbb{N}}(C_p\ltimes_s C_q)=lcm(kp,q)+p-2+gcd(kp,q)$, where $p\geq 3$ and $p|q-1$.

Summary

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.