English
Related papers

Related papers: On $AP_3$ - covering sequences

200 papers

Let $\mathbb{N}$ denote the set of all nonnegative integers. Let $k\ge 3$ be an integer and $A_{0} = \{a_{1}, \dots{}, a_{t}\}$ $(a_{1} < \ldots< a_{t})$ be a nonnegative set which does not contain an arithmetic progression of length $k$.…

Number Theory · Mathematics 2017-10-06 Sándor Z. Kiss , Csaba Sándor , Quan-Hui Yang

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.

Combinatorics · Mathematics 2011-03-29 An-Ping Li

An $(n,k)$ sequence covering array is a set of permutations of $[n]$ such that each sequence of $k$ distinct elements of $[n]$ is a subsequence of at least one of the permutations. An $(n,k)$ sequence covering array is perfect if there is a…

Combinatorics · Mathematics 2020-02-21 Raphael Yuster

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…

Number Theory · Mathematics 2023-01-31 Luke Pebody

For a fixed integer $k$, we define a sequence $A_k=(a_k(n))_{n\geq0}$ and a corresponding sparse subsequence $S_k$ using the cardinality of the $n$-th symmetric power of the set $\{1,2,\ldots, k\}$. For $k\in\{2,\dots,8\}$, we find…

Combinatorics · Mathematics 2024-07-23 Po-Yi Huang , Wen-Fong Ke

Let $AP_k=\{a,a+d,\ldots,a+(k-1)d\}$ be an arithmetic progression. For $\epsilon>0$ we call a set $AP_k(\epsilon)=\{x_0,\ldots,x_{k-1}\}$ an $\epsilon$-approximate arithmetic progression if for some $a$ and $d$, $|x_i-(a+id)|<\epsilon d$…

Combinatorics · Mathematics 2021-09-15 Vojtech Rödl , Marcelo Sales

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

Combinatorics · Mathematics 2010-04-13 Timothy D. LeSaulnier , Sujith Vijay

An $(n,R)$-covering sequence is a cyclic sequence whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. Using several construction methods improvements of the upper bounds on the length of such sequences for $n…

Combinatorics · Mathematics 2025-07-16 Yeow Meng Chee , Tuvi Etzion , Hoang Ta , Van Khu Vu

Given a finite nonempty sequence S of integers, write it as XY^k, where Y^k is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial…

Combinatorics · Mathematics 2014-09-17 Benjamin Chaffin , John P. Linderman , N. J. A. Sloane , Allan R. Wilks

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

In the proof of the irrationality of $\zeta(3)$ and $\zeta(2)$, Ap\'ery defined two integer sequences through $3$-term recurrences, which are known as the famous Ap\'ery numbers. Zagier, Almkvist--Zudilin and Cooper successively introduced…

Number Theory · Mathematics 2024-06-27 Ji-Cai Liu

A sequence $(a_1, \ldots, a_n)$ of nonnegative integers is an {\em ascent sequence} if $a_0 =0$ and for all $i \geq 2$, $a_i$ is at most 1 plus the number of ascents in $(a_1, \ldots, a_{i-1})$. Ascent sequences were introduced by…

Combinatorics · Mathematics 2015-03-04 Sergey Kitaev , Jeffrey Remmel

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

Number Theory · Mathematics 2021-03-19 Sándor Z. Kiss , Csaba Sándor

It is well-known that for a quickly increasing sequence $(n_k)_{k \geq 1}$ the functions $(\cos 2 \pi n_k x)_{k \geq 1}$ show a behavior which is typical for sequences of independent random variables. If the growth condition on $(n_k)_{k…

Number Theory · Mathematics 2014-03-10 Christoph Aistleitner , Katusi Fukuyama

Let $(a_n)_{n=0}^\infty$ be a second-order linear recurrence sequence with constant coefficients over the field of $p$-adic numbers $\mathbb{Q}_p$. We study the set of limit points of the sequence of consecutive ratios…

Number Theory · Mathematics 2024-06-11 Rishi Kumar

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

Combinatorics · Mathematics 2015-07-02 An-Ping Li

The Ap\'ery numbers may be defined by a cubic three-term recurrence relation, that is, a three-term relation where the coefficients are polynomials in the index of degree $3$. In this work, we first provide a systematic review of Ap\'ery…

Number Theory · Mathematics 2024-05-09 Shaun Cooper

The sequence a_1,...,a_m is a common subsequence in the set of permutations S = {p_1,...,p_k} on [n] if it is a subsequence of p_i(1),...,p_i(n) and p_j(1),...,p_j(n) for some distinct p_i, p_j in S. Recently, Beame and Huynh-Ngoc (2008)…

Combinatorics · Mathematics 2009-04-13 Paul Beame , Eric Blais , Dang-Trinh Huynh-Ngoc

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…

Number Theory · Mathematics 2020-08-11 Zhi-Wei Sun

Given a finite set of nonnegative integers A with no 3-term arithmetic progressions, the Stanley sequence generated by A, denoted S(A), is the infinite set created by beginning with A and then greedily including strictly larger integers…

Number Theory · Mathematics 2017-07-10 Richard A. Moy
‹ Prev 1 2 3 10 Next ›