A complete determination of Rabinowitsch polynomials

Let m be a positive integer and fm(x) be a polynomial of the form fm(x)=x²+x−m. We call a polynomial fm(x) a Rabinowitsch polynomial if for and consecutive integers x=x₀,x₀+1,…,x₀+s−1, |fm(x)| is either 1 or prime. In this paper, we show that there are exactly 14 Rabinowitsch polynomials fm(x).     

Max-min of polynomials and exponential diophantine equations

In this paper we study the maximum-minimum value of polynomials over the integer ring Z. In particular, we prove the following: Let F(x,y) be a polynomial over Z. Then, maxx∈Z(T)miny∈Z|F(x,y)|=o(T1/2) as T→∞ if and only if there is a positive integer B such that maxx∈Zminy∈Z|F(x,y)|?B. We then apply these results to exponential diophantine equations and obtain that: Let f(x,y), g(x,y) and G(x,y) be polynomials over Q, G(x,y)∈(Q[x,y]−Q[x])∪Q, and b a positive integer. For every α in Z, there is a y in Z such that f(α,y)+g(α,y)bG(α,y)=0 if and only if for every integer α there exists an h(x)∈Q[x] such that f(x,h(x))+g(x,h(x))bG(x,h(x))≡0, and h(α)∈Z.     

Primitive normal polynomials with a prescribed coefficient

In this paper, we established the existence of a primitive normal polynomial over any finite field with any specified coefficient arbitrarily prescribed. Let n15 be a positive integer and q a prime power. We prove that for any aF_q and any 1m<n, there exists a primitive normal polynomial f(x)=xⁿ−σ₁xⁿ⁻¹++(−1)ⁿ⁻¹σ_n−1x+(−1)ⁿσ_n such that σ_m=a, with the only exceptions σ₁≠0. The theory can be extended to polynomials of smaller degree too.     

Cyclotomic numbers and primitive idempotents in the ring GF(q)[x]/(x−1)

Let q be an odd prime power and p be an odd prime with gcd(p,q)=1. Let order of q modulo p be f, and q^f=1+pλ. Here expressions for all the primitive idempotents in the ring R_pⁿ=GF(q)[x]/(x^pn−1), for any positive integer n, are obtained in terms of cyclotomic numbers, provided p does not divide λ if n2. The dimension, generating polynomials and minimum distances of minimal cyclic codes of length pⁿ over GF(q) are also discussed.     

Continued fractions with multiple limits

For integers m2, we study divergent continued fractions whose numerators and denominators in each of the m arithmetic progressions modulo m converge. Special cases give, among other things, an infinite sequence of divergence theorems, the first of which is the classical Stern–Stolz theorem.We give a theorem on a class of Poincaré-type recurrences which shows that they tend to limits when the limits are taken in residue classes and the roots of their characteristic polynomials are distinct roots of unity.We also generalize a curious q-continued fraction of Ramanujan's with three limits to a continued fraction with k distinct limit points, k2. The k limits are evaluated in terms of ratios of certain q-series.Finally, we show how to use Daniel Bernoulli's continued fraction in an elementary way to create analytic continued fractions with m limit points, for any positive integer m2.     

Irreducibility criteria of Schur-type and Pólya-type

Let f(x)=(x-a₁)?(x-a_m){f(x)=(x-a_1)\cdots (x-a_m)}, where a ₁, . . . , a _m are distinct rational integers. In 1908 Schur raised the question whether f(x) ± 1 is irreducible over the rationals. One year later he asked whether (f(x))^2k+1{(f(x))^{2^k}+1} is irreducible for every k ≥ 1. In 1919 Pólya proved that if P(x) ? \mathbbZ[x]{P(x)\in\mathbb{Z}[x]} is of degree m and there are m rational integer values a for which 0 < |P(a)| < 2^−N N! where N=ém/2ù{N=\lceil m/2\rceil}, then P(x) is irreducible. A great number of authors have published results of Schur-type or Pólya-type afterwards. Our paper contains various extensions, generalizations and improvements of results from the literature. To indicate some of them, in Theorem 3.1 a Pólya-type result is established when the ground ring is the ring of integers of an arbitrary imaginary quadratic number field. In Theorem 4.1 we describe the form of the factors of polynomials of the shape h(x) f(x) + c, where h(x) is a polynomial and c is a constant such that |c| is small with respect to the degree of h(x) f(x). We obtain irreducibility results for polynomials of the form g(f(x)) where g(x) is a monic irreducible polynomial of degree ≤ 3 or of CM-type. Besides elementary arguments we apply methods and results from algebraic number theory, interpolation theory and diophantine approximation.     

The perfect matching polytope and solid bricks

