Approximate factorizations with S/P consistently ordered M-factors

The behaviour of PCG methods for solving a finite difference or finite element positive definite linear systemAx=b with a (pre)conditioning matrixB=U ^TP^–1 U (whereU is upper triangular andP=diag(U)) obtained from a modified incomplete factorization, isunpredictable in the present status of knowledge whenever the upper triangular factor is not strictly diagonally dominant and 2P –D, whereD=diag(A), is not symmetric positive definite. The origin of this rather surprising shortcoming of the theory is that all upper bounds on the associated spectral condition number (B ^–1 A) obtained so far require either the strict diagonal dominance of the upper triangular factor or the strict positive definiteness of 2P –D. It is our purpose here to improve the theory in this respect by showing that, when the triangular factors are S/P consistently orderedM-matrices, nonstrict diagonal dominance is generally a sufficient requirement, without additional condition on 2P –D. As a consequence, the new analysis does not require diagonal perturbations (otherwise needed to keep control of the diagonal dominance ofU or of the positive definiteness of 2P –D). Further, the bounds obtained here on (B ^–1 A) are independent of the lower spectral bound ofD ^–1 A meaning that quasi-singular problems can be solved at the same speed as regular ones, an unexpected result.     

Factorization Representations in the Boundary Crossing Problems for Random Walks on a Markov Chain

Let τ be some stopping time for a random walk S _n defined on transitions of a finite Markov chain and let τ(t) be the first passage time across the level t which occurs after τ. We prove a theorem that establishes a connection between the dual Laplace-Stieltjes transforms of the joint distributions of (τ, S _τ) and (τ(t), S _τ(t)). This result applies to the study of the number of crossings of a strip by sample paths of a random walk.Original Russian Text Copyright © 2005 Lotov V. I. and Orlova N. G.The authors were partially supported by the Russian Foundation for Basic Research (Grant 05-01-00810) and the Grant Council of the President of the Russian Federation (Grant NSh-2139.2003.1).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 833–840, July–August, 2005.     

Classical and approximate sampling theorems; studies in the and the uniform norm

The approximate sampling theorem with its associated aliasing error is due to J.L. Brown (1957). This theorem includes the classical Whittaker–Kotel’nikov–Shannon theorem as a special case. The converse is established in the present paper, that is, the classical sampling theorem for , 1p<∞, w>0, implies the approximate sampling theorem. Consequently, both sampling theorems are fully equivalent in the uniform norm.Turning now to -space, it is shown that the classical sampling theorem for , 1<p<∞ (here p=1 must be excluded), implies the -approximate sampling theorem with convergence in the -norm, provided that f is locally Riemann integrable and belongs to a certain class Λ^p. Basic in the proof is an intricate result on the representation of the integral as the limit of an infinite Riemann sum of |f|^p for a general family of partitions of ; it is related to results of O. Shisha et al. (1973–1978) on simply integrable functions and functions of bounded coarse variation on . These theorems give the missing link between two groups of major equivalent theorems; this will lead to the solution of a conjecture raised a dozen years ago.     

On SL(3, ℝ)-actions on 4-spheres

We construct a natural, continuous SL(3, ℝ)-action on S ⁴ which is an extension of the SO(3)-action ψ of Uchida. The construction is based on the Kuiper theorem asserting that the quotient space of ℂP(2) by complex conjugation is S ⁴. We also give a new proof of the Kuiper theorem. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 5, pp. 99–105, 2005.     

The characterization of totally geodesic submanifolds ofS m andCP m

We prove a theorem on ruled surfaces that generalizes a theorem of Ferus on totally geodesic foliations. On the basis of this theorem we obtain criteria for totally geodesic submanifolds ofS ^m andCP ^m that generalize and complement certain results of Borisenko, Ferus, and Abe. We give an application to the geodesic differential forms defined by Dombrowski in the case of submanifolds ofS ^m andCP ^m.Translated from Ukrainskií Geometricheskií Sbornik, Issue 28, 1985, pp. 106–116.The author is grateful to V. A. Toponogov for posing this problem and for attention to the work and to A. A. Borisenko for helpful criticisms.     

Tate cohomology and periodic localization of polynomial functors

In this paper, we show that Goodwillie calculus, as applied to functors from stable homotopy to itself, interacts in striking ways with chromatic aspects of the stable category. Localized at a fixed prime p, let T(n) be the telescope of a v_n self map of a finite S–module of type n. The Periodicity Theorem of Hopkins and Smith implies that the Bousfield localization functor associated to T(n)_* is independent of choices. Goodwillies general theory says that to any homotopy functor F from S–modules to S–modules, there is an associated tower under F, {P_dF}, such that FP_dF is the universal arrow to a d–excisive functor. Our first main theorem says that P_dFP_d-1F always admits a homotopy section after localization with respect to T(n)_* (and so also after localization with respect to Morava K–theory K(n)_*). Thus, after periodic localization, polynomial functors split as the product of their homogeneous factors. This theorem follows from our second main theorem which is equivalent to the following: for any finite group G, the Tate spectrum is weakly contractible. This strengthens and extends previous theorems of Greenlees–Sadofsky, Hovey–Sadofsky, and Mahowald–Shick. The Periodicity Theorem is used in an essential way in our proof. The connection between the two theorems is via a reformulation of a result of McCarthy on dual calculus. Mathematics Subject Classification (2000) 55P65, 55N22, 55P60, 55P91     

