English
Related papers

Related papers: Log-concavity of $P$-recursive sequences

200 papers

Let $(x_n)_{n\geq0}$ be a linear recurrence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In [`The quotient…

Number Theory · Mathematics 2022-11-22 Deepa Antony , Rupam Barman

We study the higher order q- Poincar\'e and other coercive inequalities for a class probability measures satisfying Adam's regularity condition.

Functional Analysis · Mathematics 2021-06-22 Yifu Wang , Boguslaw Zegarlinski

We consider the locus of irreducible nonsingular rational curves of degree d Pn, n>2, meeting a generic collection of linear subspaces. When this locus is 0 (resp 1)- dimensional, we compute (recursively) its degree (resp. geometric genus).…

alg-geom · Mathematics 2007-05-23 Z. Ran

Let G be a finite abelian group of order n. For a complex valued function f on G, let \fht denote the Fourier transform of f. The uncertainty inequality asserts that if f \neq 0 then |supp(f)| |supp(\fht)| \geq n. Answering a question of…

Combinatorics · Mathematics 2007-05-23 Roy Meshulam

We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…

Classical Analysis and ODEs · Mathematics 2011-01-18 Ilia Krasikov

The rearrangement inequality states that the sum of products of permutations of 2 sequences of real numbers are maximized when the terms are similarly ordered and minimized when the terms are ordered in opposite order. We show that similar…

Logic · Mathematics 2024-05-03 Chai Wah Wu

An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n \geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n\geq 1}$ is uniformly distributed modulo one for…

Number Theory · Mathematics 2016-03-17 Christoph Aistleitner , Gerhard Larcher

We investigate geometric and functional inequalities for the class of log-concave probability sequences. We prove dilation inequalities for log-concave probability measures on the integers. A functional analogue of this geometric inequality…

Probability · Mathematics 2023-06-19 Arnaud Marsiglietti , James Melbourne

Let $\overline{p}(n)$ denote the overpartition funtion. Engel showed that for $n\geq2$, $\overline{p}(n)$ satisfied the Tur\'{a}n inequalities, that is, $\overline{p}(n)^2-\overline{p}(n-1)\overline{p}(n+1)>0$ for $n\geq2$. In this paper,…

Combinatorics · Mathematics 2018-08-17 Edward Y. S. Liu , Helen W. J. Zhang

We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate…

Number Theory · Mathematics 2022-09-09 Kunle Adegoke

In this present paper, we establish the log-convexity and Tur\'an type inequalities of extended $(p,q)$-beta functions. Also, we present the log-convexity, the monotonicity and Tur\'an type inequalities for extended $(p,q)$-confluent…

Classical Analysis and ODEs · Mathematics 2018-02-27 S. Mubeen , K. S. Nisar , G. Rahman , M. Arshad

A real-valued sequence $f = \{ f(n) \}_{n \in \mathbb{N}}$ is said to be second-order holonomic if it satisfies a linear recurrence $f (n + 2) = P (n) f (n + 1) + Q (n) f (n)$ for all sufficiently large $n$, where $P, Q \in \mathbb{R}(x)$…

Discrete Mathematics · Computer Science 2025-12-09 Fugen Hagihara , Akitoshi Kawamura

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Number Theory · Mathematics 2016-05-20 Sungjin Kim

We show that, for all reasonable functions $T(n)=o(n\log n)$, we can algorithmically verify whether a given one-tape Turing machine runs in time at most $T(n)$. This is a tight bound on the order of growth for the function $T$ because we…

Logic in Computer Science · Computer Science 2019-01-15 David Gajser

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

Number Theory · Mathematics 2018-10-03 Min Sha

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

Some Tur\'an type inequalities for Struve functions of the first kind are deduced by using various methods developed in the case of Bessel functions of the first and second kind. New formulas, like Mittag-Leffler expansion, infinite product…

Classical Analysis and ODEs · Mathematics 2017-07-14 Árpád Baricz , Saminathan Ponnusamy , Sanjeev Singh

Let $\{P_n\}_{n\geq 0}$ denote the Catalan-Larcombe-French sequence, which naturally came up from the series expansion of the complete elliptic integral of the first kind. In this paper, we prove the strict log-concavity of the sequence…

Combinatorics · Mathematics 2015-05-27 James J. Y. Zhao

Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and…

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