English
Related papers

Related papers: Log-behavior of the root sequences of P-recursive …

200 papers

Let $\pi$ be a permutation of $[n]=\{1,\dots,n\}$ and denote by $\ell(\pi)$ the length of a longest increasing subsequence of $\pi$. Let $\ell_{n,k}$ be the number of permutations $\pi$ of $[n]$ with $\ell(\pi)=k$. Chen conjectured that the…

Combinatorics · Mathematics 2015-11-30 Miklós Bóna , Marie-Louise Lackner , Bruce Sagan

We introduce the sequence $(i_n)_{n \geq 0}$ defined by $i_n = (-1)^{inv_2(n)}$, where $inv_2(n)$ denotes the number of inversions (i.e., occurrences of 10 as a scattered subsequence) in the binary representation of n. We show that this…

Combinatorics · Mathematics 2014-08-13 Philip Lafrance , Narad Rampersad , Randy Yee

Menon's proof of the preservation of log-concavity of sequences under convolution becomes simpler when adapted to 2-sided infinite sequences. Under assumption of log-concavity of two 2-sided infinite sequences, the existence of the…

Combinatorics · Mathematics 2019-03-07 Stephan Foldes , Laszlo Major

We provide an asymptotic expansion for $\sum_{k=1}^n \left\{\sqrt{k}\right\}$. In the same spirit, we discuss the case of n-th root and it relation to special values of Riemman's zeta function.

Classical Analysis and ODEs · Mathematics 2017-06-13 Haroun Meghaichi

It is known that the $S(n,k)$ Stirling numbers as well as the ordered Stirling numbers $k!S(n,k)$ form log-concave sequences. Although in the first case there are many estimations about the mode, for the ordered Stirling numbers such…

Combinatorics · Mathematics 2015-04-28 István Mező

Given a sequence of complex square matrices, $a_n$, consider the sequence of their partial products, defined by $p_n=p_{n-1}a_{n}$. What can be said about the asymptotics as $n\to\infty$ of the sequence $f(p_n)$, where $f$ is a continuous…

Complex Variables · Mathematics 2009-01-12 Douglas Bowman , James Mc Laughlin

Given a sequence (a_k) = a_0, a_1, a_2,... of real numbers, define a new sequence L(a_k) = (b_k) where b_k = a_k^2 - a_{k-1} a_{k+1}. So (a_k) is log-concave if and only if (b_k) is a nonnegative sequence. Call (a_k) "infinitely…

Combinatorics · Mathematics 2012-02-01 Peter R. W. McNamara , Bruce E. Sagan

We consider $\ell$-log-momotonic sequences and Laguerre inequality of order two for sequences $\{a_n\}_{n \ge 0}$ such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_i(\log n)}{n^{\alpha_i}} + o\left( \frac{1}{n^{\beta}}…

Combinatorics · Mathematics 2022-06-29 Guo-Jie Li

We introduce the notion of interlacing log-concavity of a polynomial sequence $\{P_m(x)\}_{m\geq 0}$, where $P_m(x)$ is a polynomial of degree m with positive coefficients $a_{i}(m)$. This sequence of polynomials is said to be interlacing…

Combinatorics · Mathematics 2010-08-03 William Y. C. Chen , Larry X. W. Wang , Ernest X. W. Xia

Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence;…

Combinatorics · Mathematics 2007-05-23 Jason P. Bell , Stanley N. Burris , Karen A. Yeats

We consider the following question: Which real sequences (a(n)) that satisfy a linear recurrence with constant coefficients are positive for sufficiently large n? We show that the answer is negative for both (a(n)) and (-a(n)), if the…

Number Theory · Mathematics 2007-05-23 Stefan Gerhold

For an integer $q\ge2$, a $q$-recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of~$q$. In this article, $q$-recursive sequences are studied and the asymptotic behavior of their summatory…

Combinatorics · Mathematics 2024-02-28 Clemens Heuberger , Daniel Krenn , Gabriel F. Lipnik

We study the linear map sending the numerator of the rational function representing the Hilbert series of a module to that of its r-th Veronese submodule. We show that the asymptotic behaviour as r tends to infinity depends on the…

Commutative Algebra · Mathematics 2017-02-02 Adam McCabe , Gregory G. Smith

Let $\{X, X_{n}; n \geq 1\}$ be a sequence of i.i.d. non-degenerate real-valued random variables with $\mathbb{E}X^{2} < \infty$. Let $S_{n} = \sum_{i=1}^{n} X_{i}$, $n \geq 1$. Let $g(\cdot): ~[0, \infty) \rightarrow [0, \infty)$ be a…

Probability · Mathematics 2025-05-02 Deli Li , Yu Miao , Yongcheng Qi

Consider "lagged" Fibonacci sequences $a(n) = a(n-1)+a(\lfloor n/k\rfloor)$ for $k > 1$. We show that $\lim_{n\to\infty} a(kn)/a(n)\cdot\ln n/n = k\ln k$ and we demonstrate the slow numerical convergence to this limit and how to deal with…

Combinatorics · Mathematics 2009-12-15 Stephan Mertens , Stefan Boettcher

Let $\alpha \in (0,1)$ and irrational. We investigate the asymptotic behaviour of sequences of certain trigonometric products (Sudler products) $(P_N(\alpha))_{N\in\mathbb{N}}$ with $$P_N(\alpha) =\prod_{r=1}^N|2\sin(\pi r \alpha)|.$$ More…

Number Theory · Mathematics 2021-03-29 Mario Neumüller

Let $\mathcal{A}=\left(a_i\right)_{i=1}^\infty$ be a weakly increasing sequence of positive integers and let $k$ be a fixed positive integer. For an arbitrary integer $n$, the restricted partition $p_\mathcal{A}(n,k)$ enumerates all the…

Combinatorics · Mathematics 2023-05-02 Krystian Gajdzica

We show that Stieltjes moment sequences are infinitely log-convex, which parallels a famous result that (finite) P\'olya frequency sequences are infinitely log-concave. We introduce the concept of $q$-Stieltjes moment sequences of…

Combinatorics · Mathematics 2016-12-14 Yi Wang , Bao-Xuan Zhu

In the $1970$s Nicolas proved that the coefficients $p_d(n)$ defined by the generating function \begin{equation*} \sum_{n=0}^{\infty} p_d(n) \, q^n = \prod_{n=1}^{\infty} \left( 1- q^n\right)^{-n^{d-1}} \end{equation*} are log-concave for…

Combinatorics · Mathematics 2022-06-23 Bernhard Heim , Markus Neuhauser

Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…

Programming Languages · Computer Science 2022-08-31 Farzaneh Derakhshan , Stephanie Balzer