Solution of the Ulam Stability Problem for Euler–Lagrange Quadratic Mappings

In 1940 S. M. Ulam proposed at the University of Wisconsin theproblem: “Give conditions in order for a linear mapping near an approximately linear mapping to exist.” In 1968 S. U. Ulam proposed the moregeneral problem: “When is it true that by changing a little the hypotheses of a theorem one can still assert that the thesis of the theorem remains true or approximately true?” In 1978 P. M. Gruber proposed theUlam type problem: “Suppose a mathematical object satisfies a certain property approximately. Is it then possible to approximate this object by objects, satisfying the property exactly?” According to P. M. Gruber this kind of stability problems is of particular interest in probability theory and in the case of functional equations of different types. In 1982–1996 we solved the above Ulam problem, or equivalently the Ulam type problem for linear mappings and established analogous stability problems. In this paper we first introduce newquadratic weighted meansandfundamental functional equationsand then solve theUlam stability problemfornon-linear Euler–Lagrange quadratic mappingsQ:X → Y, satisfying a mean equation and functional equation[formula]for all 2-dimensional vectors (x₁, x₂) X², withXa normed linear space (Y a real complete normed linear space), and any fixed pair (a₁, a₂) of realsa_iand any fixed pair (m₁, m₂) of positive realsm_i(i = 1, 2), [formula]     

Une combinatoire sous-jacente au théorème des fonctions implicites

Using his theory of combinatorial species, [3.], 1–82 a combinatorial form of the classical multidimensional implicit function theorem. His theorem asserts the existence and (strong) unicity of species satisgying systems of combinatorial equations of a very general type. We present an explicit construction of these species by using a suitable combinatorial version of the Lie Series in the sense of [1. and 2.]. The approach constitutes a generalization of the method of “éclosions” (bloomings) which was used by the author in (J. Combin. Theory Ser. A 39, No. 1 (1985), 52–82), to study multidimensional power series reversion. Remarks concerning the applicability of the method to solve certain combinatorial differential equations are also made at the end of the work.     

Nonlinear equations with mixed derivatives

The nonlinear hyperbolic equation ∂²u(x, y)/∂x ∂y + g(x, y)f(u(x, y)) = 0 with u(x, 0) = φ(x) and u(0, y) = Ψ(y), considered by [1.], 31–45) under appropriate smoothness conditions, is solvable by the author's decomposition method (“Stochastic Systems,” Academic Press, 1983 and “Nonlinear Stochastic Operator Equations,” Academic Press, 1986).     

On deformation of associative algebras and graph homology

Deformation theory of associative algebras and in particular of Poisson algebras is reviewed. The role of an “almost contraction” leading to a canonical solution of the corresponding Maurer–Cartan equation is noted. This role is reminiscent of the Homotopical Perturbation Lemma, with the infinitesimal deformation cocycle as “initiator.”Applied to star-products, we show how Moyal's formula can be obtained using such an almost contraction and conjecture that the “merger operation” provides a canonical solution at least in the case of linear Poisson structures.     

Canonizing ordering theorems for hales Jewett structures

The natural linear orderings of an n-dimensional cube over a finite set A are investigated. We obtain a characterization theorem for these orderings extending earlier result, e.g., for natural orderings on finite Boolean lattices, as given in [5.], 193–197.     

Euler's partition theorem and the combinatorics of ℓ-sequences

Euler's partition theorem states that the number of partitions of an integer N into odd parts is equal to the number of partitions of N in which the ratio of successive parts is greater than 1. It was shown by Bousquet-Mélou and Eriksson in [M. Bousquet-Mélou, K. Eriksson, Lecture hall partitions II, Ramanujan J. 1 (2) (1997) 165–185] that a similar result holds when “odd parts” is replaced by “parts that are sums of successive terms of an ℓ-sequence” and the ratio “1” is replaced by a root of the characteristic polynomial of the ℓ-sequence. This generalization of Euler's theorem is intrinsically different from the many others that have appeared, as it involves a family of partitions constrained by the ratio of successive parts.In this paper, we provide a surprisingly simple bijection for this result, a question suggested by Richard Stanley. In fact, we give a parametrized family of bijections, that include, as special cases, Sylvester's bijection and a bijection for the lecture hall theorem. We introduce Sylvester diagrams as a way to visualize these bijections and deduce their properties.In proving the bijections, we uncover the intrinsic role played by the combinatorics of ℓ-sequences and use this structure to give a combinatorial characterization of the partitions defined by the ratio constraint. Several open questions suggested by this work are described.     

A general framework of compactly supported splines and wavelets

