Multilevel frames for sparse tensor product spaces

For Au = f with an elliptic differential operator and stochastic data f, the m-point correlation function of the random solution u satisfies a deterministic equation with the m-fold tensor product operator A ^(m) of A. Sparse tensor products of hierarchic FE-spaces in are known to allow for approximations to which converge at essentially the rate as in the case m = 1, i.e. for the deterministic problem. They can be realized by wavelet-type FE bases (von Petersdorff and Schwab in Appl Math 51(2):145–180, 2006; Schwab and Todor in Computing 71:43–63, 2003). If wavelet bases are not available, we show here how to achieve the fast computation of sparse approximations of for Galerkin discretizations of A by multilevel frames such as BPX or other multilevel preconditioners of any standard FEM approximation for A. Numerical examples illustrate feasibility and scope of the method.     

On nonsymmetric saddle point matrices that allow conjugate gradient iterations

Linear systems in saddle point form are usually highly indefinite,which often slows down iterative solvers such as Krylov subspace methods. It has been noted by several authors that negating the second block row of a symmetric indefinite saddle point matrix leads to a nonsymmetric matrix ${{\mathcal A}}Linear systems in saddle point form are usually highly indefinite,which often slows down iterative solvers such as Krylov subspace methods. It has been noted by several authors that negating the second block row of a symmetric indefinite saddle point matrix leads to a nonsymmetric matrix whose spectrum is entirely contained in the right half plane. In this paper we study conditions so that is diagonalizable with a real and positive spectrum. These conditions are based on necessary and sufficient conditions for positive definiteness of a certain bilinear form,with respect to which is symmetric. In case the latter conditions are satisfied, there exists a well defined conjugate gradient (CG) method for solving linear systems with . We give an efficient implementation of this method, discuss practical issues such as error bounds, and present numerical experiments. In memory of Gene Golub (1932–2007), our wonderful friend and colleague, who had a great interest in the conjugate gradient method and the numerical solution of saddle point problems. The work of J?rg Liesen was supported by the Emmy Noether-Program and the Heisenberg-Program of the Deutsche Forschungsgemeinschaft.     

Minimal non-$${\mathcal {F}}$$ -groups

Let be a saturated formation. We describe minimal non- -, minimal non- -, and minimal non-metabelian groups. Dedicated to L. A. Shemetkov on the occasion of his seventieth birthday.     

Plane polynomial automorphisms of fixed multidegree

Let be the group of polynomial automorphisms of the complex affine plane. On one hand, can be endowed with the structure of an infinite dimensional algebraic group (see Shafarevich in Math USSR Izv 18:214–226, 1982) and on the other hand there is a partition of according to the multidegree (see Friedland and Milnor in Ergod Th Dyn Syst 9:67–99, 1989). Let denote the set of automorphisms whose multidegree is equal to d. We prove that is a smooth, locally closed subset of and show some related results. We give some applications to the study of the varieties (resp. ) of automorphisms whose degree is equal to m (resp. is less than or equal to m).     

Reduced Minimum Modulus Preserving in Banach Space

Let be the algebra of all bounded linear operators on a complex Banach space X and γ(T) be the reduced minimum modulus of operator . In this work, we prove that if , is a surjective linear map such that is an invertible operator, then , for every , if and only if, either there exist two bijective isometries and such that for every , or there exist two bijective isometries and such that for every . This generalizes for a Banach space the Mbekhta’s theorem [12].      

$${\mathcal{C}}_{0}$$ ( X)-algebras,stability and strongly self-absorbing $${\mathcal{C}}^{*}$$ -algebras

We study permanence properties of the classes of stable and so-called -stable -algebras, respectively. More precisely, we show that a (X)-algebra A is stable if all its fibres are, provided that the underlying compact metrizable space X has finite covering dimension or that the Cuntz semigroup of A is almost unperforated (a condition which is automatically satisfied for -algebras absorbing the Jiang–Su algebra tensorially). Furthermore, we prove that if is a K ₁-injective strongly self-absorbing -algebra, then A absorbs tensorially if and only if all its fibres do, again provided that X is finite-dimensional. This latter statement generalizes results of Blanchard and Kirchberg. We also show that the condition on the dimension of X cannot be dropped. Along the way, we obtain a useful characterization of when a -algebra with weakly unperforated Cuntz semigroup is stable, which allows us to show that stability passes to extensions of -absorbing -algebras. Research supported by: Deutsche Forschungsgemeinschaft (through the SFB 478), by the EU-Network Quantum Spaces - Noncommutative Geometry (Contract No. HPRN-CT-2002-00280), and by the Center for Advanced Studies in Mathematics at Ben-Gurion University     

Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems

