On three-manifolds dominated by circle bundles

We determine which three-manifolds are dominated by products. The result is that a closed, oriented, connected three-manifold is dominated by a product if and only if it is finitely covered either by a product or by a connected sum of copies of S ² × S ¹. This characterization can also be formulated in terms of Thurston geometries, or in terms of purely algebraic properties of the fundamental group. We also determine which three-manifolds are dominated by non-trivial circle bundles, and which three-manifold groups are presentable by products.     

Transforming trees by successive local complementations

A local complementation of a simple graph G at a vertex v consists in replacing the subgraph induced by G on the neighborhood of v by the complementary graph. Two graphs are locally equivalent if they are related by a sequence of local complementations. H. M. Mulder conjectured that any two locally equivalent trees are isomorphic. We prove this conjecture and we characterize those graphs that are locally equivalent to trees.     

Triangular Cm interpolation by rational functions

Two general local C^m triangular interpolation schemes by rational functions from C^m data are proposed for any nonnegative integer m. The schemes can have either 2m+1 order algebraic precision if the required data are given on vertices and edges, or m+E[m/2]+1 or m+1 order algebraic precision if the data are given only at vertices. The orders of the interpolation error are estimated. Examples that show the correctness and effectiveness of the scheme are presented. Supported partially by NSFC under Project 1967108 and Croucher Foundation of Hong Kong; Supported also by FRG of Hong Kong Paptist University.     

Jordan Superalgebras Defined by Brackets

Jordan superalgebras defined by brackets on associative commutativesuperalgebras are studied. It is proved that any such superalgebrais imbedded into a superalgebra defined by Poisson brackets.In particular, all Jordan superalgebras of brackets are i-special.The speciality of these superalgebras is also examined, andit is proved, in particular, that the Cheng–Kac superalgebrais special.     

M-solid varieties generated by lattices

Following W. Taylor, we define an identity to be hypersatisfied by a variety V iff, whenever the operation symbols of V are replaced by arbitrary terms (of appropriate arity) in the operations of V, then the resulting identity is satisfied by V in the usual sense. Whenever the identity is hypersatisfied by a variety V, we shall say that is a hyperidentity of V, or a V hyperidentity. When the terms being substituted are restricted to a submonoid M of all the possible choices, is called an M-hyperidentity, and a variety V is M-solid if each identity is an M-hyperidentity. In this paper we examine the solid varieties whose identities are lattice M-hyperidentities. The M-solid varieties generated by the variety of lattices in this way provide new insight on the construction and representation of various known classes of non-commutative lattices. Received October 8, 1999; accepted in final form March 22, 2000.     

Filtrations induced by continuous functions

In Persistent Homology and Topology, filtrations are usually given by introducing an ordered collection of sets or a continuous function from a topological space to Rⁿ${\mathbb{R}}^n$. A natural question arises, whether these approaches are equivalent or not. In this paper we study this problem and prove that, while the answer to the previous question is negative in the general case, the approach by continuous functions is not restrictive with respect to the other, provided that some natural stability and completeness assumptions are made. In particular, we show that every compact and stable 1-dimensional filtration of a compact metric space is induced by a continuous function. Moreover, we extend the previous result to the case of multi-dimensional filtrations, requiring that our filtration is also complete. Three examples show that we cannot drop the assumptions about stability and completeness. Consequences of our results on the definition of a distance between filtrations are finally discussed.     

Stochastic processes indexed by hypergroups II

Further results on weakly stationary processes indexed by hypergroups are presented. The concept of translation operators is developed; processes on orbit spaces and double coset spaces are constructed. It is shown that every weakly stationary process indexed by a hypergroupK with centerC contains a maximalK//C-weakly stationary component. New examples forK-weakly stationary processes are continuous estimates of the mean of a weakly stationary process, isotropic random fields, andK-oscillations.     

Understanding Distributions by Modeling Them

In current curriculum materials for middle school students in the US, data and chance are considered as separate topics. They are then ideally brought together in the minds of high school or university students when they learn about statistical inference. In recent studies we have been attempting to build connections between data and chance in the middle school by using a modeling approach made possible by new software capabilities that will be part of TinkerPlots 2.0 (TinkerPlots is published by Key Curriculum Press and has been developed with grants from the National Science Foundation (ESI-9818946, REC-0337675, ESI-0454754). Opinions expressed here are our own and not necessarily those of the Foundation.). Using a new Sampler object, students build “factories” to model not only prototypical chance events, but also distributions of measurement errors and of heights of people. We provide the rationale for having students model a wide range of phenomena using a single software tool and describe how we are using this capability to help young students develop a robust, statistical perspective.     

Approximation by chaotic operators and by conjugate classes

We show that every bounded linear operator on a separable, infinite-dimensional Hilbert space H is the sum of two operators in the norm-closure of the set of operators on H that are chaotic in the sense of Devaney. We also observe that the density of several classes of cyclic operators, with respect to the strong operator topology, may be derived from a result by Hadwin et al. (Proc Amer. Math. Soc. 76 (1979) 250-252).     

