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 Value Problems for Ordinary Differential Equations with Deviated Arguments

We discuss differential equations with nonlinear boundary conditions. We formulate sufficient conditions under which problems with deviating arguments have quasisolutions or solutions. To obtain the results, we apply the method of monotone iterations.     

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.     

Chiroptical properties of steroid 1,3-diaxial diols in the presence of [Mo2(OAc)4]

Summary Bidentate complexes of dimolybdenum tetraacetate with 1,3-diaxial diols show Cotton effects around 490–540 nm (CD band I), 400–440 nm (II), 350–380 nm (III), 320 nm (IV) and 280 nm (V). The sign of the Cotton effect II can be predicted by a proposed sector rule. It seems that from the Cotton effects for cyclic 1,3-diols the absolute configurations or conformations can be obtained.A part of this material was presented at III-rd International Conference on CD Spectroscopy [1]     

Multinuclear magnetic resonance study of some mesoionic oxatriazoles containing nitrogenous exocyclic groups

¹H,¹³C,¹⁴N and¹⁵N NMR measurements are reported for four mesoionic 1-oxa-2, 3, 4-triazoles containing exocyclic nitrogenous groups. The NMR signal assignments are discussed and compared with those previously published for some corresponding oxatriazoles. The results obtained support the proposed cyclic mesoionic structures for the compounds studied. The questions of possible charge delocalization and valence tautomerism are addressed. Compound with N^– H as a exocyclic group (Fig. 1) is found to be relatively unstable, this is attributed to proton migration in the corresponding non-cyclic form of this molecule.Published in Khimiya Geterotsikiicheskikh Soedinenii, No. 9, pp. 1260–1263, September, 1995.     

Parallel and superfast algorithms for Hankel systems of equations

Summary Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n ²) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log² n) complexity asymptotically fast ones. All algorithms work without additional assumption (like strong nonsingularity).