Related papers: The Hurt-Sada Array and Zeckendorf Representations

Inversion sequences of length $n$, $\mathbf{I}_n$, are integer sequences $(e_1, \ldots, e_n)$ with $0 \leq e_i < n$ for each $i$. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and…

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…

Let $v=2ms+t$ be a positive integer, where $t$ divides $2ms$, and let $J$ be the subgroup of order $t$ of the cyclic group $\mathbb{Z}_v$. An integer Heffter array $H_t(m,n;s,k)$ over $\mathbb{Z}_v$ relative to $J$ is an $m\times n$…

Neither the Euler-Mascheroni constant, $\gamma=0.577215...$, nor the Euler-Gompertz constant, $\delta=0.596347...$, is currently known to be irrational. However, it has been proved that at least one of them is transcendental. The two…

We consider the notion of a signed magic array, which is an $m \times n$ rectangular array with the same number of filled cells $s$ in each row and the same number of filled cells $t$ in each column, filled with a certain set of numbers…

We introduce and analyze a three-parameter family of self-referential integer sequences $S(x,y,z)$: starting from $a(1)=x$, each term advances by $y$ when the index $k$ has already appeared as a value and by $z$ otherwise. This simple rule…

In an array of random variables, each row can be regarded as a single, sequence-valued random variable. In this way, the array is seen as a sequence of sequences. Such an array is said to be row exchangeable if each row is an exchangeable…

Recently, motivated by Stanley sequences, Kiss, S\' andor and Yang introduced a new type sequence: a sequence $A$ of nonnegative integers is called an $AP_k$ - covering sequence if there exists an integer $n_0$ such that if $n > n_0$, then…

A positive linear recurrence sequence is of the form $H_{n+1} = c_1 H_n + \cdots + c_L H_{n+1-L}$ with each $c_i \ge 0$ and $c_1 c_L > 0$, with appropriately chosen initial conditions. There is a notion of a legal decomposition (roughly,…

It is highly plausible that the region of space-time far from an isolated gravitating body is, in some sense, asymptotically Minkowskian. However theoretical studies of the full nonlinear theory, initiated by Bondi et al. (1962), Sachs…

An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets…

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

By Zeckendorf's theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be written uniquely as a sum of non-adjacent…

We compute the number of irreducible linear representations of self-similar branch groups, by expressing these numbers as the co\"efficients a_n of a Dirichlet series sum a_n n^{-s}. We show that this Dirichlet series has a positive…

Harrington and Soare introduced the notion of an n-tardy set. They showed that there is a nonempty $\mathcal{E}$ property Q(A) such that if Q(A) then A is 2-tardy. Since they also showed no 2-tardy set is complete, Harrington and Soare…

The list Ramsey number $R_{\ell}(H,k)$, recently introduced by Alon, Buci\'c, Kalvari, Kuperwasser, and Szab\'o, is a list-coloring variant of the classical Ramsey number. They showed that if $H$ is a fixed $r$-uniform hypergraph that is…

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…

In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…