Subgroups of Word Hyperbolic Groups in Dimension 2

If G is a word hyperbolic group of cohomological dimension 2,then every subgroup of G of type FP₂ is also word hyperbolic.Isoperimetric inequalities are defined for groups of type FP₂and it is shown that the linear isoperimetric inequality inthis generalized context is equivalent to word hyperbolicity.A sufficient condition for hyperbolicity of a general graphis given along with an application to ‘relative hyperbolicity’.Finitely presented subgroups of Lyndon's small cancellationgroups of hyperbolic type are word hyperbolic. Finitely presentedsubgroups of hyperbolic 1-relator groups are hyperbolic. Finitelypresented subgroups of free Burnside groups are finite in thestable range.     

Principe de Hartogs dans les variétés CR

Let M be a CR manifold. The main results of this paper are the following:

When M is real analytic, a semi-global Hartogs extension phenomenon occurs for real analytic CR functions if and only if M is nowhere strictly pseudoconvex and .

When M is a standard manifold, the Hartogs–Bochner extension phenomenon occurs for non-CR-confined domains if and only if M is nowhere strictly pseudoconvex and dim_CRM2.

If M is a smooth submanifold of foliated by complex curves, a semi-global Hartogs–Bochner extension phenomenon occurs for smooth non-CR-confined domains if and only if dim_CRM2.

If M is a real analytic nowhere strictly pseudoconvex manifold and if Ω is a sufficiently small domain in M, a hyperfunction which is real analytic in a neighborhood of bΩ and CR in a neighborhood of is in fact real analytic on Ω.

Application of semi-definite programming to robust stability of delay systems

We study here robust stability of linear systems with several uncertain incommensurate delays, more precisely the property usually called delay-dependent stability. The main result of this paper consists in establishing that the latter is equivalent to the feasibility of some Linear Matrix Inequality (LMI), a convex optimization problem whose numerical solution is well documented.The method is based on two main techniques:

• use of Padé approximation to transform the system into some singularly perturbed finite-dimensional system, for which robust dichotomy has to be checked;

• recursive applications of Generalized Kalman–Yakubovich–Popov (KYP) lemma to characterise by an LMI the previous property.

A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

We present a simple new algorithm for triangulating polygons and planar straightline graphs, It provides "shape" and "size" guarantees:

• All triangles have a bounded aspect ratio.

• The number of triangles is within a constant factor of optimal.

Such "quality" triangulations are desirable as meshes for the finite element method, in which the running time generally increases with the number of triangles, and where the convergence and stability may be hurt by very skinny triangles. The technique we use-successive refinement of a Delaunay triangulation-extends a mesh generation technique of Chew by allowing triangles of varying sizes. Compared with previous quadtree-based algorithms for quality mesh generation, the Delaunay refinement approach is much simpler and generally produces meshes with fewer triangles. We also discuss an implementation of the algorithm and evaluate its performance on a variety of inputs.     

Orthogonal polynomials and Gaussian quadrature for refinable weight functions

We show how to compute the modified moments of a refinable weight function directly from its mask in O(N²n) rational operations, where N is the desired number of moments and n the length of the mask. Three immediate applications of such moments are:

• the expansion of a refinable weight function as a Legendre series;

• the generation of the polynomials orthogonal with respect to a refinable weight function;

• the calculation of Gaussian quadrature formulas for refinable weight functions.

In the first two cases, all operations are rational and can in principle be performed exactly.

The symplectic reduced spaces of a Poisson actionLes espaces réduits symplectiques d'une action de Poisson

During the last thirty years, symplectic or Marsden–Weinstein reduction has been a major tool in the construction of new symplectic manifolds and in the study of mechanical systems with symmetry. This procedure has been traditionally associated to the canonical action of a Lie group on a symplectic manifold, in the presence of a momentum map. In this Note we show that the symplectic reduction phenomenon has much deeper roots. More specifically, we will find symplectically reduced spaces purely within the Poisson category under hypotheses that do not necessarily imply the existence of a momentum map. In other words, the right category to obtain symplectically reduced spaces is that of Poisson manifolds acted upon canonically by a Lie group. To cite this article: J.-P. Ortega, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 999–1004.     

On spaces which are linearly D

We introduce a generalization of D-spaces, which we call linearly D-spaces. The following results are obtained for a T₁-space X.

– X is linearly Lindelöf if, and only if, X is a linearly D-space of countable extent.