Let {V_k} be a nested sequence of closed subspaces that constitute a multiresolution analysis of L²( ). We characterize the family Φ = {φ} where each φ generates this multiresolution analysis such that the two-scale relation of φ is governed by a finite sequence. In particular, we identify the ε Φ that has minimum support. We also characterize the collection Ψ of functions η such that each η generates the orthogonal complementary subspaces W_k of V_k, . In particular, the minimally supported ψ ε Ψ is determined. Hence, the “B-spline” and “B-wavelet” pair (, ψ) provides the most economical and computational efficient “spline” representations and “wavelet” decompositions of L² functions from the “spline” spaces V_k and “wavelet” spaces W_k, k . A very general duality principle, which yields the dual bases of both {(·−j):j and {η(·−j):j } for any η ε Ψ by essentially interchanging the pair of two-scale sequences with the pair of decomposition sequences, is also established. For many filtering applications, it is very important to select a multiresolution for which both and ψ have linear phases. Hence, “non-symmetric” and ψ, such as the compactly supported orthogonal ones introduced by Daubechies, are sometimes undesirable for these applications. Conditions on linear-phase φ and ψ are established in this paper. In particular, even-order polynomial B-splines and B-wavelets φ_m and ψ_m have linear phases, but the odd-order B-wavelet only has generalized linear phases.     

Embeddings in Spaces of Lipschitz Type, Entropy and Approximation Numbers, and Applications

We consider the embeddings of certain Besov and Triebel–Lizorkin spaces in spaces of Lipschitz type. The prototype of such embeddings arises from the result of H. Brézis and S. Wainger (1980, Comm. Partial Differential Equations5, 773–789) about the “almost” Lipschitz continuity of elements of the Sobolev spaces H^1+n/p_p( ⁿ) when 1<p<∞. Two-sided estimates are obtained for the entropy and approximation numbers of a variety of related embeddings. The results are applied to give bounds for the eigenvalues of certain pseudo-differential operators and to provide information about the mapping properties of these operators.     

Canonizing partition theorems: Diversification, products, and iterated versions

We present an abstract framework for canonizing partition theorems. The concept of attribute functions and of diversification allows us to establish a canonizing product theorem, generalizing previous results of [19.], 71–83] for the situation of Ramsey's theorem. As applications we mention a canonizing product theorem for arithmetic progressions and for finite geometric arguesian lattices. We show that finite sets and finite vector spaces have the diversification property. Along these lines, iterated versions of the [6.], 249–255] and its q-analogue for finite vector spaces [[24.], 219–239] are derived.     

Passage to the limit in Proposition I, Book I of Newton's Principia

The purpose of this paper is to analyze the way in which Newton uses his polygon model and passes to the limit in Proposition I, Book I of his Principia. It will be evident from his method that the limit of the polygon is indeed the orbital arc of the body and that his approximation of the actual continuous force situation by a series of impulses passes correctly in the limit into the continuous centripetal force situation. The analysis of the polygon model is done in two ways: (1) using the modern concepts of force, linear momentum, linear impulse, and velocity, and (2) using Newton's concepts of motive force and quantity of motion. It should be clearly understood that the term “force” without the adjective “motive,” is used in the modern sense, which is that force is a vector which is the time rate of change of the linear momentum. Newton did not use the word “force” in this modern sense. The symbol F denotes modern force. For Newton “force” was “motive force,” which is measured by the change in the quantity of motion of a body. Newton's “quantity of motion” is proportional to the magnitude of the modern vector momentum. Motive force is a scalar and the symbol F_m is used for motive force.     

Best Interpolatory Approximation in Normed Linear Spaces

A theory of best approximation with interpolatory contraints from a finite-dimensional subspaceMof a normed linear spaceXis developed. In particular, to eachxX, best approximations are sought from a subsetM(x) ofMwhichdependson the elementxbeing approximated. It is shown that this “parametric approximation” problem can be essentially reduced to the “usual” one involving a certainfixedsubspaceM₀ofM. More detailed results can be obtained when (1) Xis a Hilbert space, or (2) Mis an “interpolating subspace” ofX(in the sense of [1]).     

Discrete time Galerkin approximations to the nonlinear filtering solution

This paper concerns discrete time Galerkin approximations to the solution of the filtering problem for diffusions. Two families of schemes approximating the unnormalized conditional density, respectively, in an “average” and in a “pathwise” sense, are presented. L² error estimates are derived and it is shown that the rate of convergence is linear in the time increment or linear in the modulus of continuity of the sample path.     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

Self-intersection local time for Gaussian ′( )-processes: Existence, path continuity and examples

In this paper we develop a criterion for existence or non-existence of self-intersection local time (SILT) for a wide class of Gaussian ′( ^d)-valued processes, we show that quite generally the SILT process has continuous paths, and we give several examples which illustrate existence of SILT for different ranges of dimensions (e.g., d ≤ 3, d ≤ 7 and 5 ≤ d ≤ 11 in the Brownian case). Some of the examples involve branching and exhibit “dimension gaps”. Our results generalize the work of Adler and coauthors, who studied the special case of “density processes” and proved that SILT paths are cadlag in the Brownian case making use of a “particle picture” approximation (this technique is not available for our general formulation).     

