English
Related papers

Related papers: Note on polynomial recurrence

200 papers

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

Number Theory · Mathematics 2011-11-24 Lola Thompson

This work is a continuation of [Kalikaeva, MPRF, 23(2):225-240]. The object of study is ``Markov-up processes'' on $\mathbb Z_+$ and the moment of downcrossing a certain barrier. The processes considered in this paper differ from Markov…

Probability · Mathematics 2024-07-01 Diana Kalikaeva

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

Classical Analysis and ODEs · Mathematics 2019-09-24 Tamás Erdélyi

We study the monic orthogonal polynomials with respect to a singularly perturbed Airy weight. By using Chen and Ismail's ladder operator approach, we derive a discrete system satisfied by the recurrence coefficients for the orthogonal…

Classical Analysis and ODEs · Mathematics 2024-03-28 Chao Min , Yuan Cheng

Orthogonal polynomials on the unit circle are completely determined by their reflection coefficients through the Szeg\H{o} recurrences. We assume that the reflection coefficients converge to some complex number a with 0 < |a| < 1. The…

Classical Analysis and ODEs · Mathematics 2016-09-06 Leonid B. Golinskii , Paul G. Nevai , Walter Van Assche

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

Commutative Algebra · Mathematics 2012-10-25 William Messing , Victor Reiner

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

Algebraic Geometry · Mathematics 2008-04-15 Gennadiy Averkov

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

We prove that multiple-recurrence and polynomial-recurrence of invertible infinite measure preserving transformations are both properties which pass to extensions.

Dynamical Systems · Mathematics 2009-03-11 Tom Meyerovitch

Here we have studied on the ideas of $g_{\mu_i}$ and $\lambda_{\mu_i}$-closed sets with respect to ${\mu_j}(i,j=1,2,i\not=j)$ and pairwise $ \lambda $-closed sets in a generalized bitopological space $ (X,\mu_1, \mu_2) $. We have also…

General Topology · Mathematics 2018-10-15 Amar Kumar Banerjee , Jagannath Pal

Let S(n,0) be the set of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ denote by $|p|_{0}$ the distance from the origin to the zero set of $p'$. We…

Complex Variables · Mathematics 2007-05-23 Julius Borcea

We consider polynomials in R[x] which map the set of nonnegative (element-wise) matrices of a given order into itself. Let n be a positive integer and define P(n)= {p in R[x] : p(A) is nonnegative (element-wise), for all A, A an n-by-n…

Rings and Algebras · Mathematics 2022-02-02 Raphael Loewy

We give a global version of Le-Ramanujam mu-constant theorem for polynomials. Let f_t, (t in [0,1]), be a family of polynomials of n complex variables with isolated singularities, whose coefficients are polynomials in t. We consider the…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Bodin

A recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm…

High Energy Physics - Lattice · Physics 2007-05-23 C. Gebert , I. Montvay

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

Combinatorics · Mathematics 2026-02-25 Thomas Karam

We study experimentally systems of orthogonal polynomials with respect to self-similar measures. When the support of the measure is a Cantor set, we observe some interesting properties of the polynomials, both on the Cantor set and in the…

Classical Analysis and ODEs · Mathematics 2009-10-06 Steven M. Heilman , Philip Owrutsky , Robert S. Strichartz

In this article, a relation between a gap $d_{k}$ and divisors of composite numbers between $p_{k}$ and $p_{k+1}$ is established.

General Mathematics · Mathematics 2011-09-13 Hisanobu Shinya

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

Mathematical Physics · Physics 2007-05-23 Franz Peherstorfer

Let $\Gamma$ be a subset of $\{0,1,2,...\}$. We show that if $\Gamma$ has `gaps' then the completeness and frame properties of the system $\{t^ke^{2\pi i nt}: n\in\mathbb{Z},k\in\Gamma\}$ differ from those of the classical exponential…

Classical Analysis and ODEs · Mathematics 2023-04-11 Aleksei Kulikov , Alexander Ulanovskii , Ilya Zlotnikov

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha
‹ Prev 1 3 4 5 6 7 10 Next ›