Extending analyticK-subanalytic functions

Letg:U→ℝ (U open in ℝⁿ) be an analytic and K-subanalytic (i. e. definable in ℝ _an ^K , whereK, the field of exponents, is any subfield ofℝ) function. Then the set of points, denoted Σ, whereg does not admit an analytic extension is K-subanalytic andg can be extended analytically to a neighbourhood of Ū\∑. Partially supported by the European RTN Network RAAG (contract no. HPRN-CT-00271)     

On L2-cohomology and Property (T) for Automorphism Groups of Polyhedral Cell Complexes

We present an update of Garland's work on the cohomology of certain groups, construct a class of groups many of which satisfy Kazhdan's Property (T) and show that properly discontinuous and cocompact groups of automorphisms of (4,4) or (6,3)-complexes do not satisfy Property (T). Submitted: September 1996, final version: March 1997     

On the number of full levels in tries

We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2^k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log_1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Chern numbers for two families of noncommutative Hopf fibrations

We consider noncommutative line bundles associated with the Hopf fibrations of SU_q(2) over all Podle? spheres and with a locally trivial Hopf fibration of S³_pq. These bundles are given as finitely generated projective modules associated via 1-dimensional representations of U(1) with Galois-type extensions encoding the principal fibrations of SU_q(2) and S³_pq. We show that the Chern numbers of these modules coincide with the winding numbers of representations defining them. To cite this article: P.M. Hajac et al., C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

Boundary G/G Theory and Topological Poisson–Lie Sigma Model

We study a boundary version of the gauged WZW model with a Poisson–Lie group G as the target. The Poisson–Lie structure of G is used to define the Wess–Zumino term of the action on surfaces with boundary. We clarify the relation of the model to the topological Poisson sigma model with the dual Poisson–Lie group G ^* as the target and show that the phase space of the theory on a strip is essentially the Heisenberg double of G introduced by Semenov–Tian–Shansky.     

Algebraic models of smooth manifolds

Research supported by the NSF Grant DMS-8602672     

Chaı̂nes de Markov TripletTriplet Markov Chains

The Hidden Markov Chains (HMC) are widely applied in various problems. This succes is mainly due to the fact that the hidden process can be recovered even in the case of very large set of data. These models have been recetly generalized to ‘Pairwise Markov Chains’ (PMC) model, which admit the same processing power and a better modeling one. The aim of this note is to propose further generalization called Triplet Markov Chains (TMC), in which the distribution of the couple (hidden process, observed process) is the marginal distribution of a Markov chain. Similarly to HMC, we show that posterior marginals are still calculable in Triplets Markov Chains. We provide a necessary and sufficient condition that a TMC is a PMC, which shows that the new model is strictly more general. Furthermore, a link with the Dempster–Shafer fusion is specified. To cite this article: W. Pieczynski, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 275–278.     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18