The perfect matching polytope of a graph G is the convex hull of the set of incidence vectors of perfect matchings of G. Edmonds (J. Res. Nat. Bur. Standards Sect. B 69B 1965 125) showed that a vector x in Q^E belongs to the perfect matching polytope of G if and only if it satisfies the inequalities: (i) x0 (non-negativity), (ii) x(∂(v))=1, for all vV (degree constraints) and (iii) x(∂(S))1, for all odd subsets S of V (odd set constraints). In this paper, we characterize graphs whose perfect matching polytopes are determined by non-negativity and the degree constraints. We also present a proof of a recent theorem of Reed and Wakabayashi.     

Uniqueness and stability of regional blow-up in a porous-medium equation

We study the blow-up phenomenon for the porous-medium equation in R^N, N1, u_t=Δu^m+u^m, m>1, for nonnegative, compactly supported initial data. A solution u(x,t) to this problem blows-up at a finite time . Our main result asserts that there is a finite number of points x₁,…,x_kR^N, with |x_i−x_j|2R^* for i≠j, such that Here w_*(|x|) is the unique nontrivial, nonnegative compactly supported, radially symmetric solution of the equation in R^N and R^* is the radius of its support. Moreover u(x,t) remains uniformly bounded up to its blow-up time on compact subsets of . The question becomes reduced to that of proving that the ω-limit set in the problem consists of a single point when its initial condition is nonnegative and compactly supported.     

Taking pth Roots Modulo Polynomials over Finite Fields

In this contribution we show how to find y(x) in the polynomial equation y(x) ^p t(x) mod f(x), where t(x), y(x) and f(x) are polynomials over the field GF(p ^m). The solution of such equations are thought for in many cases, e.g., for p = 2 it is a step in the so-called Patterson Algorithm for decoding binary Goppa codes.     

Viscosity approximation to common fixed points of a nonexpansive semigroup with a generalized contraction mapping

The purpose of this paper is to introduce and construct the implicit and explicit viscosity iterative processes by a generalized contraction mapping f and a nonexpansive semigroup {T(t):t0}, and to prove that under suitable conditions these iterative processes converge strongly to a unique common fixed point of {T(t):t0} in reflexive Banach spaces which admits a weakly sequentially continuous duality mapping.     

On the structure of semi-invariant polynomials in Ore extensions

Let D be an X-outer S-derivation of a prime ring R, where S is an automorphism of R. The following is proved among other things: The degree of the minimal semi-invariant polynomial of the Ore extension R[X;S,D] is ν if charR=0, and is p^kν for some k0 if charR=p2, where ν is the least integer ν1 such that S^νDS^−ν−D is X-inner. A similar result holds for cv-polynomials. These are done by introducing the new notion of k-basic polynomials for each integer k0, which enable us to analyze semi-invariant polynomials inductively.     

Irreducibility criteria of Schur-type and Pólya-type

Let \({f(x)=(x-a_1)\cdots (x-a_m)}\), where a ₁, . . . , a _m are distinct rational integers. In 1908 Schur raised the question whether f(x) ± 1 is irreducible over the rationals. One year later he asked whether \({(f(x))^{2^k}+1}\) is irreducible for every k ≥ 1. In 1919 Pólya proved that if \({P(x)\in\mathbb{Z}[x]}\) is of degree m and there are m rational integer values a for which 0 < |P(a)| < 2^?N N! where \({N=\lceil m/2\rceil}\), then P(x) is irreducible. A great number of authors have published results of Schur-type or Pólya-type afterwards. Our paper contains various extensions, generalizations and improvements of results from the literature. To indicate some of them, in Theorem 3.1 a Pólya-type result is established when the ground ring is the ring of integers of an arbitrary imaginary quadratic number field. In Theorem 4.1 we describe the form of the factors of polynomials of the shape h(x) f(x) + c, where h(x) is a polynomial and c is a constant such that |c| is small with respect to the degree of h(x) f(x). We obtain irreducibility results for polynomials of the form g(f(x)) where g(x) is a monic irreducible polynomial of degree ≤ 3 or of CM-type. Besides elementary arguments we apply methods and results from algebraic number theory, interpolation theory and diophantine approximation.     

On the finiteness of certain Rabinowitsch polynomials II

Let m be a positive integer and f_m(x) be a polynomial of the form f_m(x)=x²+x−m. We call a polynomial f_m(x) a Rabinowitsch polynomial if for and consecutive integers is either 1 or prime. In Byeon (J. Number Theory 94 (2002) 177), we showed that there are only finitely many Rabinowitsch polynomials f_m(x) such that 1+4m is square free. In this note, we shall remove the condition that 1+4m is square free.     

On sharp Burkholder–Rosenthal-type inequalities for infinite-degree U-statistics

