scholarly journals NORMAL NUMBERS AND COMPLETENESS RESULTS FOR DIFFERENCE SETS

2017 ◽  
Vol 82 (1) ◽  
pp. 247-257 ◽  
Author(s):  
KONSTANTINOS A. BEROS
Keyword(s):  
Ergodic Theory ◽  
Difference Sets ◽  
Normal Numbers ◽  
Real Numbers ◽  
Image Position

AbstractWe consider some natural sets of real numbers arising in ergodic theory and show that they are, respectively, complete in the classes ${\cal D}_2 \left( {{\bf{\Pi }}_3^0 } \right)$ and ${\cal D}_\omega \left( {{\bf{\Pi }}_3^0 } \right)$, that is, the class of sets which are 2-differences (respectively, ω-differences) of ${\bf{\Pi }}_3^0 $ sets.

On calculating extinction probabilities for branching processes in random environments

1969 ◽  
Vol 6 (03) ◽  
pp. 478-492 ◽  
Author(s):  
William E. Wilkinson
Keyword(s):  
Generating Functions ◽  
Infinite Sequence ◽  
Branching Processes ◽  
Transition Probability ◽  
Transition Probability Matrix ◽  
Random Environments ◽  
Real Numbers ◽  
Discrete Time Markov Chain ◽  
Extinction Probabilities ◽  
Image Position

Consider a discrete time Markov chain {Zn } whose state space is the non-negative integers and whose transition probability matrix ║Pij ║ possesses the representation where {Pr }, r = 1,2,…, is a finite or denumerably infinite sequence of non-negative real numbers satisfying , and , is a corresponding sequence of probability generating functions. It is assumed that Z 0 = k, a finite positive integer.

scholarly journals An Inhomogeneous Minimum For Non-Convex Star-Regions With Hexagonal Symmetry

1955 ◽  
Vol 7 ◽  
pp. 337-346 ◽  
Author(s):  
R. P. Bambah ◽  
K. Rogers
Keyword(s):  
Quadratic Form ◽  
Binary Quadratic Form ◽  
Elementary Geometry ◽  
Hexagonal Symmetry ◽  
Real Numbers ◽  
Inhomogeneous Minimum ◽  
Image Position ◽  
Indefinite Binary Quadratic Form

1. Introduction. Several authors have proved theorems of the following type:Let x0, y0 be any real numbers. Then for certain functions f(x, y), there exist numbers x, y such that1.1 x ≡ x0, y ≡ y0 (mod 1),and1.2 .The first result of this type, but with replaced by min , was given by Barnes (3) for the case when the function is an indefinite binary quadratic form. A generalisation of this was proved by elementary geometry by K. Rogers (6).

Inequalities related to Hardy's and Heinig's

1984 ◽  
Vol 96 (1) ◽  
pp. 1-7 ◽  
Author(s):  
James A. Cochran ◽  
Cheng-Shyong Lee
Keyword(s):  
Real Numbers ◽  
Image Position

In a 1975 paper [8], Heinig established the following three inequalities:where A = p/(p + s − λ) with p, s, λ real numbers satisfying p + s > λ,p > 0;where B = p/(2p + sp − λ −1) with p, s, λ real numbers satisfying 2p +sp > λ, + 1, p > 0;where is a sequence of nonnegative real numbers,and C = p[l + l/(p + s−λ)] with p, s, λ real numbers satisfying s > 0, p ≥ 1, and p +s > λ 0.

Analogue of a theorem of Khintchine in fields of formal power series

1966 ◽  
Vol 62 (4) ◽  
pp. 637-642 ◽  
Author(s):  
T. W. Cusick
Keyword(s):  
Power Series ◽  
Positive Constant ◽  
Classical Result ◽  
Real Numbers ◽  
Linear Forms ◽  
Absolute Value ◽  
The Difference ◽  
Image Position ◽  
Formal Power ◽  
Positive Integers

For a real number λ, ‖λ‖ is the absolute value of the difference between λ and the nearest integer. Let X represent the m-tuple (x1, x2, … xm) and letbe any n linear forms in m variables, where the Θij are real numbers. The following is a classical result of Khintchine (1):For all pairs of positive integers m, n there is a positive constant Г(m, n) with the property that for any forms Lj(X) there exist real numbers α1, α2, …, αn such thatfor all integers x1, x2, …, xm not all zero.

scholarly journals An Elementary Proof of Jin's Theorem with a Bound

10.37236/3846 ◽  
2014 ◽  
Vol 21 (2) ◽  
Author(s):  
Mauro Di Nasso
Keyword(s):  
Ergodic Theory ◽  
Elementary Proof ◽  
Nonstandard Analysis ◽  
Measure Theory ◽  
Difference Sets ◽  
Explicit Bound ◽  
Finite Set

We present a short and self-contained proof of Jin's theorem about the piecewise syndeticity of difference sets which is entirely elementary, in the sense that no use is made of nonstandard analysis, ergodic theory, measure theory, ultrafilters, or other advanced tools. An explicit bound to the number of shifts that are needed to cover a thick set is provided. Precisely, we prove the following: If $A$ and $B$ are sets of integers having positive upper Banach densities $a$ and $b$ respectively, then there exists a finite set $F$ of cardinality at most $1/ab$ such that $(A-B)+F$ covers arbitrarily long intervals.

An Extremum Result

1962 ◽  
Vol 14 ◽  
pp. 597-601 ◽  
Author(s):  
J. Kiefer
Keyword(s):  
Probability Measure ◽  
Compact Space ◽  
Ad Hoc ◽  
Continuous Functions ◽  
Orthogonality Condition ◽  
Technical Detail ◽  
Real Numbers ◽  
Discrete Probability ◽  
Linearly Independent ◽  
Image Position

