Polynomial Cunningham chains

A sequence of prime numbers p₁,p₂,p₃,…, such that pi=2pi−1+? for all i, is called a Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the smallest positive integer such that 2pk+? is composite, then we say the chain has length k. It is conjectured that there are infinitely many Cunningham chains of length k for every positive integer k. A sequence of polynomials f₁(x),f₂(x),… in Z[x], such that f₁(x) has positive leading coefficient, each fi(x) is irreducible in Q[x] and fi(x)=xfi−1(x)+? for all i, is defined to be a polynomial Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the least positive integer such that fk+1(x) is reducible in Q[x], then we say the chain has length k. In this article, for polynomial Cunningham chains of both kinds, we prove that there are infinitely many chains of length k and, unlike the situation in the integers, that there are infinitely many chains of infinite length, by explicitly giving infinitely many polynomials f₁(x), such that fk+1(x) is the only term in the sequence that is reducible.     

Uppers to zero in R[x] and almost principal ideals

Let R be an integral domain with quotient field K and f(x) a polynomial of positive degree in K[x]. In this paper we develop a method for studying almost principal uppers to zero ideals. More precisely, we prove that uppers to zero divisorial ideals of the form I = f(x)K[x] ∩ R[x] are almost principal in the following two cases:

• J, the ideal generated by the leading coefficients of I, satisfies J ^?1 = R.
• I ^?1 as the R[x]-submodule of K(x) is of finite type.

Furthermore we prove that for I = f(x)K[x] ∩ R[x] we have:

• I ^?1 ∩ K[x] = (I: K(x) I).
• If there exists p/q ∈ I ^?1 ? K[x], then (q, f) ≠ 1 in K[x]. If in addition q is irreducible and I is almost principal, then I′ = q(x)K[x] ∩ R[x] is an almost principal upper to zero.

Finally we show that a Schreier domain R is a greatest common divisor domain if and only if every upper to zero in R[x] contains a primitive polynomial.     

Subsequent to a theorem of Markoff

Let f(x, y) be an indefinite binary quadratic form, d(f) its discriminant, m(f) the infimum of |f(x, y)| over all integers x, y not both zero, and put $\text{μ(f) = m(f)d(f)}{}^{\mathrm{<mtext>?1</mtext><mtext>2</mtext>}}$. In this paper we prove the existence of countably many disjoint open intervals I_j contained in $\text{0 ≤ x ≤}\text{1}\text{3}$ such that there is no f with μ(f) in I_j (j = 1, 2,…) and such that for any interval I containing two intervals I_j, I_k there is an f with μ(f) in I.     

Adding machines, kneading maps, and endpoints

Given a unimodal map f, let I=[c₂,c₁] denote the core and set E={(x₀,x₁,…)∈(I,f)|xi∈ω(c,f) for all i∈N}. It is known that there exist strange adding machines embedded in symmetric tent maps f such that the collection of endpoints of (I,f) is a proper subset of E and such that limk→∞Q(k)≠∞, where Q(k) is the kneading map.We use the partition structure of an adding machine to provide a sufficient condition for x to be an endpoint of (I,f) in the case of an embedded adding machine. We then show there exist strange adding machines embedded in symmetric tent maps for which the collection of endpoints of (I,f) is precisely E. Examples of this behavior are provided where limk→∞Q(k) does and does not equal infinity, and in the case where limk→∞Q(k)=∞, the collection of endpoints of (I,f) is always E.     

On some arithmetic properties of Mahler functions

Mahler functions are power series f(x) with complex coefficients for which there exist a natural number n and an integer ? ≥ 2 such that f(x), f(x^?),..., \(f({x^{{\ell ^{n - 1}}}}),f({x^{{\ell ^n}}})\) are linearly dependent over ?(x). The study of the transcendence of their values at algebraic points was initiated by Mahler around the’ 30s and then developed by many authors. This paper is concerned with some arithmetic aspects of these functions. In particular, if f(x) satisfies f(x) = p(x)f(x^?) with p(x) a polynomial with integer coefficients, we show how the behaviour of f(x) mirrors on the polynomial p(x). We also prove some general results on Mahler functions in analogy with G-functions and E-functions.     

Copositive pointwise approximation