– X is linearly D provided that X is submetaLindelöf.

– X is linearly D provided that X is the union of finitely many linearly D-subspaces.

– X is compact provided that X is countably compact and X is the union of countably many linearly D-subspaces.

Localization for Involutions in Floer Cohomology

We consider Lagrangian Floer cohomology for a pair of Lagrangian submanifolds in a symplectic manifold M. Suppose that M carries a symplectic involution, which preserves both submanifolds. Under various topological hypotheses, we prove a localization theorem for Floer cohomology, which implies a Smith-type inequality for the Floer cohomology groups in M and its fixed point set. Two applications to symplectic Khovanov cohomology are included.     

Stochastic control of funding systems

This paper is concerned with funding systems, i.e. systems which accumulate funds for the future payment of financial obligations. Commonly, such funding requires a balance between (1) the desire to minimise the contributions that need to be diverted from other use to the support of the Fund, and (2) the need to maintain reasonable solvency in the Fund.Such funding is discussed here in a general framework. Applications are numerous. The specific applications mentioned in the paper are:

• Defined benefit retirement funding,

• Maintenance of a prudential margin by a non-life insurer,

• Dividend payment strategy.

The paper applies stochastic optimal control theory to determine how rates of contribution to the Fund and allocation of its assets by asset sector should respond to changing solvency. These results are obtainable from a particular differential equation, which may be solved numerically. Detailed numerical examples are provided.     

Considerations on the application of the chaos paradigm to describe the postural sway

Time-series of statokinesigram (SKG) of healthy subjects and parkinsonians are investigated and compared. This is done by employing the chaos paradigm in order to obtain the main characteristics of the SKG. The interpretation of our findings is twofold:

when a proper Theiler window is not used we find a virtual invariance of the chaos parameters when healthy subjects and parkinsonians are compared but a discrepancy of our values (correlation dimension equals to 1.4) with those found in previous works;

when a proper Theiler window is used (more) appropriately, the SKGs do not show a convergence of the fractal dimension estimates; therefore nothing can be said in terms of chaoticity of system.

Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

This article settles the following two longstanding open problems:

• What is the worst case approximation ratio between the greedy triangulation and the minimum weight triangulation?

• Is there a polynomial time algorithm that always produces a triangulation whose length is within a constant factor from the minimum?

The answer to the first question is that the known lower bound is tight. The second question is answered in the affirmative by using a slight modification of anO(n log n) algorithm for the greedy triangulation. We also derive some other interesting results. For example, we show that a constant-factor approximation of the minimum weight convex partition can be obtained within the same time bounds.     

Generalized symmetry of graphs — A survey

Symmetry of graphs has been extensively studied over the past fifty years by using automorphisms of graphs and group theory which have played and still play an important role for graph theory, and promising and interesting results have been obtained, see for examples, [L.W. Beineke, R.J. Wilson, Topics in Algebraic Graph Theory, Cambridge University Press, London, 2004; N. Biggs, Algebraic Graph Theory, Cambridge University Press, London, 1993; C. Godsil, C. Royle, Algebraic graph theory, Springer-Verlag, London, 2001; G. Hahn, G. Sabidussi, Graph Symmetry: Algebraic Methods and Application, in: NATO ASI Series C, vol. 497, Kluwer Academic Publishers, Dordrecht, 1997]. We introduced generalized symmetry of graphs and investigated it by using endomorphisms of graphs and semigroup theory. In this paper, we will survey some results we have achieved in recent years. The paper consists of the following sections.

1. Introduction

2. End-regular graphs

3. End-transitive graphs

4. Unretractive graphs

5. Graphs and their endomorphism monoids.

The fixed point property in -triples and preduals of -triples

We prove that for every member X in the class of real or complex JB^*-triples or preduals of JBW^*-triples, the following assertions are equivalent:

(1) X has the fixed point property.

(2) X has the super fixed point property.

(3) X has normal structure.

(4) X has uniform normal structure.

(5) The Banach space of X is reflexive.

As a consequence, a real or complex C^*-algebra or the predual of a real or complex W^*-algebra having the fixed point property must be finite-dimensional.

Dynamic Point Location in General Subdivisions

The dynamic planar point location problem is the task of maintaining a dynamic set S of n nonintersecting (except possibly at endpoints) line segments in the plane under the following operations:

• Locate (: point): Report the segment immediately above , i.e., the first segment intersected by an upward vertical ray starting at ;

