English
Related papers

Related papers: On the order of indeterminate moment problems

200 papers

We study the Hausdorff moment problem for a class of sequences, namely $(r(n))_{n\in\mathbb Z_+},$ where $r$ is a rational function in the complex plane. We obtain a necessary condition for such sequence to be a Hausdorff moment sequence.…

Functional Analysis · Mathematics 2019-03-04 Md. Ramiz Reza , Genkai Zhang

We apply the theory of disconjugate linear recurrence relations to the study of irrational quantities in number theory. In particular, for an irrational number associated with solutions of three-term linear recurrence relations we show that…

Number Theory · Mathematics 2008-03-27 Angelo B. Mingarelli

This paper consists of three parts: First, letting $b_1(z)$, $b_2(z)$, $p_1(z)$ and $p_2(z)$ be nonzero polynomials such that $p_1(z)$ and $p_2(z)$ have the same degree $k\geq 1$ and distinct leading coefficients $1$ and $\alpha$,…

Complex Variables · Mathematics 2022-11-15 Yueyang Zhang

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Symbolic Computation · Computer Science 2010-05-05 Manuel Kauers , Veronika Pillwein

We give an O(n^3+n^2 t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. We also show that given a DFA accepting a language of polynomial growth, we can…

Discrete Mathematics · Computer Science 2007-12-03 Dalia Krieger , Narad Rampersad , Jeffrey Shallit

On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions $d(n)$ with growth at least $n^4$ (essentially all possible…

Group Theory · Mathematics 2018-11-22 A. Yu Olshanskii

We give a characterization of common zeros of a sequence of univariate polynomials $W_n(z)$ defined by a recurrence of order two with polynomial coefficients, and with $W_0(z)=1$. Real common zeros for such polynomials with real…

Combinatorics · Mathematics 2017-12-13 David G. L. Wang , Dannielle D. D. Jin

The first part of this paper is devoted to an analysis of moment problems in R^n with supports contained in a closed set defined by finitely many polynomial inequalities. The second part of the paper uses the representation results of…

Classical Analysis and ODEs · Mathematics 2016-09-07 Mihai Putinar , Florian-Horia Vasilescu

Consider $\{p_n\}_{n=0}^{\infty}$, a sequence of polynomials orthogonal with respect to $w(x)>0$ on $(a,b)$, and polynomials $\{g_{n,k}\}_{n=0}^{\infty},k \in \mathbb{N}_0$, orthogonal with respect to $c_k(x)w(x)>0$ on $(a,b)$, where…

Classical Analysis and ODEs · Mathematics 2021-10-27 A. S. Jooste , D. D. Tcheutia , W. Koepf

Let G be a group generated by $r$ elements $g_1,g_2,..., g_r.$ Among the reduced words in $g_1,g_2,..., g_r$ of length $n$ some, say $\gamma_n,$ represent the identity element of the group $G.$ It has been shown in a combinatorial way that…

Functional Analysis · Mathematics 2007-11-26 Ryszard Szwarc

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

Commutative Algebra · Mathematics 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Let $M$ and $N$ be fixed non-negative integer numbers and let $\pi_N$ be a polynomial of degree $N$. Suppose that $(P_n)_{n\geq0}$ and $(Q_n)_{n\geq0}$ are two orthogonal polynomial sequences such that %their derivatives of orders $k$ and…

Classical Analysis and ODEs · Mathematics 2019-06-19 K. Castillo , D. Mbouna

We generalize the result of (Witkowski, 2014) which binds orders of homogeneous, symmetric means $M,N,K \colon\mathbb{R}_+^2 \to \mathbb{R}_+$ of power growth that satisfy the invariance equation $K(M(x,y),N(x,y))=K(x,y)$ to the broader…

Classical Analysis and ODEs · Mathematics 2023-10-31 Paweł Pasteczka

A version of the second main theorem of Nevanlinna theory is proved, where the ramification term is replaced by a term depending on a certain composition operator of a meromorphic function of small hyper-order. As a corollary of this result…

Complex Variables · Mathematics 2013-07-15 Risto Korhonen

The proximal point algorithm (PPA) has been developed to solve the monotone variational inequality problem. It provides a theoretical foundation for some methods, such as the augmented Lagrangian method (ALM) and the alternating direction…

Optimization and Control · Mathematics 2023-08-16 Jingyu Gao , Xiurui Geng

To combine and query ordered data from multiple sources, one needs to handle uncertainty about the possible orderings. Examples of such "order-incomplete" data include integrated event sequences such as log entries, lists of properties…

Databases · Computer Science 2018-01-30 Antoine Amarilli , Mouhamadou Lamine Ba , Daniel Deutch , Pierre Senellart

For a class of orthogonal polynomials related to the $q$-Meixner polynomials corresponding to an indeterminate moment problem we give a one-parameter family of orthogonality measures. For these measures we complement the orthogonal…

Classical Analysis and ODEs · Mathematics 2012-10-16 Wolter Groenevelt , Erik Koelink

We consider properties of binomial series $\sum_{n=0}^\infty a_n z^{\underline{n}}$, where $z^{\underline{n}}=z(z-1)\cdots(z-n+1)$ and the convergence of binomial series in the complex domain. The order of growth of entire and meromorphic…

Complex Variables · Mathematics 2020-03-12 Katsuya Ishizaki , Zhi-Tao Wen

Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…

Optimization and Control · Mathematics 2026-02-05 Feng-Yi Liao , Lijun Ding , Yang Zheng

A polynomial algorithm is obtained for the NP-complete linear ordering problem.

Computational Complexity · Computer Science 2007-05-23 Givi Bolotashvili