Differences, Derivatives, and Decreasing Rearrangements

1967 ◽  
Vol 19 ◽  
pp. 1153-1178 ◽  
Author(s):  
G. F. D. Duff

The decreasing rearrangement of a finite sequence a1, a2, … , an of real numbers is a second sequence aπ(1), aπ(2), … , aπ(n), where π(l), π(2), … , π(n) is a permutation of 1, 2, … , n and(1, p. 260). The kth term of the rearranged sequence will be denoted by . Thus the terms of the rearranged sequence correspond to and are equal to those of the given sequence ak, but are arranged in descending (non-increasing) order.

1986 ◽  
Vol 102 (3-4) ◽  
pp. 277-289 ◽  
Author(s):  
Avner Friedman ◽  
Bryce McLeod

SynopsisIt is well known that iff,g,hare nonnegative functions andf*,g*,h* their symmetrically decreasing rearrangements, thenalso ifu* is a spherically decreasing rearrangement of a functionu,In this paper it is proved under suitable assumptions (including the assumption thathis already rearranged) that equality holds in (i) if and only iffandgare already rearranged, and, if 1 <p< ∞ equality holds in (ii) if and only ifuis already rearranged. We discuss (ii) both in ℝnand on the unit sphere.


1969 ◽  
Vol 6 (03) ◽  
pp. 478-492 ◽  
Author(s):  
William E. Wilkinson

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.


1955 ◽  
Vol 7 ◽  
pp. 337-346 ◽  
Author(s):  
R. P. Bambah ◽  
K. Rogers

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).


Author(s):  
James A. Cochran ◽  
Cheng-Shyong Lee
Keyword(s):  

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.


1905 ◽  
Vol 40 (3) ◽  
pp. 615-629
Author(s):  
Thomas Muir

(1) This is a subject to which very little study has been directed. The first to enunciate any proposition regarding it was Jacobi; but the solitary result which he reached received no attention from mathematicians,—certainly no fruitful attention,—during seventy years following the publication of it.Jacobi was concerned with a problem regarding the partition of a fraction with composite denominator (u1 − t1) (u2 − t2) … into other fractions whose denominators are factors of the original, where u1, u2, … are linear homogeneous functions of one and the same set of variables. The specific character of the partition was only definable by viewing the given fraction (u1−t1)−1 (u2−t2)−1…as expanded in series form, it being required that each partial fraction should be the aggregate of a certain set of terms in this series. Of course the question of the order of the terms in each factor of the original denominator had to be attended to at the outset, since the expansion for (a1x+b1y+c1z−t)−1 is not the same as for (b1y+c1z+a1x−t)−1. Now one general proposition to which Jacobi was led in the course of this investigation was that the coefficient ofx1−1x2−1x3−1…in the expansion ofy1−1u2−1u3−1…, whereis |a1b2c3…|−1, provided that in energy case the first term of uris that containing xr.


1966 ◽  
Vol 62 (4) ◽  
pp. 637-642 ◽  
Author(s):  
T. W. Cusick

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.


2013 ◽  
Vol 55 (1) ◽  
pp. 37-45
Author(s):  
Roman Wituła ◽  
Konrad Kaczmarek ◽  
Edyta Hetmaniok ◽  
Damian Słota

Abstract In this paper a problem of approximating the real numbers by using the series of real numbers is considered. It is proven that if the given family of sequences of real numbers satisfies some conditions of set-theoretical nature, like being closed under initial subsequences and (additionally) possessing properties of adding and removing elements, then it automatically possesses some approximating properties, like, for example, reaching supremum of the set of sums of subseries.


1962 ◽  
Vol 14 ◽  
pp. 597-601 ◽  
Author(s):  
J. Kiefer

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).


1969 ◽  
Vol 21 ◽  
pp. 1309-1318 ◽  
Author(s):  
James Stewart

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


1980 ◽  
Vol 32 (5) ◽  
pp. 1045-1057 ◽  
Author(s):  
Patrick J. Browne ◽  
Rodney Nillsen

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


Sign in / Sign up

Export Citation Format

Share Document