English
Related papers

Related papers: On the least common multiple of shifted powers

200 papers

We prove two-sided estimates for the best (i.e., the smallest possible) constant $\,c_n(\alpha)\,$ in the Markov inequality $$ \|p_n'\|_{w_\alpha} \le c_n(\alpha) \|p_n\|_{w_\alpha}\,, \qquad p_n \in {\cal P}_n\,. $$ Here, ${\cal P}_n$…

Classical Analysis and ODEs · Mathematics 2017-11-21 Geno Nikolov , Rumen Uluchev

Let A be a finite subset of the natural numbers containing 0, and let f(n) denote the number of ways to write n in the form $\sum e_j2^j$, where $\e_j \in A$. We show that there exists a computable T = T(A) so that the sequence (f(n) mod 2)…

Number Theory · Mathematics 2011-03-01 Katherine Anders , Melissa Dennison , Bruce Reznick , Jennifer Weber

Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. The sequence $\left(f_\mathcal{A}(n)\right)…

Number Theory · Mathematics 2014-11-10 Katherine Alexander Anders

Given k>1, let a_n be the sequence defined by the recurrence a_n=c_1a_{n-1}+c_2a_{n-2}+...+c_ka_{n-k} for n>=k, with initial values a_0=a_1=...=a_{k-2}=0 and a_{k-1}= 1. We show under a couple of assumptions concerning the constants c_i…

Combinatorics · Mathematics 2014-10-28 Toufik Mansour , Mark Shattuck

Let $S_n$ be the set of all permutations of $\{1,2,\ldots,n\}$ and let $\sigma=(\sigma_1,\sigma_2,\ldots,\sigma_n)\in S_n$. The {\it initial longest increasing sequence} (ILIS) in $\sigma$ has length $m$ if, for $1\le m\le n-1$,…

Combinatorics · Mathematics 2025-10-01 Ljuben Mutafchiev

Generalizing some popular sequences like Catalan's number, Schr\"oder's number, etc, we consider the sequence $s_n$ with $s_0=1$ and for $n\ge 1$, \begin{multline*} s_n=\sum_{x_1+\dots+x_{\ell_1}=n-1} \kappa_1 s_{x_1}\dots s_{x_{\ell_1}} +…

Combinatorics · Mathematics 2024-10-25 Vuong Bui

In this paper, two new series for the logarithm of the $\Gamma$-function are presented and studied. Their polygamma analogs are also obtained and discussed. These series involve the Stirling numbers of the first kind and have the property…

Number Theory · Mathematics 2016-05-31 Iaroslav V. Blagouchine

In this paper, we introduce, for the first time, the fractional--logarithmic Laplacian \( (-\Delta)^{s+\log} \), defined as the derivative of the fractional Laplacian \( (-\Delta)^t \) at \( t=s \). It is a singular integral operator with…

Analysis of PDEs · Mathematics 2026-04-14 Huyuan Chen , Rui Chen , Daniel Hauer

In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…

Number Theory · Mathematics 2021-04-14 Boris Adamczewski , Michael Drmota , Clemens Müllner

In this paper, we prove that reduced dynamics on Collatz conjecture is periodical, and its period equals 2 to the power of the count of x/2 computation in the reduced dynamics. More specifically, if there exists reduced dynamics of x (that…

General Mathematics · Mathematics 2023-04-21 Wei Ren

For a non-integral real number $c>1$, let $\mathbb{N}_{(c)}:=\{\lfloor n^c\rfloor ~|~ n\in\mathbb{N}\}$. We show that $\mathbb{N}_{(c)}$ contains thin subbases of every order $h\geq 5$ when $1<c<2$, and $h\geq (\lfloor 2c\rfloor+1)(\lfloor…

Number Theory · Mathematics 2026-05-07 Christian Táfula

Recent work by Smagloy et al. (ISIT 2020) shows that the redundancy of a single-deletion $s$-substitution correcting code is asymptotically at least $(s+1)\log n+o(\log n)$, where $n$ is the length of the codes. They also provide a…

Information Theory · Computer Science 2020-11-24 Wentu Song , Nikita Polyanskii , Kui Cai , Xuan He

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

Number Theory · Mathematics 2025-03-06 Javier Pliego , Yu-Chen Sun , Mengdi Wang

Let $-1<\lambda<1$ and $f:[0,1)\to\mathbb{R}$ be a piecewise $\lambda$-affine map, that is, there exist points $0=c_0<c_1<\cdots <c_{n-1}<c_n=1$ and real numbers $b_1,\ldots,b_n$ such that $f(x)=\lambda x+b_i$ for every $x\in…

Dynamical Systems · Mathematics 2022-02-02 Arnaldo Nogueira , Benito Pires , Rafael A. Rosales

We identify a binary sequence $\mathcal{S}=(s_n)_{n=0}^\infty$ with the $2$-adic integer $G_\mathcal{S}(2)=\sum\limits_{n=0}^\infty s_n2^n$. In the case that $G_\mathcal{S}(2)$ is algebraic over $\mathbb{Q}$ of degree $d\ge 2$, we prove…

Number Theory · Mathematics 2025-04-15 Zhixiong Chen , Arne Winterhof

Let $L(s, \chi_1), \ldots, L(s, \chi_N)$ be primitive Dirichlet $L$-functions different from the Riemann zeta function. Under suitable hypotheses we prove that any linear combination $a_1\log|L(\rho,\chi_1)|+\dots+a_N\log|L(\rho,\chi_N)|$…

Number Theory · Mathematics 2025-04-14 Fatma Çiçek , Steven M. Gonek , Scott J. Kirila

We study the problem of constructing sequences $(x_n)_{n=1}^{\infty}$ on $[0,1]$ in such a way that $$ D_N^* = \sup_{0 \leq x \leq 1} \left| \frac{ \left\{1 \leq i \leq N: x_i \leq x \right\}}{N} - x \right|$$ is uniformly small. A result…

Combinatorics · Mathematics 2019-07-16 Stefan Steinerberger

Let $\varphi$ be the Euler's function and fix an integer $k\ge 0$. We show that, for every initial value $x_1\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+1}=\varphi(x_n)+k$ for all $n\ge 1$ is eventually…

Number Theory · Mathematics 2023-02-06 Paolo Leonetti , Florian Luca

Let a and q be coprime natural numbers. In 1944 Linnik proved that the least prime in an arithmetic progression a mod q is less then C times q to the L. Since then the admissible value for the constant L has been improved several times,…

Number Theory · Mathematics 2011-10-27 Triantafyllos Xylouris

Let $(X_n)_{n\in \mathbb{N}}$ be a sequence of i.i.d. random variables with distribution $\mathbb P(X_1=1)=\mathbb P(X_1=-1)=1/2$. Let $F(\sigma)=\sum_{n=1}^\infty X_nn^{-\sigma}$. We prove that the following holds almost surely…

Probability · Mathematics 2020-08-14 Marco Aymone , Susana Frómeta , Ricardo Misturini
‹ Prev 1 8 9 10 Next ›