Groupoid C *-Algebras and Index Theory on Manifolds with Singularities

The simplest case of a manifold with singularities is a manifold M with boundary, together with an identification M M × P, where P is a fixed manifold. The associated singular space is obtained by collapsing P to a point. When P = Z/k or S ¹, we show how to attach to such a space a noncommutative C ^*-algebra that captures the extra structure. We then use this C ^*-algebra to give a new proof of the Freed–Melrose Z/k-index theorem and a proof of an index theorem for manifolds with S ¹ singularities. Our proofs apply to the real as well as to the complex case. Applications are given to the study of metrics of positive scalar curvature.     

Dimensionsdefekt stetiger Abbildungen M4→S3

In this note we shall prove the following statements: Let Mⁿ, n>3, be a compact, triangulated, n-dimensional mainfold with H²(Mⁿ)=0; let f: MⁿS³ be an essential map onto the 3-sphere, Then there exist at most two points a and b, so that f^–1(a) and f^–1(b) are finite sets. If f: M⁴S³ is essential, then there are at most two points a and b with dim f^–1(a)=0 and dim f^–1(b)=0.     

A geometric inequality for a finite set of points on a sphere and its applications

In this paper we present a geometric inequality for a finite number of points on an (n–1)-dimensional sphere S _n–1(R). As an application, we obtain a geometric inequality for finitely many points in the n-dimensional Euclidean space E ⁿ.     

Some inequalities for algebraic polynomials with the Laguerre weight

