On the longest common increasing binary subsequence

Let $X_1,X_2,\dots$ and $Y_1,Y_2,\dots$ be two independent sequences of iid Bernoulli random variables with parameter 1/2. Let ${\mathit{LCI}}_n$ be the length of the longest increasing sequence which is a subsequence of both finite sequences $X_1,\dots ,X_n$ and $Y_1,\dots ,Y_n$. We prove that, as n goes to infinity, $n^{?1/2}({\mathit{LCI}}_n?n/2)$ converges in law to a Brownian functional that we identify. To cite this article: C. Houdré et al., C. R. Acad. Sci. Paris, Ser. I 343 (2006).     

Estimation du nombre de dérivées d'un processus Gaussien

We consider a real Gaussian process X with unknown smoothness $r_0\in \mathbb{N}$ where the mean-square derivative $X^{(r_0)}$ is supposed to be Hölder continuous in quadratic mean. First, from the discrete observations $X(t_1),\dots ,X(t_n)$, we study reconstruction of $X(t)$, $t\in [0,1]$, with ${\stackrel{?}{X}}_r(t)$, a piecewise polynomial interpolation of degree $r?1$. We show that the mean-square error of interpolation is a decreasing function of r but becomes stable as soon as $r?r_0$. Next, from an interpolation-based empirical criterion, we derive an estimator $\stackrel{?}{r}$ of $r_0$ and prove its strong consistency by giving an exponential inequality for $P(\stackrel{?}{r}\ne r_0)$. Finally, we prove the strong convergence of ${\stackrel{?}{X}}_{\stackrel{?}{r}}(t)$ toward $X(t)$ with a similar rate as in the case ‘$r_0$ known’. To cite this article: D. Blanke, C. Vial, C. R. Acad. Sci. Paris, Ser. I 343 (2006).     

Distance-preserving approximations of polygonal paths

Given a polygonal path P with vertices $p_1,p_2,\dots ,p_n\in {\mathbb{R}}^d$ and a real number $t⩾1$, a path $Q=(p_{i_1},p_{i_2},\dots ,p_{i_k})$ is a t-distance-preserving approximation of P if $1=i_1<i_2<\cdots <i_k=n$ and each straight-line edge $(p_{i_j},p_{i_{j+1}})$ of Q approximates the distance between $p_{i_j}$ and $p_{i_{j+1}}$ along the path P within a factor of t. We present exact and approximation algorithms that compute such a path Q that minimizes k (when given t) or t (when given k). We also present some experimental results.     

Deformation of central charges,vertex operator algebras whose Griess algebras are Jordan algebras

If a vertex operator algebra $V={\oplus }_{n=0}^{\infty }{V}_n$ satisfies $\dim V_0=1$, $V_1=0$, then $V_2$ has a commutative (nonassociative) algebra structure called Griess algebra. One of the typical examples of commutative (nonassociative) algebras is a Jordan algebra. For example, the set ${\mathrm{Sym}}_d(\mathbb{C})$ of symmetric matrices of degree d becomes a Jordan algebra. On the other hand, in the theory of vertex operator algebras, central charges influence the properties of vertex operator algebras. In this paper, we construct vertex operator algebras with central charge c and its Griess algebra is isomorphic to ${\mathrm{Sym}}_d(\mathbb{C})$ for any complex number c and a positive integer d.     

On two families of bivariate distributions with exponential marginals: Aggregation and capital allocation

In this paper, we consider two main families of bivariate distributions with exponential marginals for a couple of random variables $(X_1,X_2)$. More specifically, we derive closed-form expressions for the distribution of the sum $S=X_1+X_2$, the TVaR of $S$ and the contributions of each risk under the TVaR-based allocation rule. The first family considered is a subset of the class of bivariate combinations of exponentials, more precisely, bivariate combinations of exponentials with exponential marginals. We show that several well-known bivariate exponential distributions are special cases of this family. The second family we investigate is a subset of the class of bivariate mixed Erlang distributions, namely bivariate mixed Erlang distributions with exponential marginals. For this second class of distributions, we propose a method based on the compound geometric representation of the exponential distribution to construct bivariate mixed Erlang distributions with exponential marginals. Notably, we show that this method not only leads to Moran–Downton’s bivariate exponential distribution, but also to a generalization of this bivariate distribution. Moreover, we also propose a method to construct bivariate mixed Erlang distributions with exponential marginals from any absolutely continuous bivariate distributions with exponential marginals. Inspired from Lee and Lin (2012), we show that the resulting bivariate distribution approximates the initial bivariate distribution and we highlight the advantages of such an approximation.     

Régularité conditionnelle des équations de Navier–Stokes

In this Note, we give sufficient conditions for the regularity of Leray–Hopf weak solutions to the Navier–Stokes equation. We prove that, if one of three conditions (i) $?u/?x_3\in L_t^{s_0}{L}_x^{r_0}$ where $2/s_0+3/r_0?2$ and $9/4?r_0?3$, (ii) $\mathrm{?}{u}_3\in L_t^{s_1}{L}_x^{r_1}$ where $2/s_1+3/r_1?11/6$ and $54/23?r_0?18/5$, or (iii) $u_3\in L_t^{s_0}{L}_x^{r_0}$ where $2/s_0+3/r_0?5/8$ and $24/5?r_0?\infty$, is satisfied, then the solution is regular. These conditions improve earlier results on the conditional regularity of the Navier–Stokes equations. To cite this article: I. Kukavica, M. Ziane, C. R. Acad. Sci. Paris, Ser. I 343 (2006).     

A note on conservative galaxies,Skolem systems,cyclic cycle decompositions,and Heffter arrays

The conservative number of a graph $G$ is the minimum positive integer $M$, such that $G$ admits an orientation and a labeling of its edges by distinct integers in $\{1,2,\dots ,M\}$, such that at each vertex of degree at least three, the sum of the labels on the in-coming edges is equal to the sum of the labels on the out-going edges. A graph is conservative if $M=\left|E\left(G\right)\right|$. It is worth noting that determining whether certain biregular graphs are conservative is equivalent to find integer Heffter arrays.In this work we show that the conservative number of a galaxy (a disjoint union of stars) of size $M$ is $M$ for $M\equiv 0$, $3(mod4)$, and $M+1$ otherwise. Consequently, given positive integers $m_1$, $m_2$, …, $m_n$ with $m_i\ge 3$ for $1\le i\le n$, we construct a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of infinitely many circulant graphs, generalizing a result of Bryant, Gavlas and Ling (2003). In particular, it allows us to construct a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of the complete graph $K_{2M+1}$, where $M={\sum }_{i=1}^n{m}_i$. Also, we prove necessary and sufficient conditions for the existence of a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of $K_{2M+2}?F$, where $F$ is a 1-factor. Furthermore, we give a sufficient condition for a subset of ${\mathbb{Z}}_v?\left\{0\right\}$ to be sequenceable.     

On the geography of threefolds of general type

Let X be a complex nonsingular projective 3-fold of general type. We show that there are positive constants c, $c^{\prime }$ and $m_1$ such that $\chi ({\omega }_X)??c\mathrm{Vol}(X)$ and $P_m(X)?c^{\prime }{m}^3\mathrm{Vol}(X)$ for all $m?m_1$.