A new regularity criterion for weak solutions to the Navier–Stokes equations

In this paper we obtain a new regularity criterion for weak solutions to the 3-D Navier–Stokes equations. We show that if any one component of the velocity field belongs to $L^{\alpha }([0,T);L^{\gamma }({\mathbb{R}}^3))$ with $\raisebox{1ex}{$2$}\!\left/ \!\raisebox{-1ex}{$\alpha $}\right.+\raisebox{1ex}{$3$}\!\left/ \!\raisebox{-1ex}{$\gamma $}\right.⩽\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$2$}\right.$, $6<\gamma ⩽\infty$, then the weak solution actually is regular and unique.     

Counting numerical semigroups by genus and even gaps

Let $n_g$ be the number of numerical semigroups of genus $g$. We present an approach to compute $n_g$ by using even gaps, and the question: Is it true that $n_{g+1}>n_g$? is investigated. Let $N_{\gamma }\left(g\right)$ be the number of numerical semigroups of genus $g$ whose number of even gaps equals $\gamma$. We show that $N_{\gamma }\left(g\right)=N_{\gamma }\left(3\gamma \right)$ for $\gamma \le ?g∕3?$ and $N_{\gamma }\left(g\right)=0$ for $\gamma >?2g∕3?$; thus the question above is true provided that $N_{\gamma }(g+1)>N_{\gamma }\left(g\right)$ for $\gamma =?g∕3?+1,\dots ,?2g∕3?$. We also show that $N_{\gamma }\left(3\gamma \right)$ coincides with $f_{\gamma }$, the number introduced by Bras-Amorós (2012) in connection with semigroup-closed sets. Finally, the stronger possibility $f_{\gamma }～{\phi }^{2\gamma }$ arises being $\phi =(1+\sqrt{5})∕2$ the golden number.     

Improving the Clark–Suen bound on the domination number of the Cartesian product of graphs

A long-standing Vizing’s conjecture asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers; one of the most significant results related to the conjecture is the bound of Clark and Suen, $\gamma (G\square H)\ge \gamma \left(G\right)\gamma \left(H\right)∕2$, where $\gamma$ stands for the domination number, and $G\square H$ is the Cartesian product of graphs $G$ and $H$. In this note, we improve this bound by employing the 2-packing number $\rho \left(G\right)$ of a graph $G$ into the formula, asserting that $\gamma (G\square H)\ge (2\gamma \left(G\right)?\rho \left(G\right))\gamma \left(H\right)∕3$. The resulting bound is better than that of Clark and Suen whenever $G$ is a graph with $\rho \left(G\right)<\gamma \left(G\right)∕2$, and in the case $G$ has diameter 2 reads as $\gamma (G\square H)\ge (2\gamma \left(G\right)?1)\gamma \left(H\right)∕3$.     

Coloration des graphes de reines

Until 2003 no chromatic numbers (${\chi }_n$) for the queen graphs were available for $n>9$ except where n is not a multiple of 2 or 3. In this research announcement we present an exact algorithm which provides coloring solutions for $n=12,14,15,16,18,20,21,22,24,26,28$ and 32 such as ${\chi }_n=n$. Then we prove that there exists an infinite number of values for n such that $n=2p$ or $n=3p$, and ${\chi }_n=n$. To cite this article: M. Vasquez, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

A new approach to the chromatic number of the square of Kneser graph K(2k+1,k)

The vertices of Kneser graph $K(n,k)$ are the subsets of $\{1,2,\dots ,n\}$ of cardinality $k$, two vertices are adjacent if and only if they are disjoint. The square $G^2$ of a graph $G$ is defined on the vertex set of $G$ with two vertices adjacent if their distance in $G$ is at most 2. Z. Füredi, in 2002, proposed the problem of determining the chromatic number of the square of the Kneser graph. The first non-trivial problem arises when $n=2k+1$. It is believed that $\chi \left(K^2(2k+1,k)\right)=2k+c$ where $c$ is a constant, and yet the problem remains open. The best known upper bounds are by Kim and Park: $8k∕3+20∕3$ for 1$k\ge 3$ (Kim and Park, 2014) and $32k∕15+32$ for $k\ge 7$ (Kim and Park, 2016). In this paper, we develop a new approach to this coloring problem by employing graph homomorphisms, cartesian products of graphs, and linear congruences integrated with combinatorial arguments. These lead to $\chi \left(K^2(2k+1,k)\right)\le 5k∕2+c$, where $c$ is a constant in $\{5∕2,9∕2,5,6\}$, depending on $k\ge 2$.     

Almost sure convergence of the largest and smallest eigenvalues of high-dimensional sample correlation matrices

In this paper, we show that the largest and smallest eigenvalues of a sample correlation matrix stemming from $n$ independent observations of a $p$-dimensional time series with iid components converge almost surely to ${(1+\sqrt{\gamma })}^2$ and ${(1?\sqrt{\gamma })}^2$, respectively, as $n\to \infty$, if $p∕n\to \gamma \in (0,1]$ and the truncated variance of the entry distribution is “almost slowly varying”, a condition we describe via moment properties of self-normalized sums. Moreover, the empirical spectral distributions of these sample correlation matrices converge weakly, with probability $1$, to the Mar?enko–Pastur law, which extends a result in Bai and Zhou (2008). We compare the behavior of the eigenvalues of the sample covariance and sample correlation matrices and argue that the latter seems more robust, in particular in the case of infinite fourth moment. We briefly address some practical issues for the estimation of extreme eigenvalues in a simulation study.In our proofs we use the method of moments combined with a Path-Shortening Algorithm, which efficiently uses the structure of sample correlation matrices, to calculate precise bounds for matrix norms. We believe that this new approach could be of further use in random matrix theory.