中文
相关论文

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

200 篇论文

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

组合数学 · 数学 2019-03-21 Christian Elsholtz , Péter Pál Pach

In this paper we study the sequences defined by the last and the last non-zero digits of $n^n$ in base $b$. For the sequence given by the last digits of $n^n$ in base $b$, we prove its periodicity using different techniques than those used…

数论 · 数学 2012-03-20 José María Grau , Antonio M. Oller-Marcén

We consider a variant on the Tetranacci sequence, where one adds the previous four terms, then divides the sum by two until the result is odd. We give an algorithm for constructing "initially division-poor" sequences, where over an initial…

A finite group is said to be $n$-cyclic if it contains $n$ cyclic subgroups. For a finite group $G$, the ratio of the number of cyclic subgroups to the number of subgroups is known as the cyclicity degree of the group $G$ and is denoted by…

组合数学 · 数学 2026-03-11 Khyati Sharma , A. Satyanarayana Reddy

We construct, for every integer $N\in\mathbb{N}^*$, a structure whose Grothendieck ring is isomorphic to $(\mathbb{Z}/N\mathbb{Z})[X]$, thus proving the existence of structures with a non-zero Grothendieck ring with non-zero characteristic.…

逻辑 · 数学 2020-11-03 Esther Elbaz

Upper and lower bounds on the largest number of weights in a cyclic code of given length, dimension and alphabet are given. An application to irreducible cyclic codes is considered. Sharper upper bounds are given for the special cyclic…

信息论 · 计算机科学 2018-11-16 Minjia Shi , Xiaoxiao Li , Alessandro Neri , Patrick Solé

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes, namely the factorization conjecture and the triangle conjecture,…

形式语言与自动机理论 · 计算机科学 2024-04-30 Clelia De Felice

We extend a result of Bump et al. to show that a large family of Sheffer sequences has their zeros - up to perhaps a finite number of exceptions - on a vertical line. We connect a particular such sequence to the Riemann zeta function via a…

数论 · 数学 2025-08-26 G. -S. Cheon , T. Forgács , K. Tran

In this paper we establish connections between covers of $\mathbb Z$ by residue classes and subset sums in a field. Suppose that $A_0=\{a_s(n_s)\}_{s=0}^k$ covers each integer at least $p$ times with the residue class…

数论 · 数学 2020-08-11 Zhi-Wei Sun

The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…

信息论 · 计算机科学 2016-02-12 Kai-Uwe Schmidt

Let $G$ be an additive finite abelian group, and let $\mathrm{disc}(G)$ denote the smallest positive integer $t$ with the property that every sequence $S$ over $G$ with length $|S|\geq t $ contains two nonempty zero-sum subsequences of…

组合数学 · 数学 2025-10-17 Wanzhen Hui , Xue Li

This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…

数论 · 数学 2024-04-10 Ajai Choudhry , Bibekananda Maji

This letter presents a direct construction of cross Z-complementary sequence sets (CZCSSs), whose aperiodic correlation sums exhibit zero correlation zones at both the front-end and tail-end shifts. CZCSS can be regarded as an extension of…

信息论 · 计算机科学 2022-07-07 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…

数论 · 数学 2018-07-24 Andrew N. W. Hone , L. Edson Jeffery , Robert G. Selcoe

This paper discusses the location of zeros of polynomials in a polynomial sequence $\{P_n(z)\}$ generated by a three-term recurrence relation of the form $P_n(z)+ B(z)P_{n-1}(z) +A(z) P_{n-k}(z)=0$ with $k>2$ and the standard initial…

复变函数 · 数学 2020-10-21 Innocent Ndikubwayo

If F is a free group of finite rank at least two then any group of the form F by Z is large. In this short note we show how this statement follows by combining a very recent theorem of Hagen and Wise (using work of Agol and of Wise) with…

群论 · 数学 2013-11-15 J. O. Button

A positive integer $n$ is defined to be cyclic if and only if every group of size $n$ is cyclic. Equivalently, $n$ is cyclic if and only if $n$ is relatively prime to the number of positive integers less than $n$ that are relatively prime…

数论 · 数学 2025-08-13 Joel E. Cohen

Cameron introduced a bijection between the set of sum-free sets and the set of all zero-one sequences. In this paper, we study the sum-free sets of natural numbers corresponding to certain zero-one sequences which contain the Cantor-like…

数论 · 数学 2015-05-13 Zhi-Xiong Wen , Wen Wu , Jie-Meng Zhang

Generalizing the classical result of Bohr, we show that if an n-variable power series converges in an n-circular bounded complete domain D and its sum has modulus less than 1, then the sum of the maximum of the moduli of the terms is less…

复变函数 · 数学 2007-05-23 Lev Aizenberg

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

逻辑 · 数学 2023-11-08 Robert Goldblatt