中文
相关论文

相关论文: Long $n$-zero-free sequences in finite cyclic grou…

200 篇论文

We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a…

组合数学 · 数学 2016-03-17 Terence Tao , Van Vu

Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…

信息论 · 计算机科学 2026-02-03 Qin Yuan , Chunlei Li , Xiangyong Zeng

A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let $k>0$ be an integer and let $[-k,k]$ denote the set of all nonzero integers between $-k$ and $k$. Let $\ell(k)$ be the smallest integer $\ell$ such that any…

组合数学 · 数学 2012-12-13 Marvin Sahs , Papa Sissokho , Jordan Torf

A sequence $\bfx=(x_1,\ldots,x_m)$ of elements of $\Z_n$ is called an \textit{$A$-weighted Davenport Z-sequence} if there exists $\bfa:=(a_1,\ldots,a_m)\in (A\cup\{0\})^m\setminus\bfzero_m$ such that $\sum_i a_ix_i=0$. Here…

数论 · 数学 2021-03-03 Niranjan Balachandran , Eshita Mazumdar

Let $G$ be a finite abelian group, and let $\eta(G)$ be the smallest integer $d$ such that every sequence over $G$ of length at least $d$ contains a zero-sum subsequence $T$ with length $|T|\in [1,\exp(G)]$. In this paper, we investigate…

数论 · 数学 2011-08-16 Yushuang Fan , Weidong Gao , Guoqing Wang , Qinghai Zhong , Jujuan Zhuang

What is the maximum number of $r$-term sums admitting rational values in $n$-element sets of irrational numbers? We determine the maximum when $r<4$ or $r\geq n/2$ and also in case when we drop the condition on the number of summands. It…

组合数学 · 数学 2025-09-25 Benjamin Móricz , Zoltán Lóránt Nagy

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

计算机科学中的逻辑 · 计算机科学 2013-08-14 Carlo A. Furia

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

数论 · 数学 2015-06-26 P. Kurlberg , C. Pomerance

Let $G$ be a finite cyclic group. Every sequence $S$ of length $l$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be…

组合数学 · 数学 2013-03-08 Jiangtao Peng , Yuanlin Li

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

数论 · 数学 2023-01-31 Luke Pebody

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

组合数学 · 数学 2013-03-08 Yuanlin Li , Jiangtao Peng

This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…

Let $G$ be a finite cyclic group of order $n \ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot ... \cdot (n_lg)$ where $g\in G$ and $n_1,..., n_l \in [1,\ord(g)]$, and the index $\ind (S)$ of $S$ is defined as…

组合数学 · 数学 2011-03-14 Weidong Gao , Yuanlin Li , Jiangtao Peng , Chris Plyley , Guoqing Wang

We study the period of the linear map $T:\mathbb{Z}_m^n\rightarrow \mathbb{Z}_m^n:(a_0,\dots,a_{n-1})\mapsto(a_0+a_1,\dots,a_{n-1}+a_0)$ as a function of $m$ and $n$, where $\mathbb{Z}_m$ stands for the ring of integers modulo $m$. Since…

数论 · 数学 2023-04-18 Bruno Dular

A sequence of integers $ \{ s_n \}_{n \in \mathbb{N}} $ is called a T-sequence if there exists a Hausdorff group topology on $ \mathbb{Z} $ such that $ \{ s_n \}_{n \in \mathbb{N}} $ converges to zero. For every finite set of primes $ S $…

群论 · 数学 2019-11-28 Saveliy Skresanov

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

数论 · 数学 2020-05-19 Arne Winterhof , Zibi Xiao

In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…

信息论 · 计算机科学 2023-12-27 Sicheng Liang , Xiangyong Zeng , Zibi Xiao , Zhimin Sun

We present a new method for proving non-holonomicity of sequences, which is based on results about the number of zeros of elementary and of analytic functions. Our approach is applicable to sequences that are defined as the values of an…

组合数学 · 数学 2007-05-23 Jason P. Bell , Stefan Gerhold , Martin Klazar , Florian Luca

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

数论 · 数学 2017-09-28 David J. Grynkiewicz

In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…

综合数学 · 数学 2021-06-03 Raouf Rajab