In this paper, we present a method that allows one to obtain a number of sharp inequalities for expectations of functions of infinite-degree U-statistics. Using the approach, we prove, in particular, the following result: Let D be the class of functions f :R₊→R₊ such that the function f(x+z)−f(x) is concave in xR₊ for all zR₊. Then the following estimate holds: for all fD and all U-statistics ∑_1i1<<ilnY_i1,…,il(X_i1,…,X_il) with nonnegative kernels Y_i1,…,il :R^l→R₊, 1i_kn; i_r≠i_s, r≠s; k,r,s=1,…,l; l=0,…,m, in independent r.v.'s X₁,…,X_n. Similar inequality holds for sums of decoupled U-statistics. The class D is quite wide and includes all nonnegative twice differentiable functions f such that the function f″(x) is nonincreasing in x>0, and, in particular, the power functions f(x)=x^t, 1<t2; the power functions multiplied by logarithm f(x)= (x+x₀)^t ln(x+x₀), 1<t<2, x₀max(e^{(3t2−6t+2)/(t(t−1)(2−t))},1); and the entropy-type functions f(x)=(x+x₀)ln(x+x₀), x₀1. As an application of the results, we determine the best constants in Burkholder–Rosenthal-type inequalities for sums of U-statistics and prove new decoupling inequalities for those objects. The results obtained in the paper are, to our knowledge, the first known results on the best constants in sharp moment estimates for U-statistics of a general type.     

Polynomials That Force a Unital Ring to be Commutative

We characterize polynomials f with integer coefficients such that a ring with unity R is necessarily commutative if f(R) = 0, in the sense that f(x) = 0 for all ${x \in R}$ . Such a polynomial must be primitive, and for primitive polynomials the condition f(R) = 0 forces R to have nonzero characteristic. The task is then reduced to considering rings of prime power characteristic and the main step towards the full characterization is a characterization of polynomials f such that R is necessarily commutative if f(R) = 0 and R is a unital ring of characteristic some power of a fixed prime p.     

Decay of geometry for Fibonacci critical covering maps of the circle

We study the growth of Dfⁿ(f(c)) when f is a Fibonacci critical covering map of the circle with negative Schwarzian derivative, degree d2 and critical point c of order ℓ>1. As an application we prove that f exhibits exponential decay of geometry if and only if ℓ2, and in this case it has an absolutely continuous invariant probability measure, although not satisfying the so-called Collet–Eckmann condition.     

On Quasi-Interpolation with Non-uniformly Distributed Centers on Domains and Manifolds

The paper studies quasi-interpolation by scaled shifts of a smooth and rapidly decaying function. The centers are images of a smooth mapping of the hZⁿ-lattice in R^s, sn, and the scaling parameters are proportional to h. We show that for a large class of generating functions the quasi-interpolants provide high order approximations up to some prescribed accuracy. Although in general the approximants do not converge as h tends to zero, the remaining saturation error is negligible in numerical computations if a scalar parameter is suitably chosen. The lack of convergence is compensated for by a greater flexibility in the choice of generating functions used in numerical methods for solving operator equations.     

Positive periodic solutions of higher-dimensional functional difference equations with a parameter

By using Krasnoselskii's fixed point theorem and upper and lower solutions method, we find some sets of positive values λ determining that there exist positive T-periodic solutions to the higher-dimensional functional difference equations of the form where A(n)=diag[a₁(n),a₂(n),…,a_m(n)], h(n)=diag[h₁(n),h₂(n),…,h_m(n)], a_j,h_j :Z→R⁺, τ :Z→Z are T -periodic, j=1,2,…,m, T1, λ>0, x :Z→R^m, f :R₊^m→R₊^m, where R₊^m={(x₁,…,x_m)^TR^m, x_j0, j=1,2,…,m}, R⁺={xR, x>0}.     

Asymptotic shape of a random polytope in a convex body

Let K be an isotropic convex body in and let Z_q(K) be the L_q-centroid body of K. For every N>n consider the random polytope K_N:=conv{x₁,…,x_N} where x₁,…,x_N are independent random points, uniformly distributed in K. We prove that a random K_N is “asymptotically equivalent” to Z_[ln(N/n)](K) in the following sense: there exist absolute constants ρ₁,ρ₂>0 such that, for all and all NN(n,β), one has:

(i) K_Nc(β)Z_q(K) for every qρ₁ln(N/n), with probability greater than 1−c₁exp(−c₂N^1−βn^β).

(ii) For every qρ₂ln(N/n), the expected mean width of K_N is bounded by c₃w(Z_q(K)).

As an application we show that the volume radius |K_N|^1/n of a random K_N satisfies the bounds for all Nexp(n).