Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.     

On the weakening of the convergence of Newton’s method using recurrent functions

We use Newton’s method to approximate a locally unique solution of an equation in a Banach space setting. We introduce recurrent functions to provide a weaker semilocal convergence analysis for Newton’s method than before [J. Appell, E. De Pascale, J.V. Lysenko, P.P. Zabrejko, New results on Newton–Kantorovich approximations with applications to nonlinear integral equations, Numer. Funct. Anal. Optim. 18 (1997) 1–17; I.K. Argyros, The theory and application of abstract polynomial equations, in: Mathematics Series, St. Lucie/CRC/Lewis Publ., Boca Raton, Florida, USA, 1998; I.K. Argyros, Concerning the “terra incognita” between convergence regions of two Newton methods, Nonlinear Anal. 62 (2005) 179–194; I.K. Argyros, Convergence and Applications of Newton-Type Iterations, Springer-Verlag Publ., New York, 2008; S. Chandrasekhar, Radiative Transfer, Dover Publ., New York, 1960; F. Cianciaruso, E. De Pascale, Newton–Kantorovich approximations when the derivative is Hölderian: Old and new results, Numer. Funct. Anal. Optim. 24 (2003) 713–723; N.T. Demidovich, P.P. Zabrejko, Ju.V. Lysenko, Some remarks on the Newton–Kantorovich method for nonlinear equations with Hölder continuous linearizations, Izv. Akad. Nauk Belorus 3 (1993) 22–26. (in Russian); E. De Pascale, P.P. Zabrejko, Convergence of the Newton–Kantorovich method under Vertgeim conditions: A new improvement, Z. Anal. Anwendvugen 17 (1998) 271–280; L.V. Kantorovich, G.P. Akilov, Functional Analysis, Pergamon Press, Oxford, 1982; J.V. Lysenko, Conditions for the convergence of the Newton–Kantorovich method for nonlinear equations with Hölder linearizations, Dokl. Akad. Nauk BSSR 38 (1994) 20–24. (in Russian); B.A. Vertgeim, On conditions for the applicability of Newton’s method, (Russian), Dokl. Akad. Nauk., SSSR 110 (1956) 719–722; B.A. Vertgeim, On some methods for the approximate solution of nonlinear functional equations in Banach spaces, Uspekhi Mat. Nauk 12 (1957) 166–169. (in Russian); English transl.:; Amer. Math. Soc. Transl. 16 (1960) 378–382] provided that the Fréchet-derivative of the operator involved is p$p$-Hölder continuous (p∈(0,1]$p\in (0,1]$).     

Zero-dimensional subschemes of ruled varieties

Here we study zero-dimensional subschemes of ruled varieties, mainly Hirzebruch surfaces and rational normal scrolls, by applying the Horace method and the Terracini method This research is part of the T.A.S.C.A. project of I.N.d.A.M., supported by P.A.T. (Trento) and M.I.U.R. (Italy)     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

Comments on generalized Heron polynomials and Robbins’ conjectures

Heron’s formula for a triangle gives a polynomial for the square of its area in terms of the lengths of its three sides. There is a very similar formula, due to Brahmagupta, for the area of a cyclic quadrilateral in terms of the lengths of its four sides. (A polygon is cyclic if its vertices lie on a circle.) In both cases if A is the area of the polygon, (4A)² is a polynomial function of the square in the lengths of its edges. David Robbins in [D.P. Robbins, Areas of polygons inscribed in a circle, Discrete Comput. Geom. 12 (2) (1994) 223-236. MR 95g:51027; David P. Robbins, Areas of polygons inscribed in a circle, Amer. Math. Monthly 102 (6) (1995) 523-530. MR 96k:51024] showed that for any cyclic polygon with n edges, (4A)² satisfies a polynomial whose coefficients are themselves polynomials in the edge lengths, and he calculated this polynomial for n=5 and n=6. He conjectured the degree of this polynomial for all n, and recently Igor Pak and Maksym Fedorchuk [Maksym Fedorchuk, Igor Pak, Rigidity and polynomial invariants of convex polytopes, Duke Math. J. 129 (2) (2005) 371-404. MR 2006f:52015] have shown that this conjecture of Robbins is true. Robbins also conjectured that his polynomial is monic, and that was shown in [V.V. Varfolomeev, Inscribed polygons and Heron polynomials (Russian. Russian summary), Mat. Sb. 194 (3) (2003) 3-24. MR 2004d:51014]. A short independent proof will be shown here.     

