Rate of Convergence of a Stochastic Particle System for the Smoluchowski Coagulation Equation

By continuing the probabilistic approach of Deaconu et al. (2001), we derive a stochastic particle approximation for the Smoluchowski coagulation equations. A convergence result for this model is obtained. Under quite stringent hypothesis we obtain a central limit theorem associated with our convergence. In spite of these restrictive technical assumptions, the rate of convergence result is interesting because it is the first obtained in this direction and seems to hold numerically under weaker hypothesis. This result answers a question closely connected to the Open Problem 16 formulated by Aldous (1999).     

A Borsuk–Ulam Theorem for Maps from a Sphere to a Generalized Manifold

H. J. Munkholm obtained a generalization for topological manifolds of the famous Borsuk–Ulam type theorem proved by Conner and Floyd. The purpose of this paper is to prove a version of Conner and Floyd's theorem for generalized manifolds.     

Computation of the eigenvalues of Sturm-Liouville problems with parameter dependent boundary conditions using the regularized sampling method

The purpose in this paper is to compute the eigenvalues of Sturm-Liouville problems with quite general separated boundary conditions nonlinear in the eigenvalue parameter using the regularized sampling method, an improvement on the method based on Shannon sampling theory, which does not involve any multiple integration and provides higher order estimates of the eigenvalues at a very low cost. A few examples shall be presented to illustrate the power of the method and a comparison made with the the exact eigenvalues obtained as squares of the zeros of the exact characteristic functions.

     

The interlace polynomial of a graph

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers.     

On norms of composition operators acting on Bergman spaces

For arbitrary composition operators acting on a general Bergman space we improve the known lower bound for the norm and also generalize a related recent theorem of D.G. Pokorny and J.E. Shapiro. Next, we obtain a geometric formula for the norms of composition operators with linear fractional symbols, thus extending a result of C. Cowen and P. Hurst and revealing the meaning of their computation. Finally, we obtain a lower bound for essential norm of an arbitrary composition operator related to the well-known criterion of B. MacCluer and J.H. Shapiro. As a corollary, norms and essential norms are obtained for certain univalently induced noncompact composition operators in terms of the minimum of the angular derivative of the symbol.     

Two-function upward-downward minimax theorems

Two-function upward-downward minimax theorems are derived which contain Simons upward-downward minimax theorem as well as Domokos minimax theorem as special cases. Here the convexity assumptions on two functions are given by mixing up their values as means proposed by Lin and Quan.     

New characterizations of Hajlasz-Sobolev spaces on metric spaces

This paper introduces the fractional Sobolev spaces on spaces of homogeneous type,includingmetric spaces and fractals. These Sobolev spaces include the well-known Hajfasz-Sobolev spaces as specialmodels.The author establishes varions chaaracterizations of(sharp)maximal functions for these spaces.Asapplications,the author identifies the fractional Sobolev spaces with some Lipscitz-type spaces.Moreover;some embedding theorems are also given.     

Symmetry specified enumeration of substituted derivatives: an easy solution to the complex problem

Several sophisticated methods to solution of symmetry specified enumeration problems are available in the modern literature. In this paper we propose a simple technique that allows one to manually compute the exact numbers of fixed-symmetry derivatives for a given structure either with inclusion or ignoring the substitution patterns. The basic idea of the method suggested consists in the derivation of Pólya-like cycle indices for the automorphism groups of specially constructed orbit partition graphs; the expansion of these indices and subsequent simple calculations result in the desired numbers of substituted derivatives with achiral substituents. Limitations of the new technique (and a method suggested earlier) depend on the relevance of the orbit partitions for particular subgroups of the point symmetry group. For illustration purposes, the results obtained for the prismane (D _3h ) and adamantane (T _d ) structures are discussed. In the former case the numbers of substituted derivatives can be found for all subgroups of the D _3h group, whereas in the latter case these numbers can be determined for eight out of eleven subgroups of the T _d point symmetry group. This work is based on the text of the lecture presented by the authors at the 5th All-Russia Conference on Molecular Modeling (Moscow, April 2007). The paper deals with the methodology and detailed treatment of applied aspects related to solution of enumeration problems for substituted derivatives with prescribed symmetry groups. Unlike the known methods of symmetry specified enumeration, the technique suggested is simple enough and may be regarded as generalization of the Pólya methodology, which is widely used by chemists. Published in Russian in Izvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 227–245, February, 2008.     

关于曲线积分中值定理“中间点”的一个一般性结果

讨论了第一类曲线积分中值定理“中间点”的渐近性质,得到了更具一般性的新结果.     

Some remarks on indiscernible sequences

We prove a property of generic homogeneity of tuples starting an infinite indiscernible sequence in a simple theory and we use it to give a shorter proof of the Independence Theorem for Lascar strong types. We also characterize the relation of starting an infinite indiscernible sequence in terms of coheirs.