English
Related papers

Related papers: Numerical and Statistical Analysis of Aliquot Sequ…

200 papers

The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic…

Number Theory · Mathematics 2014-02-26 Daniel Fiorilli

In this paper we use proof mining methods to compute rates of ($T$-)asymptotic regularity of the generalized Krasnoselskii-Mann-type iteration associated to a nonexpansive mapping $T:X\to X$ in a uniformly convex normed space $X$. For…

Optimization and Control · Mathematics 2025-01-23 Paulo Firmino , Laurentiu Leustean

We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…

Combinatorics · Mathematics 2012-02-08 Martin E. Malandro

When asymptotically analysing the summatory function of a $q$-regular sequence in the sense of Allouche and Shallit, the eigenvalues of the sum of matrices of the linear representation of the sequence determine the "shape" (in particular…

Combinatorics · Mathematics 2019-11-11 Clemens Heuberger , Daniel Krenn

In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…

Combinatorics · Mathematics 2020-12-01 Kaarel Hänni

The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential worst-case running time. In order to close the gap between…

Data Structures and Algorithms · Computer Science 2009-08-07 David Arthur , Bodo Manthey , Heiko Röglin

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

Number Theory · Mathematics 2024-11-18 Pranjal Jain , Shuo Li

We consider the problem of counting the copies of a length-$k$ pattern $\sigma$ in a sequence $f \colon [n] \to \mathbb{R}$, where a copy is a subset of indices $i_1 < \ldots < i_k \in [n]$ such that $f(i_j) < f(i_\ell)$ if and only if…

Data Structures and Algorithms · Computer Science 2025-10-27 Omri Ben-Eliezer , Slobodan Mitrović , Pranjal Srivastava

In this paper we initiate the study of computing a maximal (not necessarily maximum) repeating pattern in a single input string, where the corresponding problems have been studied (e.g., a maximal common subsequence) only in two or more…

Data Structures and Algorithms · Computer Science 2026-01-21 Mingyang Gong , Adiesha Liyanage , Braeden Sopp , Binhai Zhu

For $\eta\in S_3$, let $S_n^{\text{av}(\eta)}$ denote the set of permutations in $S_n$ that avoid the pattern $\eta$, and let $E_n^{\text{av}(\eta)}$ denote the expectation with respect to the uniform probability measure on…

Probability · Mathematics 2023-04-28 Ross G. Pinsky

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…

Combinatorics · Mathematics 2015-06-23 David Bevan

Let ${\cal H}=(q_1, \ldots q_r)$ be a finite set of coprime integers and let $n_1, n_2, \ldots$ denote the multiplicative semigroup generated by $\cal H$ and arranged in increasing order. The distribution of such sequences has been studied…

Number Theory · Mathematics 2014-01-13 Christoph Aistleitner , Istvan Berkes , Robert Tichy

Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…

Combinatorics · Mathematics 2020-08-10 Jacob Fox , Cosmin Pohoata

Let $(u(n))_{n\in\mathbb{N}}$ be an arithmetic progression of natural integers in base $b\in\mathbb{N}\setminus \{0,1\}$. We consider the following sequences: $s(n)=\overline{u(0)u(1)\cdots u(n) }^b$ formed by concatenating the first $n+1$…

Combinatorics · Mathematics 2025-08-05 Florian Luca , Bertrand Teguia Tabuguia

In the present paper, we propose and analyze a novel method for estimating a univariate regression function of bounded variation. The underpinning idea is to combine two classical tools in nonparametric statistics, namely isotonic…

Statistics Theory · Mathematics 2012-11-20 Arnaud Guyader , Nicolas Jégou , Alexander B. Németh , Sándor Z. Németh

Given a digraph $G$, we propose a new method to find the recurrence equation for the number of vertices $n_k$ of the $k$-iterated line digraph $L^k(G)$, for $k\geq0$, where $L^0(G)=G$. We obtain this result by using the minimal polynomial…

Combinatorics · Mathematics 2016-08-01 C. Dalfó , M. A. Fiol

We study the integer sequence v_n of numbers of lines in hypersurfaces of degree 2n-3 of P^n, n>1. We prove a number of congruence properties of these numbers of several different types. Furthermore, the asymptotics of the v_n are described…

Number Theory · Mathematics 2012-07-30 Daniel B. Grunberg , Pieter Moree

This work develops new results for stochastic approximation algorithms. The emphases are on treating algorithms and limits with discontinuities. The main ingredients include the use of differential inclusions, set-valued analysis, and…

Probability · Mathematics 2021-08-31 Nhu Nguyen , George Yin

In this article, $q$-regular sequences in the sense of Allouche and Shallit are analysed asymptotically. It is shown that the summatory function of a regular sequence can asymptotically be decomposed as a finite sum of periodic fluctuations…

Combinatorics · Mathematics 2025-12-02 Clemens Heuberger , Daniel Krenn

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