Least distance methods for the scheme of polytopes

Methods are described and APL-codes are supplied to find vertices, edges, other faces and facets of polytopes given by point sets. The basic subroutine is a simplicial decomposition version of least distance, i.e. quadratic, programming. Computational experience indicates high efficiency.     

Structure and Properties of Nanocrystalline Oxide Powders

The crystalline and porous structure of superfine powders and fibers made of alumina and zirconia doped with yttria is investigated. The particle sizes were determined by the methods of coherent dispersion and scanning transmission electron microscopy. Based on data on the sizes of crystallites of the metal oxides, which were obtained by different methods, it is found that crystalline transformations of the oxides lead to dispersion of the materials. The structural transformations of the superfine oxides are accompanied by changes in crystallite sizes and in the character and size of pores. The laws established allow one to purposefully control the process of producing nanostructured oxide powders and fibers, which can be utilized as active fillers for composite materials based on various matrices. __________ Translated from Mekhanika Kompozitnykh Materialov, Vol. 41, No. 6, pp. 831–840, November–December, 2005.     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

Dendrites and light mappings

It is shown that a metric continuum is a dendrite if and only if for every compact space (continuum) and for every light confluent mapping such that there is a copy of in for which the restriction is a homeomorphism. As a corollary it follows that only dendrites have the lifting property with respect to light confluent mappings. Other classes of mappings are also discussed. This is a continuation of a previous study by the authors (2000), where open mappings were considered.

     

Finding Optimal Targets for Change Agents: A Computer Simulation of Innovation Diffusion

We introduce a diffusion of innovation model based on a network threshold approach. Realistic network and threshold data were gathered regarding the diffusion of new software tools within part of a large organization. Novel model features are a second threshold for innovation rejection and a memory that allows actors to take trends into account. Computer simulations produce expected outcomes, such as the S-shaped diffusion curve, but also diffusion breakdown and oscillations. We define and compute the quality of change agent targets in terms of the impact targeted actors have on the diffusion process. Our simulations reveal considerable variance in the quality of actors as change agent targets. Certain actors can be singled out as especially important to the diffusion process. Small changes in the distribution of thresholds and changes in some parameters, such as the sensitivity for trends, lead to significant changes in the target quality measure. To illustrate these interdependencies we outline how the impact of an actor targeted by a change agent spreads through the network. We thus can explain why a good change agent target does not necessarily need to be an opinion leader. Simulations comparing the effectiveness of randomly selected targets versus a group of good change agent targets indicate that the selection of good targets can accelerate innovation diffusion.     

Testing Ten Theories

Using the most comprehensive data set now available, this investigation tests the precision of all exchange theories that now contend. Beyond precision, the investigation focuses on broad issues of effectiveness including consistency, parsimony, and whether the theories can be applied to structures larger than normally studied in the lab. Seeking greater parsimony, this investigation introduces a new model by combining parts of two contending theories. We find that all ten theories have scientific merit for all can predict with some effectiveness for the exchange structures experimentally investigated. Nevertheless, the ten vary in precision. Elementary Theory is the most precise. The new Expected-value Resistance model ranks second in precision and is the simplest. Both apply to large networks as well as the best of the other theories.     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

Transverse compression of PPTA fibers

Results of single transverse compression testing of PPTA and PIPD fibers, using a novel test device, are presented and discussed. In the tests, short lengths of single fibers are compressed between two parallel, stiff platens. The fiber elastic deformation is analyzed as a Hertzian contact problem. The inelastic deformation is analyzed by elastic-plastic FE simulation and by laser-scanning confocal microscopy of the compressed fibers ex post facto. The results obtained are compared to those in the literature and to the theoretical predictions of PPTA fiber transverse elasticity based on PPTA crystal elasticity.Presented at the 11th International Conference on Mechanics of Composite Materials (Riga, June 11–15, 2000).3TEX, Inc. 109, MacKenan Drive, Cary, North Carolina 27511, USA. Published in Mekhanika Kompozitnykh Materialov, Vol. 36, No. 4, pp. 533–544, March–April, 2000.     

Compact Hopf hypersurfaces of constant mean curvature in complex space forms