• Insert (: segment): Add segment to the collection of segments;

• Delete (: segment): Remove segment from the collection of segments.

We present a solution which requires space O(n) and has query and insertion time O(log n log log n) and deletion time O(log²n). The bounds for insertions and deletions are amortized. A query time below O(log²n) was previously only known for monotone subdivisions and subdivisions consisting of horizontal segments and required nonlinear space.     

Trade-off between sample size and accuracy: Case of measurements under interval uncertainty

In many practical situations, we are not satisfied with the accuracy of the existing measurements. There are two possible ways to improve the measurement accuracy:

• First, instead of a single measurement, we can make repeated measurements; the additional information coming from these additional measurements can improve the accuracy of the result of this series of measurements.

• Second, we can replace the current measuring instrument with a more accurate one; correspondingly, we can use a more accurate (and more expensive) measurement procedure provided by a measuring lab – e.g., a procedure that includes the use of a higher quality reagent.

In general, we can combine these two ways, and make repeated measurements with a more accurate measuring instrument. What is the appropriate trade-off between sample size and accuracy? This is the general problem that we address in this paper.     

Boundedness of Riesz transforms for elliptic operators on abstract Wiener spaces

Let (E,H,μ) be an abstract Wiener space and let D_V:=VD, where D denotes the Malliavin derivative and V is a closed and densely defined operator from H into another Hilbert space . Given a bounded operator B on , coercive on the range , we consider the operators A:=V^*BV in H and in , as well as the realisations of the operators and in L^p(E,μ) and respectively, where 1<p<∞. Our main result asserts that the following four assertions are equivalent:

(1) with for ;

(2) admits a bounded H^∞-functional calculus on ;

(3) with for ;

(4) admits a bounded H^∞-functional calculus on .

Moreover, if these conditions are satisfied, then . The equivalence (1)–(4) is a non-symmetric generalisation of the classical Meyer inequalities of Malliavin calculus (where , V=I, ). A one-sided version of (1)–(4), giving L^p-boundedness of the Riesz transform in terms of a square function estimate, is also obtained. As an application let −A generate an analytic C₀-contraction semigroup on a Hilbert space H and let −L be the L^p-realisation of the generator of its second quantisation. Our results imply that two-sided bounds for the Riesz transform of L are equivalent with the Kato square root property for A. The boundedness of the Riesz transform is used to obtain an L^p-domain characterisation for the operator L.

Symplectic homology and periodic orbits near symplectic submanifolds

We show that a small neighborhood of a closed symplectic submanifold in a geometrically bounded aspherical symplectic manifold has non-vanishing symplectic homology. As a consequence, we establish the existence of contractible closed characteristics on any thickening of the boundary of the neighborhood. When applied to twisted geodesic flows on compact symplectically aspherical manifolds, this implies the existence of contractible periodic orbits for a dense set of low energy values.     

Almost Complex Manifolds and Hyperbolicity

One of the sufficient conditions for a complex manifold to be (complete) hyperbolic (in the sense that its intrinsic pseudo-distance is a (complete) distance) is that it admits a (complete) Hermitian metric with holomorphic sectional curvature bounded above by a negative constant. The concept of hyperbolicity can be readily extended to almost complex manifolds. We will show that the above result for hyperbolicity can be generalized to the almost complex case. As an application, we prove that every point of an almost complex manifold has a complete hyperbolic neighborhood. In real dimension 4, this fact was established by Debalme and Ivashkovich [2] by a completely different method.     

Hyperbolic topology of normed linear spaces

In a previous paper [H. Tsuiki, Y. Hattori, Lawson topology of the space of formal balls and the hyperbolic topology of a metric space, Theoret. Comput. Sci. 405 (2008) 198–205], the authors introduced the hyperbolic topology on a metric space, which is weaker than the metric topology and naturally derived from the Lawson topology on the space of formal balls. In this paper, we characterize spaces L_p(Ω,Σ,μ) on which the hyperbolic topology induced by the norm _p coincides with the norm topology. We show the following:

(1) The hyperbolic topology and the norm topology coincide for 1<p<∞.

(2) They coincide on L₁(Ω,Σ,μ) if and only if μ(Ω)=0 or Ω has a finite partition by atoms.

(3) They coincide on L_∞(Ω,Σ,μ) if and only if μ(Ω)=0 or there is an atom in Σ.

On the pullback equation

We discuss the existence of a diffeomorphism such that

φ^*(g)=f