There is a series of publications which have considered inequalities of Markov–Bernstein–Nikolskii type for algebraic polynomials with the Jacobi weight (see [N.K. Bari, A generalization of the Bernstein and Markov inequalities, Izv. Akad. Nauk SSSR Math. Ser. 18 (2) (1954) 159–176; B.D. Bojanov, An extension of the Markov inequality, J. Approx. Theory 35 (1982) 181–190; P. Borwein, T. Erdélyi, Polynomials and Polynomial Inequalities, Springer, New York, 1995; I.K. Daugavet, S.Z. Rafalson, Some inequalities of Markov–Nikolskii type for algebraic polynomials, Vestnik Leningrad. Univ. Mat. Mekh. Astronom. 1 (1972) 15–25; A. Guessab, G.V. Milovanovic, Weighted L²-analogues of Bernstein's inequality and classical orthogonal polynomials, J. Math. Anal. Appl. 182 (1994) 244–249; I.I. Ibragimov, Some inequalities for algebraic polynomials, in: V.I. Smirnov (Ed.), Fizmatgiz, 1961, Research on Modern Problems of Constructive Functions Theory; G.K. Lebed, Inequalities for polynomials and their derivatives, Dokl. Akad. Nauk SSSR 117 (4) (1957) 570–572; G.I. Natanson, To one theorem of Lozinski, Dokl. Akad. Nauk SSSR 117 (1) (1957) 32–35; M.K. Potapov, Some inequalities for polynomials and their derivatives, Vestnik Moskov. Univ. Ser. Mat. Mekh. 2 (1960); E. Schmidt, Über die nebst ihren Ableitungen orthogonalen Polynomsysteme und das zugehörige Extremum, Math. Ann. 119 (1944) 165–209; P. Turán, Remark on a theorem of Erhard Schmidt, Mathematica 2 (25) (1960) 373–378]). In this paper we find an inequality of the same type for algebraic polynomials on (0,∞) with the Laguerre weight function e^-xx^α (α>-1).     

On the Spectrum of Frobenius–Perron Operators

We prove more results on the spectrum of the Frobenius–Perron operator P: L¹ → L¹ associated with a nonsingular transformation S: X → X on a σ-finite measure space (X, Σ, μ).     

A large deviation theorem for weighted sums

Asymptotic representations are derived for large deviation probabilities of weighted sums of independent, identically distributed random variables. The main theorem generalizes a 1952 theorem of Chernoff which asserts that n ^–1 log P(S _n>cn)–log , where S _n is the partial sum of a sequence of independent, identically distributed random variables X ₁, X ₂, ... and is a constant depending on X ₁. The main result is similar in form to, but different in focus from, a particular case of Feller's (1969) theorem on large deviations for triangular arrays.This paper is based on work done for the author's doctoral dissertation written under Prof. Donald R. Truax of the University of Oregon, Eugene.     

Dimension de l’anneau des polynomes a valeurs entieres

Let A be a commutative domain with quotient field K and A_S the ring of integer-valued polynomials thus A_S={f∈K[X]; f(A)⊂A}; we show that the Krull dimension of A_S is such that dim A_S≥dim A[X]-1 and give examples where dim A_S=dim A[X]-1. Considering chains of primes of A_S above a maximal idealm of finite residue field, we give also examples where the length of such a chain can arbitrarily be prescribed (whereas in A[X] the length of such chains is always 1). To provide such examples we consider a pair of domains A⊂B sharing an ideal I such that A/I is finite; we give sufficient conditients to have A_S⊂B[X] and show that in this case dim A_S=dim B[X]. At last, as a generalisation of Noetherian rings of dimension 1, we consider domains with an ideal I such that A/I is finite and a power Iⁿ of I is contained in a proper principal ideal of A; for such domains we show that every prime of A_S above a primem containing I is maximal.      

<Emphasis Type="Italic">P</Emphasis>-orderings of finite subsets of Dedekind domains

If R is a Dedekind domain, P a prime ideal of R and S⊆R a finite subset then a P-ordering of S, as introduced by M. Bhargava in (J. Reine Angew. Math. 490:101–127, 1997), is an ordering {a _i } _i=1 ^m of the elements of S with the property that, for each 1<i≤m, the choice of a _i minimizes the P-adic valuation of ∏ _j<i (s−a _j ) over elements s∈S. If S, S ^′ are two finite subsets of R of the same cardinality then a bijection φ:S→S ^′ is a P-ordering equivalence if it preserves P-orderings. In this paper we give upper and lower bounds for the number of distinct P-orderings a finite set can have in terms of its cardinality and give an upper bound on the number of P-ordering equivalence classes of a given cardinality.     

On the existence of certain cyclic difference families and difference matrices

A theorem is proved to the effect that if there exists a BIB-schema with parameters (p^m–1,k, k–1), where k¦(p^m–1), p is prime, and m is a natural number, then there exists a BIB-schema (p^mn–1),k, k–1). A consequence is the existnece of a cyclic BIB-schema (p^mn–1, p^m–1, p^m–2) (p^m–1 is prime) that specifies each ordered pair of difference elements at any distance = 1, 2, ..., p^m–2 (cyclically) precisely once. Recursive theorems on the existence of difference matrices and (v, k, k)-difference families in the group Z_v of residue classes mod v are proved, along with a theorem on difference families in an additive abelian group.Translated from Matematicheskie Zametki, Vol. 52, No. 1, pp. 114–119, July, 1992.     

Extending the Greene-Kleitman theorem to directed graphs

The celebrated Dilworth theorem (Ann. of Math. 51 (1950), 161–166) on the decomposition of finite posets was extended by Greene and Kleitman (J. Combin. Theory Ser. A 20 (1976), 41–68). Using the Gallai-Milgram theorem (Acta Sci. Math. 21 (1960), 181–186) we prove a theorem on acyclic digraphs which contains the Greene-Kleitman theorem. The method of proof is derived from M. Saks' elegant proof (Adv. in Math. 33 (1979), 207–211) of the Greene-Kleitman theorem.     

An extension of the Erdős–Ginzburg–Ziv Theorem to hypergraphs

An n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise disjoint as sequences, such that every term of S belongs to exactly one of the subsequences, and the terms in each subsequence are all distinct with the result that they can be considered as sets. For a sequence S, subsequence S^′, and set T, |T∩S| denotes the number of terms x of S with xT, and |S| denotes the length of S, and SS^′ denotes the subsequence of S obtained by deleting all terms in S^′. We first prove the following two additive number theory results.(1) Let S be a finite sequence of elements from an abelian group G. If S has an n-set partition, A=A₁,…,A_n, such that

then there exists a subsequence S^′ of S, with length |S^′|≤max{|S|−n+1,2n}, and with an n-set partition, , such that . Furthermore, if ||A_i|−|A_j||≤1 for all i and j, or if |A_i|≥3 for all i, then .(2) Let S be a sequence of elements from a finite abelian group G of order m, and suppose there exist a,bG such that . If |S|≥2m−1, then there exists an m-term zero-sum subsequence S^′ of S with or .Let be a connected, finite m-uniform hypergraph, and be the least integer n such that for every 2-coloring (coloring with the elements of the cyclic group ) of the vertices of the complete m-uniform hypergraph , there exists a subhypergraph isomorphic to such that every edge in is monochromatic (such that for every edge e in the sum of the colors on e is zero). As a corollary to the above theorems, we show that if every subhypergraph of contains an edge with at least half of its vertices monovalent in , or if consists of two intersecting edges, then . This extends the Erdős–Ginzburg–Ziv Theorem, which is the case when is a single edge.     

Sets in a euclidean space which are not a countable union of convex subsets

We prove that if a closed planar setS is not a countable union of convex subsets, then exactly one of the following holds:

An L0（F,R）-valued Function＇s Intermediate Value Theorem and Its Applications to Random Uniform Convexity

Let (Ω , F , P ) be a probability space and L0 ( F, R ) the algebra of equivalence classes of real- valued random variables on (Ω , F , P ). When L0 ( F, R ) is endowed with the topology of convergence in probability, we prove an intermediate value theorem for a continuous local function from L0 ( F, R ) to L0 ( F, R ). As applications of this theorem, we first give several useful expressions for modulus of random convexity, then we prove that a complete random normed module ( S,|| · ||) is random uniformly convex iff Lp ( S ) is uniformly convex for each fixed positive number p such that 1 p + ∞ .