A complete classification of the computational complexity of the fixed-point existence problem for Boolean dynamical systems, i.e., finite discrete dynamical systems over the domain {0, 1}, is presented. For function classes and graph classes , an ()-system is a Boolean dynamical system such that all local transition functions lie in and the underlying graph lies in . Let be a class of Boolean functions which is closed under composition and let be a class of graphs which is closed under taking minors. The following dichotomy theorems are shown: (1) If contains the self-dual functions and contains the planar graphs, then the fixed-point existence problem for ()-systems with local transition function given by truth-tables is NP-complete; otherwise, it is decidable in polynomial time. (2) If contains the self-dual functions and contains the graphs having vertex covers of size one, then the fixed-point existence problem for ()-systems with local transition function given by formulas or circuits is NP-complete; otherwise, it is decidable in polynomial time.      

On pointed Hopf algebras associated with the symmetric groups

Let G be the symmetric group . It is an important open problem whether the dimension of the Nichols algebra is finite when is the class of the transpositions and ρ is the sign representation, with m ≥ 6. In the present paper, we discard most of the other conjugacy classes showing that very few pairs might give rise to finite-dimensional Nichols algebras. This work was partially supported by CONICET, ANPCyT and Secyt (UNC).     

Transitivity of Jordan Algebras of Linear Operators: On Two Questions by Grünenfelder, Omladič and Radjavi

Let be a Jordan algebra of linear operators on a vector space over a field of characteristic different from 2. In this short note, we show that (1) if is 2-transitive, then it is dense, and (2) if is n-transitive, n ≥ 1, then a nonzero Jordan ideal of is also n-transitive. These answer two questions posed by Grünenfelder, Omladič and Radjavi. The second author was partially supported by National Science Council, Taiwan, grant #095- 2811-M-006-005.     

On the Circumference of 2-Connected $$\mathcal{P}_{3}$$-Dominated Graphs

Let G be a connected graph. For at distance 2, we define , and , if then . G is quasi-claw-free if it satisfies , and G is P ₃-dominated() if it satisfies , for every pair (x, y) of vertices at distance 2. Certainly contains as a subclass. In this paper, we prove that the circumference of a 2-connected P ₃-dominated graph G on n vertices is at least min or , moreover if then G is hamiltonian or , where is a class of 2-connected nonhamiltonian graphs.     

Partitions of large Rado graphs

Let κ be a cardinal which is measurable after generically adding many Cohen subsets to κ and let be the κ-Rado graph. We prove, for 2 ≤ m < ω, that there is a finite value such that the set [κ] ^m can be partitioned into classes such that for any coloring of any of the classes C _i in fewer than κ colors, there is a copy of in such that is monochromatic. It follows that , that is, for any coloring of with fewer than κ colors there is a copy of such that has at most colors. On the other hand, we show that there are colorings of such that if is any copy of then for all , and hence . We characterize as the cardinality of a certain finite set of types and obtain an upper and a lower bound on its value. In particular, and for m > 2 we have where r _m is the corresponding number of types for the countable Rado graph. Research of M. Džamonja and J. A. Larson were partially supported by Engineering and Physical Sciences Research Council and research of W. J. Mitchell was partly supported by grant number DMS 0400954 from the United States National Science Foundation.     

Homogeneous spaces and degree 4 del Pezzo surfaces

It is known that, given a genus 2 curve , where f(x) is quintic and defined over a field K, of characteristic different from 2, and given a homogeneous space for complete 2-descent on the Jacobian of , there is a V _δ (which we shall describe), which is a degree 4 del Pezzo surface defined over K, such that . We shall prove that every degree 4 del Pezzo surface V, defined over K, arises in this way; furthermore, we shall show explicitly how, given V, to find and δ such that V =  V _δ , up to a linear change in variable defined over K. We shall also apply this relationship to Hürlimann’s example of a degree 4 del Pezzo surface violating the Hasse principle, and derive an explicit parametrised infinite family of genus 2 curves, defined over , whose Jacobians have nontrivial members of the Shafarevich-Tate group. This example will differ from previous examples in the literature by having only two -rational Weierstrass points. The author thanks EPSRC for support: grant number EP/F060661/1.     

