English

Enumeration of idempotent-sum subsequences in finite cyclic semigroups and smooth sequences

Combinatorics 2025-05-02 v1 Number Theory

Abstract

The enumeration of zero-sum subsequences of a given sequence over finite cyclic groups is one classical topic, which starts from one question of P. Erd\H{o}s. In this paper, we consider this problem in a more general setting -- finite cyclic semigroups. Let S\mathcal{S} be a finite cyclic semigroup. By e\textbf{e} we denote the unique idempotent of the semigroup S\mathcal{S}. Let TT be a sequence over the semigroup S\mathcal{S}, and let N(T;e)N(T; \textbf{e}) be the number of distinct subsequences of TT with sum being the idempotent e\textbf{e}. We obtain the lower bound for N(T;e)N(T; \textbf{e}) in terms of the length of TT, and moreover, prove that TT contains subsequences with some smooth-structure in case that N(T;e)N(T; \textbf{e}) is not large. Our result generalizes the theorem obtained by W. Gao [Discrete Math., 1994] on the enumeration of zero-sum subsequences over finite cyclic groups to the setting of semigroups.

Keywords

Cite

@article{arxiv.2505.00486,
  title  = {Enumeration of idempotent-sum subsequences in finite cyclic semigroups and smooth sequences},
  author = {Guoqing Wang and Yang Zhao and Xingliang Yi},
  journal= {arXiv preprint arXiv:2505.00486},
  year   = {2025}
}

Comments

20 pages