Stabilizing network bargaining games by blocking players

Cooperative matching games (Shapley and Shubik) and Network bargaining games (Kleinberg and Tardos) are games described by an undirected graph, where the vertices represent players. An important role in such games is played by stable graphs, that are graphs whose set of inessential vertices (those that are exposed by at least one maximum matching) are pairwise non adjacent. In fact, stable graphs characterize instances of such games that admit the existence of stable outcomes. In this paper, we focus on stabilizing instances of the above games by blocking as few players as possible. Formally, given a graph G we want to find a minimum cardinality set of vertices such that its removal from G yields a stable graph. We give a combinatorial polynomial-time algorithm for this problem, and develop approximation algorithms for some NP-hard weighted variants, where each vertex has an associated non-negative weight. Our approximation algorithms are LP-based, and we show that our analysis are almost tight by giving suitable lower bounds on the integrality gap of the used LP relaxations.     

Computing elliptic integrals by duplication

Summary Logarithms, arctangents, and elliptic integrals of all three kinds (including complete integrals) are evaluated numerically by successive applications of the duplication theorem. When the convergence is improved by including a fixed number of terms of Taylor's series, the error ultimately decreases by a factor of 4096 in each cycle of iteration. Except for Cauchy principal values there is no separation of cases according to the values of the variables, and no serious cancellations occur if the variables are real and nonnegative. Only rational operations and square roots are required. An appendix contains a recurrence relation and two new representations (in terms of elementary symmetric functions and power sums) forR-polynomials, as well as an upper bound for the error made in truncating the Taylor series of anR-function.     

Normed rings generated by generalized convolutions

Normed rings are considered that are generated by the generalized shift operation that occurs in the study of the analytic properties of Urbanik algebras. Possible applications are illustrated by the example of a counterpart of the classical criterion of positive definiteness and by an inversion formula for generalized characteristic functions of Urbanik.Translated from Problemy Ustoichivosti Stokhasticheskikh Modelei — Trudy Seminara, pp. 12–18, 1980.The author expresses his sincere gratitude to A. A. Zinger for his interest.     

Approximation Methods by Regular Functions

This paper is a survey of approximation results and methods by smooth functions in Banach spaces. The topics considered in the paper are the following: approximation by polynomials by C^k-functions using the method of smooth partitions of unity, approximation by the fine topology, analytic approximation and regularization in Banach spaces using the infimal convolution method.     

Frameworks Restorable by a Single Stress

Hinged constructions in R ^d having pinned joints and admitting internal stresses are studied. A conjecture about the existence of a restoring stress for a linear framework restorable by its internal stress space is proved. In the case of arbitrary dimension, a sufficient condition for the existence of a restoring stress is given. A number of properties of the set of frameworks restorable by an internal stress are established. New problems are formulated. Bibliography: 7 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 299, 2003, pp. 169–192.     

Patterning by genetic networks

We consider here the morphogenesis (pattern formation) problem for some genetic network models. First, we show that any given spatio‐temporal pattern can be generated by a genetic network involving a sufficiently large number of genes. Moreover, patterning process can be performed by an effective algorithm. We also show that Turing's or Meinhardt's type reaction–diffusion models can be approximated by genetic networks. These results exploit the fundamental fact that the genes form functional units and are organized in blocks. Due to this modular organization, the genes always are capable to construct any new patterns and even any time sequences of new patterns from old patterns. Computer simulations illustrate some analytical results. Copyright © 2005 John Wiley & Sons, Ltd.     

Coloring by two-way independent sets

The paper stems from an attempt to investigate a somewhat mysterious phenomenon: conditions which suffice for the existence of a “large” set satisfying certain conditions (e.g., a large independent set in a graph) often suffice (or at least are conjectured to suffice) for the existence of a covering of the ground set by few sets satisfying these conditions (in the example of independent sets in a graph this means that the graph has small chromatic number). We consider two conjectures of this type, on coloring by sets which are “two-way independent”, in the sense of belonging to a matroid and at the same time being independent in a graph sharing its ground set with the matroid. We prove these conjectures for matroids of rank 2. We also consider dual conjectures, on packing bases of a matroid, which are independent in a given graph.     

Stochastic Volterra equations driven by cylindrical Wiener process

In this paper, stochastic Volterra equations driven by cylindrical Wiener process in Hilbert space are investigated. Sufficient conditions for existence of strong solutions are given. The key role is played by convergence of α-times resolvent families. Both authors are supported partially by project “Proyecto Anillo: Laboratorio de Analisis Estocastico; ANESTOC”.     

Ordering trees by the Laplacian coefficients

Motivated by a Mohar’s paper proposing “how to order trees by the Laplacian coefficients”, we investigate a partial ordering of trees with diameters 3 and 4 by the Laplacian coefficients. These results are used to determine several orderings of trees by the Laplacian coefficients.     

3-Lie Algebras Realized by Cubic Matrices

Associative multiplications of cubic matrices are provided. The N3-dimensional 3-Lie algebras are realized by cubic matrices, and structures of the 3-Lie algebras are studied.