The zero-one law for a complete orthonormal system

A complete orthonormal system of functions $\Theta ={\left\{{\theta }_n\right\}}_{n=1}^{\infty }\text{,}{\theta }_n\in L_{[0\text{,}1]}^{\infty }$ is constructed such that ${\sum }_{n=1}^{\infty }{a}_n{\theta }_n$ converges almost everywhere on $[0\text{,}1]$ if ${\left\{a_n\right\}}_{n=1}^{\infty }\in l^2$ and ${\sum }_{n=1}^{\infty }{a}_n{\theta }_n$ diverges a.e. for any ${\left\{a_n\right\}}_{n=1}^{\infty }?l^2$. We also show that for any complete ONS ${\left\{f_n\right\}}_{n=1}^{\infty }$ of functions defined on $[0\text{,}1]$ there exists a fixed non decreasing subsequence ${\left\{n_k\right\}}_{k=1}^{\infty }$ of natural numbers such that for any $f\in L_{[0\text{,}1]}^0$ and some sequence of coefficients ${\left\{b_n\right\}}_{n=1}^{\infty }$,

$\sum _{n=1}^{n_k}{b}_n{f}_n\to f\text{a.e. when}k\to \infty \text{.}$

To cite this article: K. Kazarian, C. R. Acad. Sci. Paris, Ser. I 339 (2004).     

On the sum of reciprocals of least common multiples

Let ${\{a_i\}}_{i=1}^{\infty }$ be a strictly increasing sequence of positive integers ($a_i<a_j$ if $i<j$). In 1978, Borwein showed that for any positive integer n, we have ${\sum }_{i=1}^n\frac{1}{\mathrm{lcm}(a_i,a_{i+1})}\le 1?\frac{1}{2^n}$, with equality occurring if and only if $a_i=2^{i?1}$ for $1\le i\le n+1$. Let $3\le r\le 7$ be an integer. In this paper, we investigate the sum ${\sum }_{i=1}^n\frac{1}{\mathrm{lcm}(a_i,...,a_{i+r?1})}$ and show that ${\sum }_{i=1}^n\frac{1}{\mathrm{lcm}(a_i,...,a_{i+r?1})}\le U_r(n)$ for any positive integer n, where $U_r(n)$ is a constant depending on r and n. Further, for any integer $n\ge 2$, we also give a characterization of the sequence ${\{a_i\}}_{i=1}^{\infty }$ such that the equality ${\sum }_{i=1}^n\frac{1}{\mathrm{lcm}(a_i,...,a_{i+r?1})}=U_r(n)$ holds.     

Reconstruction and subgaussian processes

This Note presents a randomized method to approximate any vector v from some set $T\subset {\mathbb{R}}^n$. The data one is given is the set T, and k scalar products ${(〈X_i,v〉)}_{i=1}^k$, where ${(X_i)}_{i=1}^k$ are i.i.d. isotropic subgaussian random vectors in ${\mathbb{R}}^n$, and $k\ll n$. We show that with high probability any $y\in T$ for which ${(〈X_i,y〉)}_{i=1}^k$ is close to the data vector ${(〈X_i,v〉)}_{i=1}^k$ will be a good approximation of v, and that the degree of approximation is determined by a natural geometric parameter associated with the set T. This extends and improves recent results by Candes and Tao. To cite this article: S. Mendelson et al., C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Computing the Karcher mean of symmetric positive definite matrices

We present and analyze an iterative method for approximating the Karcher mean of a set of $n\times n$ positive definite matrices $A_i$, $i=1\text{,}\dots \text{,}k$, defined as the unique positive definite solution of the matrix equation ${\sum }_{i=1}^k\log (A_i^{-1}X)=0$.     

Longest cycles in 4-connected graphs

Let ${\sigma }_4^1=min\text{{}{\sum }_{i=1}^{4}d\left(v_i\right)+\left|{?}_{i=1}^{4}N\left(v_i\right)\right|?\left|{?}_{i=1}^{4}N\left(v_i\right)\right|:\{v_1,v_2,v_3,v_4\}$ is an independent set of a graph G$\text{}}$. In this paper, we give a low bound for the length of a longest cycle in a 4-connected graph and get the following result: If $G$ is a 4-connected graph on $n$ vertices, then the circumference $c\left(G\right)\ge min\{n,{\sigma }_4^1∕2\}$. Moreover, we give graphs to show that the connectivity in our result is best possible with respect to the low bound and the low bound in our result is also best possible with respect to the connectivity.     

On even (unitary) perfect polynomials over F2

We give all even perfect (resp. unitary perfect) polynomials over the prime field ${\mathbb{F}}_2$ of the form $x^a{(x+1)}^b{M}_1^{h_1}?M_r^{h_r}$, where each $M_i$ is a Mersenne irreducible polynomial, $h_i=2^{n_i}?1$ (resp. $h_i=2^{n_i}$) and $a,b,r,n_i\in \mathbb{N}$. In particular, we characterize nine of the eleven known “sporadic” even perfect polynomials over ${\mathbb{F}}_2$ that have the above form.     

The multipartite Ramsey number for the 3-path of length three

We study the Ramsey number for the 3-uniform loose path of length three, $P_3^3$, and $n$ colors. We show that $R(P_3^3;n)\le {\lambda }_{0}n+7\sqrt{n}$, for some explicit constant ${\lambda }_0=1.97466\dots$.     

Pruned discrete random samples

Let $X_i,i\in \mathbb{N}$, be independent and identically distributed random variables with values in ${\mathbb{N}}_0$. We transform (‘prune’) the sequence $\{X_1,\dots ,X_n\},n\in \mathbb{N}$, of discrete random samples into a sequence $\{0,1,2,\dots ,Y_n\},n\in \mathbb{N}$, of contiguous random sets by replacing $X_{n+1}$ with $Y_n+1$ if $X_{n+1}>Y_n$. We consider the asymptotic behaviour of $Y_n$ as $n\to \infty$. Applications include path growth in digital search trees and the number of tables in Pitmanʼs Chinese restaurant process if the latter is conditioned on its limit value.