Gabor frames and directional time–frequency analysis

We introduce a directionally sensitive time–frequency decomposition and representation of functions. The coefficients of this representation allow us to measure the “amount” of frequency a function (signal, image) contains in a certain time interval, and also in a certain direction. This has been previously achieved using a version of wavelets called ridgelets [E.J. Candès, Harmonic analysis of neural networks, Appl. Comput. Harmon. Anal. 6 (1999) 197–218. [2]; E.J. Candès, D.L. Donoho, New tight frames of curvelets and optimal representations of objects with piesewise-C² singularities, Comm. Pure Appl. Math. 57 (2004) 219–266. [3]] but in this work we discuss an approach based on time–frequency or Gabor elements. For such elements, a Parseval formula and a continuous frame-type representation together with boundedness properties of a semi-discrete frame operator are obtained. Spaces of functions tailored to measure quantitative properties of the time–frequency–direction analysis coefficients are introduced and some of their basic properties are discussed. Applications to image processing and medical imaging are presented.     

Exploiting structure in quantified formulas

We study the computational problem “find the value of the quantified formula obtained by quantifying the variables in a sum of terms.” The “sum” can be based on any commutative monoid, the “quantifiers” need only satisfy two simple conditions, and the variables can have any finite domain. This problem is a generalization of the problem “given a sum-of-products of terms, find the value of the sum” studied in [R.E. Stearns and H.B. Hunt III, SIAM J. Comput. 25 (1996) 448–476]. A data structure called a “structure tree” is defined which displays information about “subproblems” that can be solved independently during the process of evaluating the formula. Some formulas have “good” structure trees which enable certain generic algorithms to evaluate the formulas in significantly less time than by brute force evaluation. By “generic algorithm,” we mean an algorithm constructed from uninterpreted function symbols, quantifier symbols, and monoid operations. The algebraic nature of the model facilitates a formal treatment of “local reductions” based on the “local replacement” of terms. Such local reductions “preserve formula structure” in the sense that structure trees with nice properties transform into structure trees with similar properties. These local reductions can also be used to transform hierarchical specified problems with useful structure into hierarchically specified problems having similar structure.     

Stability of best rational Chebyshev approximation

In this paper we consider best Chebyshev approximation to continuous functions by generalized rational functions using an optimization theoretical approach introduced in [[5.]]. This general approach includes, in a unified way, usual, weighted, one-sided, unsymmetric, and also more general rational Chebychev approximation problems with side-conditions. We derive various continuity conditions for the optimal value, for the feasible set, and the optimal set of the corresponding optimization problem. From these results we derive conditions for the upper semicontinuity of the metric projection, which include some of the results of Werner [On the rational Tschebyscheff operator, Math. Z. 86 (1964), 317–326] and Cheney and Loeb [On the continuity of rational approximation operators, Arch. Rational Mech. Anal. 21 (1966), 391–401].     

The Reception of Frege''sBegriffsschrift

The topic of the paper is the public reception of Gottlob Frege's (1848–1925)Begriffsschriftright after its publication in 1879. According to a widespread conception, the reception of the book was “unfavorable” and even “tragic.” The aim of the paper is to correct this exaggerated and even false view. The arguments are based, above all, on the six journal reviews of Frege's book in 1879 and 1880, and on Leonhard Rabus's critical comment on it in his bookDie neuesten Bestrebungen auf dem Gebiete der Logik bei den Deutschen und die logische Frage(1880). The conclusion is that it is misleading to regard the reception of Frege's first work as unfair and hostile even though it is apparent thatsomereviewers of the book were rather poorly motivated to comment on theBegriffsschrift.Copyright 1998 Academic Press.Der Gegenstand dieses Beitrags ist die öffentliche Rezeption von Gottlob Freges (1848–1925)Begriffsschriftnach ihrer Publikation 1879. Nach einer weitverbreiteten Auffassung war die Rezeption “ungünstig,” sogar “tragisch.” Ziel des Beitrags ist es zu zeigen, dass solche Interpretationen überspannt, teilweise sogar falsch sind. Der Verfasser gründet seine Behauptung vor allem auf die Rezensionen, die in verschiedenen Zeitschriften in den Jahren 1879 und 1880 erschienen sind. Er benutzt auch den Kommentar von Leonhard RabusDie neuesten Bestrebungen auf dem Gebiete der Logik bei den Deutschen und Die logische Frage(1880). Die Untersuchung kommt zu dem Schluss, dass, obwohl offensichtlicheinigeRezensenten dem Buch eher ablehnend gegenüberstanden, es irreführend ist, von einer ungerechtfertigten oder abweisenden Rezeption der Fregeschen Begriffsschrift zu sprechenCopyright 1998 Academic Press.AMS subject classification: 00A30, 01A55, 03A05