We prove that every connected compact Hopf hypersurface of a complex space form, contained in a geodesic ball of radius strictly smaller than the injectivity radius of, having constant mean curvature and with if if < 0 is a geodesic sphere of.Work partially supported by DGICYT Grant No. PB91-0324.     

Circular summation of theta functions in Ramanujan's Lost Notebook

In this paper, we prove Ramanujan's circular summation formulas previously studied by S.S. Rangachari, S.H. Son, K. Ono, S. Ahlgren and K.S. Chua using properties of elliptic and theta functions. We also derive identities similar to Ramanujan's summation formula and connect these identities to Jacobi's and Dixon's elliptic functions. At the end of the paper, we discuss the connection of our results with the recent thesis of E. Conrad.     

Effectivity functions and simple games

The rather new notion of effectivity function is related to the notion of simple game. Every effectivity function is associated with a simple game. So theory about simple games may be applicable to effectivity functions. E.g. if the effectivity function is additive, then the associated simple game is weighted. Via a characterization of weighted simple games it is possible to characterize maximal additive effectivity functions.Finally we characterize additive effectivity functions and their associated simple games.I thank G.J. Otten for useful comments and stimulating conversations.     

I-hedrite图平面嵌入的唯一性

本文研究每一个面圈的圈长仅为2,3或4的无割点的4·正则连通平面图,称之为I-hedrite图.证明在相等意义上,I-hedrite图的平面嵌入是唯一的.这个唯一性结论意味着,两个i-hedrite图(即每一个面的度仅为2,3或4的4-正则连通平图)是相等的当且仅当它们是同构的,从而解决了i-hedrite图的同构构造在相等意义上的唯一性问题.     

Proof validation in real analysis: Inferring and checking warrants

In the study reported here, we investigate the skills needed to validate a proof in real analysis, i.e., to determine whether a proof is valid. We first argue that when one is validating a proof, it is not sufficient to make certain that each statement in the argument is true. One must also check that there is good reason to believe that each statement follows from the preceding statements or from other accepted knowledge, i.e., that there is a valid warrant for making that statement in the context of this argument. We then report an exploratory study in which we investigated the behavior of 13 undergraduates when they were asked to determine whether or not a particular flawed mathematical argument is a valid mathematical proof. The last line of this purported proof was true, but did not follow legitimately from the earlier assertions in the proof. Our findings were that only six of these undergraduates recognized that this argument was invalid and only two did so for legitimate mathematical reasons. On a more positive note, when asked to consider whether the last line of the proof followed from previous assertions, a total of 10 students concluded that the statement did not and rejected the proof as invalid.     

Monadic Bounded Commutative Residuated ℓ-monoids

Bounded commutative residuated ℓ-monoids are a generalization of algebras of propositional logics such as BL-algebras, i.e. algebraic counterparts of the basic fuzzy logic (and hence consequently MV-algebras, i.e. algebras of the Łukasiewicz infinite valued logic) and Heyting algebras, i.e. algebras of the intuitionistic logic. Monadic MV-algebras are an algebraic model of the predicate calculus of the Łukasiewicz infinite valued logic in which only a single individual variable occurs. We introduce and study monadic residuated ℓ-monoids as a generalization of monadic MV-algebras. Jiří Rachůnek was supported by the Council of Czech Goverment MSM 6198959214.     

Iterated function systems, Ruelle operators, and invariant projective measures

We introduce a Fourier-based harmonic analysis for a class of discrete dynamical systems which arise from Iterated Function Systems. Our starting point is the following pair of special features of these systems. (1) We assume that a measurable space comes with a finite-to-one endomorphism which is onto but not one-to-one. (2) In the case of affine Iterated Function Systems (IFSs) in , this harmonic analysis arises naturally as a spectral duality defined from a given pair of finite subsets in of the same cardinality which generate complex Hadamard matrices.

Our harmonic analysis for these iterated function systems (IFS) is based on a Markov process on certain paths. The probabilities are determined by a weight function on . From we define a transition operator acting on functions on , and a corresponding class of continuous -harmonic functions. The properties of the functions in are analyzed, and they determine the spectral theory of . For affine IFSs we establish orthogonal bases in . These bases are generated by paths with infinite repetition of finite words. We use this in the last section to analyze tiles in .