Related papers: Numerical and Statistical Analysis of Aliquot Sequ…

We give estimates for the first two moments of arithmetical sequences in progressions. Instead of using the standard approximation, we work with a generalization of Vaughan's major arcs approximation which is similar to that appearing in…

Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…

Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…

This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…

The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable powers of words gave rise to interesting and challenging problems on the structure and growth of threshold words. Over any finite alphabet with…

Let $p_n$ be the $n$th prime, and consider the sequence $s_n = (2\cdot3\cdots p_n)^{1/n} = (p_n\#)^{1/n}$, the geometric mean of the first $n$ primes. We give a short proof that $p_n/s_n \to e$, a result conjectured by Vrba (2010) and…

We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…

Let $Q_n(x)=\sum_{i=0}^{n} A_{i}x^{i}$ be a random polynomial where the coefficients $A_0,A_1,... $ form a sequence of centered Gaussian random variables. Moreover, assume that the increments $\Delta_j=A_j-A_{j-1}$, $j=0,1,2,...$ are…

We determine continuous bijections $f$, acting on a real interval into itself, whose $k$-fold iterate is the quasi-arithmetic mean of all its subsequent iterates from $f^0$ up to $f^n$ (where $0\le k\le n$). Namely, we prove that if at most…

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

We look at the rate of growth of the partial quotients of the infinite continued fraction expansion of an irrational number relative to the rate of approximation of the number by its convergents. In non-generic cases the Hausdorff dimension…

In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence…

The number of n-gram features grows exponentially in n, making it computationally demanding to compute the most frequent n-grams even for n as small as 3. Motivated by our production machine learning system built on n-gram features, we ask:…

Let $G$ be a finitely generated group equipped with a symmetric generating $% k $-tuple $S$. Let $|\cdot|$ and $V$ be the associated word length and volume growth function. Let $\nu$ be a probability measure such that $% \nu(g)\simeq…

In this note we employ infinite ergodic theory to derive estimates for the algebraic growth rate of the Poincar\'e series for a Kleinian group at its critical exponent of convergence.

In this paper, we investigate a class of tumor growth models governed by porous medium-type equations with uncertainties arisen from the growth function, initial condition, tumor support radius or other parameters in the model. We develop a…

In order to investigate multiplicative structures in additively large sets, Beiglb\"{o}ck et al. raised a significant open question as to whether or not every subset of the natural numbers with bounded gaps (syndetic set) contains…

It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.

We present a general approach to study a class of random growth models in $n$-dimensional Euclidean space. These models are designed to capture basic growth features which are expected to manifest at the mesoscopic level for several…