Related papers: On the Longest Increasing Subsequence for Finite a…

It is our aim to establish a general analytic theory of asymptotic expansions of type f(x)=a_1 phi_1(x)+dots+ a_n phi_n(x)+o(phi_n(x)), x tends to x_0 (*), where the given ordered n-tuple of real-valued functions phi_1 dots,phi_n forms an…

A Liouville function is a complex analytic function H with a Taylor series \sum_{n=1}^{\infty} x^n/a_n such the a_n's form a ``very fast growing'' sequence of integers. In this paper we exhibit the complete first-order theory of the complex…

Let $\mathcal{T}$ be a collection of 3-element subsets $S$ of $\{1, \ldots,n\}$ with the property that if $i<j<k$ and $a<b<c$ are two 3-element subsets in $S$, then there exists an integer sequence $x_1 < x_2 < \cdots < x_n$ such that $x_i,…

We consider several coding discretizations of continuous functions which reflect their variation at some given precision. We study certain statistical and combinatorial properties of the sequence of finite words obtained by coding a typical…

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is characterized by the fact that two successive random…

We provide several asymptotic expansions of the prime counting function $\pi(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly…

Consider the set of those binary words with no non-empty factors of the form $xxx^R$. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the…

The paper studies asymptotic behavior of the loss probability for the $GI/M/m/n$ queueing system as $n$ increases to infinity. The approach of the paper is based on applications of classic results of Tak\'acs (1967) and the Tauberian…

A hyperbinary expansion of a positive integer n is a partition of n into powers of 2 in which each part appears at most twice. In this paper, we consider a generalization of this concept and a certain statistic on the corresponding set of…

Let $S_n$ be the symmetric group of $n$ letters; Landau considered the function $g(n)$ defined as the maximal order of an element of $S_n$. This function is non-decreasing. Let us define the sequence $n_1=1, n_2=2, n_3=3, n_4=4,n_5=5,n_6=7,…

Let $\beta > 1$ be a real number and $x \in [0,1)$ be an irrational number. Denote by $k_n(x)$ the exact number of partial quotients in the continued fraction expansion of $x$ given by the first $n$ digits in the $\beta$-expansion of $x$…

In this paper we define a new type of continued fraction expansion for a real number $x \in I_m:=[0,m-1], m\in N_+, m\geq 2$: \[x = \frac{m^{-b_1(x)}}{\displaystyle 1+\frac{m^{-b_2(x)}}{1+\ddots}}:=[b_1(x), b_2(x), ...]_m. \] Then, we…

Given a sequence \xi_1, \xi_2,... of X-valued, exchangeable random elements, let q(\xi^(n)) and p_m(\xi^(n)) stand for posterior and predictive distribution, respectively, given \xi^(n) = (\xi_1,..., \xi_n). We provide an upper bound for…

For a widely used hub-and-spoke closed product-form network consisting of an infinite-server node and several single-server queues, we characterize the maximum queue-length distribution in various operational regimes by leveraging a novel…

The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given…

The authors consider the length, $l_N$, of the length of the longest increasing subsequence of a random permutation of $N$ numbers. The main result in this paper is a proof that the distribution function for $l_N$, suitably centered and…

We give an exposition of Schensted's algorithm to find the length of the longest increasing subword of a word in an ordered alphabet, and Greene's generalization of Schensted's results using Knuth equivalence. We announce a generalization…

Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…

For the discrete memoryless sources with a countably infinite alphabet, we prove that for any positive integer $k$, there exists a corresponding probability interval such that if the largest symbol probability $p_{1}$ falls in this…

We investigate the order of the variance of the optimal alignments score of two independent iid binary random words having the same length. The letters are equiprobable, but the scoring function is such that one letter has a larger score…