We prove that if a functionf ∈C ⁽¹⁾ (I),I: = [?1, 1], changes its signs times (s ∈ ?) within the intervalI, then, for everyn > C, whereC is a constant which depends only on the set of points at which the function changes its sign, andk ∈ ?, there exists an algebraic polynomialP _n =P _n (x) of degree ≤n which locally inherits the sign off(x) and satisfies the inequality $$\left| {f\left( x \right) - P_n \left( x \right)} \right| \leqslant c\left( {s,k} \right)\left( {\frac{1}{{n^2 }} + \frac{{\sqrt {1 - x^2 } }}{n}} \right)\omega _k \left( {f'; \frac{1}{{n^2 }} + \frac{{\sqrt {1 - x^2 } }}{n}} \right), x \in I$$ , where ω _k (f′;t) is thekth modulus of continuity of the functionf’. It is also shown that iff ∈C (I) andf(x) ≥ 0,x ∈I then, for anyn ≥k ? 1, there exists a polynomialP _n =P _n (x) of degree ≤n such thatP _n (x) ≥ 0,x ∈I, and |f(x) ?P _n (x)| ≤c(k)ω _k (f;n ^?2 +n ^?1 √1 ?x ²),x ∈I.     

Devaney’s chaos implies distributional chaos in a sequence

Let X be a complete metric space without isolated points, and let f:X→X be a continuous map. In this paper we prove that if f is transitive and has a periodic point of period p, then f is distributionally chaotic in a sequence. Particularly, chaos in the sense of Devaney is stronger than distributional chaos in a sequence.     

On an interpolatory product rule for evaluating Cauchy principal value integrals

Convergence results for interpolatory product rules for evaluating Cauchy principal value integrals of the form f _?1 ¹ v(x)f(x)/x ? λ dx wherev is an admissible weight function have been extended to integrals of the form f _?1 ¹ k(x)f(x)/x ? λ dx wherek is an arbitrary integrable function subject to certain conditions. Further, whereas the above convergence results were shown when the interpolation points were the Gauss points with respect to some admissible weight functionw, they are now shown to hold when the interpolation points are Radau or Lobatto points with respect tow.     

Weighted Norm Inequalities on Graphs

Let (??,??) be an infinite graph endowed with a reversible Markov kernel p and let P be the corresponding operator. We also consider the associated discrete gradient ?. We assume that ?? is doubling, a uniform lower bound for p(x,y) when p(x,y)>0, and gaussian upper estimates for the iterates of p. Under these conditions (and in some cases assuming further some Poincaré inequality) we study the comparability of (I?P)^1/2 f and ?f in Lebesgue spaces with Muckenhoupt weights. Also, we establish weighted norm inequalities for a Littlewood?CPaley?CStein square function, its formal adjoint, and commutators of the Riesz transform with bounded mean oscillation functions.     

Asymptotically stable sets and the stability of ω-limit sets

Let C be the collection of continuous self-maps of the unit interval I=[0,1] to itself. For f∈C and x∈I, let ω(x,f) be the ω-limit set of f generated by x, and following Block and Coppel, we take Q(x,f) to be the intersection of all the asymptotically stable sets of f containing ω(x,f). We show that Q(x,f) tells us quite a bit about the stability of ω(x,f) subject to perturbations of either x or f, or both. For example, a chain recurrent point y is contained in Q(x,f) if and only if there are arbitrarily small perturbations of f to a new function g that give us y as a point of ω(x,g). We also study the structure of the map Q taking (x,f)∈I×C to Q(x,f). We prove that Q is upper semicontinuous and a Baire 1 function, hence continuous on a residual subset of I×C. We also consider the map given by x?Q(x,f), and find that this map is continuous if and only if it is a constant map; that is, only when the set is a singleton.     

Polynomials and primitive roots in finite fields

The primitive elements of a finite field are those elements of the field that generate the multiplicative group of k. If f(x) is a polynomial over k of small degree compared to the size of k, then f(x) represents at least one primitive element of k. Also f(x) represents an lth power at a primitive element of k, if l is also small. As a consequence of this, the following results holds.Theorem. Let g(x) be a square-free polynomial with integer coefficients. For all but finitely many prime numbers p, there is an integer a such that g(a) is equivalent to a primitive element modulo p.Theorem. Let l be a fixed prime number and f(x) be a square-free polynomial with integer coefficients with a non-zero constant term. For all but finitely many primes p, there exist integers a and b such that a is a primitive element and f(a) ≡ b¹ modulo p.     

Estimating extreme bivariate quantile regions

When simultaneously monitoring two possibly dependent, positive risks one is often interested in quantile regions with very small probability p. These extreme quantile regions contain hardly any or no data and therefore statistical inference is difficult. In particular when we want to protect ourselves against a calamity that has not yet occurred, we need to deal with probabilities p?<?1/n, with n the sample size. We consider quantile regions of the form {(x, y)?∈?(0, ∞?)²: f(x, y)?≤?β}, where f, the joint density, is decreasing in both coordinates. Such a region has the property that it consists of the less likely points and hence that its complement is as small as possible. Using extreme value theory, we construct a natural, semiparametric estimator of such a quantile region and prove a refined form of consistency. A detailed simulation study shows the very good statistical performance of the estimated quantile regions. We also apply the method to find extreme risk regions for bivariate insurance claims.     

Ideal convergence of continuous functions

For a given ideal I⊆P(ω), IC(I) denotes the class of separable metric spaces X such that whenever is a sequence of continuous functions convergent to zero with respect to the ideal I then there exists a set of integers {m₀<m₁<?} from the dual filter F(I) such that limi→∞fmi(x)=0 for all x∈X. We prove that for the most interesting ideals I, IC(I) contains only singular spaces. For example, if I=Id is the asymptotic density zero ideal, all IC(Id) spaces are perfectly meager while if I=Ib is the bounded ideal then IC(Ib) spaces are σ-sets.     

Binding number and minimum degree for the existence of (g,f,n)-critical graphs

Let G be a graph of order p. The binding number of G is defined as $\mbox{bind}(G):=\min\{\frac{|N_{G}(X)|}{|X|}\mid\emptyset\neq X\subseteq V(G)\,\,\mbox{and}\,\,N_{G}(X)\neq V(G)\}$ . Let g(x) and f(x) be two nonnegative integer-valued functions defined on V(G) with g(x)≤f(x) for any x∈V(G). A graph G is said to be (g,f,n)-critical if G?N has a (g,f)-factor for each N?V(G) with |N|=n. If g(x)≡a and f(x)≡b for all x∈V(G), then a (g,f,n)-critical graph is an (a,b,n)-critical graph. In this paper, several sufficient conditions on binding number and minimum degree for graphs to be (a,b,n)-critical or (g,f,n)-critical are given. Moreover, we show that the results in this paper are best possible in some sense.     

Locally Adaptive Density Estimation on the Unit Sphere Using Needlets

The problem of estimating a probability density function f on the d?1-dimensional unit sphere S ^d?1 from directional data using the needlet frame is considered. It is shown that the decay of needlet coefficients supported near a point x??S ^d?1 of a function f:S ^d?1??? depends only on local H?lder continuity properties of f at?x. This is then used to show that the thresholded needlet estimator introduced in Baldi, Kerkyacharian, Marinucci, and Picard (Ann. Stat. 39, 3362?C3395, 2009) adapts to the local regularity properties of?f. Moreover, an adaptive confidence interval for f based on the thresholded needlet estimator is proposed, which is asymptotically honest over suitable classes of locally H?lderian densities.     

The circular dimension of a graph

A graph is a pair (V, I), V being the vertices and I being the relation of adjacency on V. Given a graph G, then a collection of functions {f_i}^m_n=1, each f_i mapping each vertex of V into anarc on a fixed circle, is said to define an m-arc intersection model for G if for all x,y ? V, xly ? (∨_i?m)(f_i(x)∩f_i(y)≠Ø). The circular dimension of a graph G is defined as the smallest integer m such that G has an m-arc intersection model. In this paper we establish that the maximum circular dimension of any complete partite graph having n vertices is the largest integer p such that 2^p+p?n+1.     

Periods of polynomials over a Galois ring

The period of a monic polynomial over an arbitrary Galois ring GR(pe,d) is theoretically determined by using its classical factorization and Galois extensions of rings. For a polynomial f(x) the modulo p remainder of which is a power of an irreducible polynomial over the residue field of the Galois ring, the period of f(x) is characterized by the periods of the irreducible polynomial and an associated polynomial of the form (x-1)m+pg(x). Further results on the periods of such associated polynomials are obtained, in particular, their periods are proved to achieve an upper bound value in most cases. As a consequence, the period of a monic polynomial over GR(pe,d) is equal to pe-1 times the period of its modulo p remainder polynomial with a probability close to 1, and an expression of this probability is given.     

Nonparametric mean estimation of percentage points and density function values

Let us consider a sample of sizen from a statistical population with probability density function f(x) and 100p per cent point θ_p. The functionf (x) is assumed to be of an analytic nature. This paper presents some methods for approximate nonparametric expected value estimation of θ_p and 1/f(θ _p ). These results are applicable for anyp value which is not too near 0 or 1 and alln values which are not too small. A nonparametric estimate whose expected value differs from θ _p by terms of ordern ^?7/1 can be obtained. For l/f(θ _p ), an estimate whose expected value is accurate to terms of ordern ^?3can be obtained. The estimates developed consist of linear functions of specified order statistics of the sample. The order statistics used are sample percentage points with percentage values which are near 100p. Letm be the number of order statistics appearing in an estimate (m is at most 7). Then the coefficients for the linear estimation function are obtained by solving a specified set of m linear equations inm unknowns. All the estimates presented are consistent.     

On density of interpolation points,a Kadec-type theorem,and Saff's principle of contamination inL p-approximation

Letf ∈L _p (I) and denote byB _n,p (f) the polynomial of bestL _p-approximation tof of degreen (1<p<∞,I=[?1,1], the norm is weightedL _p-norm with an arbitrary positive weight). Extending a result proved by Saff and Shekhtman forp=2 we show that for every 1<p<∞ andf ∈L _p (I) (not a polynomial) points of sign change of the error functionf-B _n,p (f) are dense inI asn→∞.