Characterizing cryptogroups with a finite number of $${\mathcal{H}}$$ -classes in each $${\mathcal{D}}$$ -class by their subsemigroups

We construct a family of completely regular semigroups with the property that each completely regular semigroup S with a finite number of -classes in each -class is non-cryptic if and only if S contains an isomorphic image of a member of . Each member F of is an ideal extension of a Rees matrix semigroup J by a cyclic group B with a zero adjoined and the identity of B is the identity of F. Here with I and Λ finite, G is given by generators and relations, and P is given explicitly. Within completely regular semigroups, the cryptic property is equivalent to where is the natural partial order and a if and only if a ² = ab = ba. Hence the above result can be formulated in terms of and .      

$${\mathcal{R}}$$ -boundedness,pseudodifferential operators,and maximal regularity for some classes of partial differential operators

It is shown that an elliptic scattering operator A on a compact manifold with boundary with operator valued coefficients in the morphisms of a bundle of Banach spaces of class () and Pisier’s property (α) has maximal regularity (up to a spectral shift), provided that the spectrum of the principal symbol of A on the scattering cotangent bundle avoids the right half-plane. This is accomplished by representing the resolvent in terms of pseudodifferential operators with -bounded symbols, yielding by an iteration argument the -boundedness of λ(A−λ)⁻¹ in for some . To this end, elements of a symbolic and operator calculus of pseudodifferential operators with -bounded symbols are introduced. The significance of this method for proving maximal regularity results for partial differential operators is underscored by considering also a more elementary situation of anisotropic elliptic operators on with operator valued coefficients.     

Dy namic of Abelia n Subgroups of GL( n, $$\mathbb{C}$$): A Structure Theorem

In this paper, we characterize the dynamic of every Abelian subgroups of , or . We show that there exists a -invariant, dense open set U in saturated by minimal orbits with a union of at most n -invariant vector subspaces of of dimension n−1 or n−2 over . As a consequence, has height at most n and in particular it admits a minimal set in . This work is supported by the research unit: systèmes dynamiques et combinatoire: 99UR15-15     

On the Intertwining of \partial{\mathcal{D}}-Isometries

Let be a strictly pseudoconvex bounded domain in with C ² boundary . If a subnormal m-tuple T of Hilbert space operators has the spectral measure of its minimal normal extension N supported on , then T is referred to as a -isometry. Using some non-trivial approximation theorems in the theory of several complex variables, we establish a commutant lifting theorem for those -isometries whose (joint) Taylor spectra are contained in a special superdomain Ω of . Further, we provide a function-theoretic characterization of those subnormal tuples whose Taylor spectra are contained in Ω and that are quasisimilar to a certain (fixed) -isometry T (of which the multiplication tuple on the Hardy space of the unit ball in is a rather special example). Submitted: September 9, 2007. Revised: October 10, 2007. Accepted: October 24, 2007.     

Semicrossed products of simple C*-algebras

Let and be C*-dynamical systems and assume that is a separable simple C*-algebra and that α and β are *-automorphisms. Then the semicrossed products and are isometrically isomorphic if and only if the dynamical systems and are outer conjugate. K. R. Davidson was partially supported by an NSERC grant. E. G. Katsoulis was partially supported by a summer grant from ECU     

$${\mathcal{M}}$$ -decomposability and symmetric unimodal densities in one dimension

In this paper, we introduce the notion of -decomposability of probability density functions in one dimension. Using -decomposability, we derive an inequality that applies to all symmetric unimodal densities. Our inequality involves only the standard deviation of the densities concerned. The concept of -decomposability can be used as a non-parametric criterion for mode-finding and cluster analysis.     

Numerically satisfactory solutions of Kummer recurrence relations

Pairs of numerically satisfactory solutions as for the three-term recurrence relations satisfied by the families of functions , , are given. It is proved that minimal solutions always exist, except when and z is in the positive or negative real axis, and that is minimal as whenever . The minimal solution is identified for any recurrence direction, that is, for any integer values of and . When the confluent limit , with fixed, is the main tool for identifying minimal solutions together with a connection formula; for , is the main tool to be considered.