English
Related papers

Related papers: Completeness of exponentially increasing sequences

200 papers

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

General Mathematics · Mathematics 2025-09-16 Brahim Mittou

Let $n$ be a positive integer and let $S$ be a sequence of $n$ integers in the interval $[0,n-1]$. If there is an $r$ such that any nonempty subsequence with sum $\equiv 0$ $\pmod n$ has length $=r,$ then $S$ has at most two distinct…

Number Theory · Mathematics 2009-03-02 Weidong Gao , Y. O. Hamidoune , Guoqing Wang

Given an algebra $\mathbf{A}$, and terms $s(x_{1},x_{2},\dots x_{k})$ and $t(x_{1},x_{2},\dots x_{k})$ of the language of ${\mathbf A}$, we say that $s$ and $t$ are {\em separated} in ${\mathbf A}$ iff for all $a_{1},a_{2}\dots a_{k}\in A$,…

Logic · Mathematics 2016-01-20 David Hobby

A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such…

Combinatorics · Mathematics 2007-05-23 Gérard Cornuéjols

A PSCA$(v, t, \lambda)$ is a multiset of permutations of the $v$-element alphabet $\{0, \dots, v-1\}$ such that every sequence of $t$ distinct elements of the alphabet appears in the specified order in exactly $\lambda$ of the permutations.…

Combinatorics · Mathematics 2023-08-30 Aidan R. Gentle , Ian M. Wanless

A set is said to be \emph{3-free} if no three elements form an arithmetic progression. Given a 3-free set $A$ of integers $0=a_0<a_1<\cdots<a_t$, the \emph{Stanley sequence} $S(A)=\{a_n\}$ is defined using the greedy algorithm: For each…

Combinatorics · Mathematics 2014-08-21 David Rolnick , Praveen S. Venkataramana

We find the Ramsey number of a cycle vs. a complete graph when the order of the cycle is at least 4 times as large as the order of the complete graph. This partially confirms a conjecture of Erd\H{o}s, Faudree, Rousseau, and Schelp made in…

Combinatorics · Mathematics 2007-05-23 Vladimir Nikiforov

In \cite{[NE]} we introduce $\alpha$-expansions a real numbers in $(0,1]$, given by \[ \sum_{i=1}^{\infty}(\alpha-1)^{i-1}\alpha^{-(d_{1}+\dots+d_{i})}\] with $\alpha>1$ and $d_{i}\in\mathbb{N}$ and discuss ergodic theoretical and dimension…

Dynamical Systems · Mathematics 2026-03-31 Jörg Neunhäuserer

For $n=1,2,3,\ldots$ let $S_n$ be the sum of the first $n$ primes. We mainly show that the sequence $a_n=\root n\of{S_n/n}\ (n=1,2,3,\ldots)$ is strictly decreasing, and moreover the sequence $a_{n+1}/a_n\ (n=10,11,\ldots)$ is strictly…

Number Theory · Mathematics 2013-11-01 Zhi-Wei Sun

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

Number Theory · Mathematics 2022-08-17 Nicholas Dent , Caleb M. Shor

In the year 2000, Eric Egge introduced the generalized Terwilliger algebra $\mathcal T$ of a distance-regular graph $\Gamma$. For any vertex $x$ of $\Gamma,$ there is a surjective algebra homomorphism $\natural$ from $\mathcal T$ to the…

Combinatorics · Mathematics 2023-02-17 Nathan Nicholson

A PSCA$(v, t, \lambda)$ is a multiset of permutations of the $v$-element alphabet $\{0, \dots, v-1\}$ such that every sequence of $t$ distinct elements of the alphabet appears in the specified order in exactly $\lambda$ permutations. For $v…

Combinatorics · Mathematics 2022-10-03 Aidan R. Gentle

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Number Theory · Mathematics 2016-01-21 Vladimir Shevelev

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…

Dynamical Systems · Mathematics 2012-08-23 Nikos Frantzikinakis , Mate Wierdl

A sequence of real numbers $\{x_{n}\}_{n\in \mathbb{N}}$ is said to be $\alpha \beta$-statistically convergent of order $\gamma$ (where $0<\gamma\leq 1$) to a real number $x$ \cite{a} if for every $\delta>0,$ $$\underset{n\rightarrow…

Probability · Mathematics 2016-05-23 Pratulananda Das , Sanjoy Ghosal , Vatan Karakaya , Sumit Som

In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…

Number Theory · Mathematics 2023-05-09 José L. Cereceda

Consider $\alpha \in \Q(i)$ satisfying $|\alpha| >1$. Let $\D = \{0,1,\ldots,|a_0|-1\}$, where $a_0$ is the independent coefficient of the minimal primitive polynomial of $\alpha$. We introduce a way of expanding complex numbers in base…

Number Theory · Mathematics 2025-05-21 Lucía Rossi

An augmented happy function, $S_{[c,b]}$ maps a positive integer to the sum of the squares of its base-$b$ digits and a non-negative integer $c$. A positive integer $u$ is in a cycle of $S_{[c,b]}$ if, for some positive integer $k$,…

We define two types of the $\alpha$-Farey maps $F_{\alpha}$ and $F_{\alpha, \flat}$ for $0 < \alpha < \tfrac{1}{2}$, which were previously defined only for $\tfrac{1}{2} \le \alpha \le 1$ by R.~Natsui (2004). Then, for each $0 < \alpha <…

Dynamical Systems · Mathematics 2024-05-20 Karma Dajani , Cornelis Kraaikamp , Hitoshi Nakada , Rie Natsui

Let $\big(\mathcal{S}_n^{\alpha,\kappa,\mathfrak{r}}(z)\big)_{n=1}^\infty$ be a sequence of the largest possible integer intervals, such that…

General Mathematics · Mathematics 2020-04-09 Andrzej Bożek