The main object of this paper is to prove the following:Theorem. Let f1, … ,fk be linearly independent continuous functions on a compact space. Then for 1 ≤ s ≤ k there exist real numbers aij, 1 ≤ i ≤ s, 1 ≤ j ≤ k, with {aij, 1 ≤ i, j ≤ s} n-singular, and a discrete probability measure ε*on, such that(a) the functions gi = Σj=1kaijfj 1 ≤ i ≤ s, are orthonormal (ε*) to the fj for s < j ≤ k;(b)The result in the case s = k was first proved in (2). The result when s < k, which because of the orthogonality condition of (a) is more general than that when s = k, was proved in (1) under a restriction which will be discussed in § 3. The present proof does not require this ad hoc restriction, and is more direct in approach than the method of (2) (although involving as much technical detail as the latter in the case when the latter applies).

Unbounded Positive Definite Functions

1969 ◽  
Vol 21 ◽  
pp. 1309-1318 ◽  
Author(s):  
James Stewart
Keyword(s):  
Abelian Group ◽  
Positive Measure ◽  
Positive Definite Function ◽  
Positive Definite ◽  
Locally Compact Abelian Group ◽  
Definite Function ◽  
Complex Numbers ◽  
Stieltjes Transform ◽  
Real Numbers ◽  
Image Position

Let G be an abelian group, written additively. A complexvalued function ƒ, defined on G, is said to be positive definite if the inequality1holds for every choice of complex numbers C1, …, cn and S1, …, sn in G. It follows directly from (1) that every positive definite function is bounded. Weil (9, p. 122) and Raïkov (5) proved that every continuous positive definite function on a locally compact abelian group is the Fourier-Stieltjes transform of a bounded positive measure, thus generalizing theorems of Herglotz (4) (G = Z, the integers) and Bochner (1) (G = R, the real numbers).If ƒ is a continuous function, then condition (1) is equivalent to the condition that2

The Two-Sided Factorization of Ordinary Differential Operators

1980 ◽  
Vol 32 (5) ◽  
pp. 1045-1057 ◽  
Author(s):  
Patrick J. Browne ◽  
Rodney Nillsen
Keyword(s):  
Differential Operator ◽  
Linear Function ◽  
Bilinear Form ◽  
Differential Operators ◽  
Real Numbers ◽  
The Real ◽  
Differentiable Functions ◽  
Ordinary Differential Operators ◽  
Image Position

Throughout this paper we shall use I to denote a given interval, not necessarily bounded, of real numbers and Cn to denote the real valued n times continuously differentiable functions on I and C0 will be abbreviated to C. By a differential operator of order n we shall mean a linear function L:Cn → C of the form1.1where pn(x) ≠ 0 for x ∊ I and pi ∊ Cj 0 ≦ j ≦ n. The function pn is called the leading coefficient of L.It is well known (see, for example, [2, pp. 73-74]) thai a differential operator L of order n uniquely determines both a differential operator L* of order n (the adjoint of L) and a bilinear form [·,·]L (the Lagrange bracket) so that if D denotes differentiation, we have for u, v ∊ Cn,1.2

Rational Approximation to xn II

1980 ◽  
Vol 32 (2) ◽  
pp. 310-316 ◽  
Author(s):  
D. J. Newman ◽  
A. R. Reddy
Keyword(s):  
Rational Approximation ◽  
Real Numbers ◽  
Image Position

Introduction. In 1858 Chebyshev showed that xn+l can be approximated uniformly on [–1, 1] by polynomials of degree at most n with an error 2–n. Let 0 ≦ σ ≦ (n + l)tan2(π/2n + 2). In 1868 Zolotarev established that x n + 1σxn can be approximated uniformly on [ –1, 1] by polynomials of degree at most (n – 1) with an error 2–n(l + σ/n + l)n+1. It is interesting to note that for the case σ = 0, Zolotarev's result includes Chebyshev's result. Achieser ([1], p. 279) proved the following analogue for rational approximation. Let a0 ≠ 0, a1, a2, a3, …, an be any given real numbers. Then for every N > n,where λ is numerically the smallest root of the polynomialwith

scholarly journals Quotient polynomials with positive coefficients

2014 ◽  
Vol 98 (542) ◽  
pp. 250-255
Author(s):  
Mark B. Villarino
Keyword(s):  
Efficient Method ◽  
Theoretical Basis ◽  
Present Author ◽  
Positive Root ◽  
Real Numbers ◽  
Image Position ◽  
Positive Coefficients

In a recent paper [1] Michael Hirschhorn and the present author had to prove that the polynomialis positive for all integers n ≥ 4. We did so by writing down the identitySince all the coefficients of the quotient polynomial are positive as well as the remainder, this shows by inspection that f(n) > 0 for n ≥ 5 and computing f(4) = 12025 completes the proof. This example illustrates a useful and efficient method for proving that polynomials have strictly positive values for all real numbers exceeding a given one. We leamed this method from a paper by Chen [2], (see [3] and the references cited there), and we have subsequently used it in our own researches [1,4].We also conjectured in [1] that the theoretical basis of the method is a true theorem and the present paper is dedicated to proving this conjecture.Theorem 1: Let f(x) be a polynomial with real coefficients whose leading coefficient is positive and with at least one positive root x = a. Then there exists an x = b ≥ a such thatwhere f(b), and all the coefficients of the quotient polynomial g(x), are non-negative.

Sign in / Sign up

Export Citation Format

Share Document