On sub-harmonic bifurcations

Under fairly general hypotheses, we investigate by elementary methods the structure of the p-periodic orbits of a family $h_u$ of transformations near $(u_0,x_0)$ when $h_{u_0}(x_0)=x_0$ and $\mathrm{d}{h}_{u_0}(x_0)$ has a simple eigenvalue which is a primitive p-th root of unity. To cite this article: M. Chaperon et al., C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

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).     

La forme seconde trace d'une algèbre simple centrale de degré 4 de caractéristique 2

Let A be a central simple algebra of degree 4 over a field k of characteristic 2 and let $q_A$ be the quadratic form on A given by the second coefficient of the reduced characteristic polynomial. We show that A uniquely determines a 2-fold Pfister form $q_2$ and a 4-fold Pfister form $q_4$ such that $q_A=[1,1]+q_2+q_4$ in the Witt group of k, where $[1,1]$ is the form $x^2+xy+y^2$. The form $q_2$ is the norm form of the quaternion algebra Brauer-equivalent to $A{?}_{k}A$, and $q_4$ is hyperbolic if and only if A is cyclic. To cite this article: J.-P. Tignol, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

On low-dimensional cancellation problems

A well-known cancellation problem of Zariski asks when, for two given domains (fields) $K_1$ and $K_2$ over a field k, a k-isomorphism of $K_1[t]$ ($K_1(t)$) and $K_2[t]$ ($K_2(t)$) implies a k-isomorphism of $K_1$ and $K_2$. The main results of this article give affirmative answer to the two low-dimensional cases of this problem:1. Let K be an affine field over an algebraically closed field k of any characteristic. Suppose $K(t)?k(t_1,t_2,t_3)$, then $K?k(t_1,t_2)$.2. Let M be a 3-dimensional affine algebraic variety over an algebraically closed field k of any characteristic. Let $A=K[x,y,z,w]/M$ be the coordinate ring of M. Suppose $A[t]?k[x_1,x_2,x_3,x_4]$, then $\mathrm{frac}(A)?k(x_1,x_2,x_3)$, where $\mathrm{frac}(A)$ is the field of fractions of A.In the case of zero characteristic these results were obtained by Kang in [Ming-chang Kang, A note on the birational cancellation problem, J. Pure Appl. Algebra 77 (1992) 141–154; Ming-chang Kang, The cancellation problem, J. Pure Appl. Algebra 47 (1987) 165–171]. However, the case of finite characteristic is first settled in this article, that answered the questions proposed by Kang in [Ming-chang Kang, A note on the birational cancellation problem, J. Pure Appl. Algebra 77 (1992) 141–154; Ming-chang Kang, The cancellation problem, J. Pure Appl. Algebra 47 (1987) 165–171].     

Riemann–Hilbert approach for the Camassa–Holm equation on the line

We present a Riemann–Hilbert problem formalism for the initial value problem for the Camassa–Holm equation $u_t?u_{txx}+2\omega u_x+3u{u}_x=2u_x{u}_{xx}+u{u}_{xxx}$ on the line (CH). We show that: (i) for all $\omega >0$, the solution of this problem can be obtained in a parametric form via the solution of some associated Riemann–Hilbert problem; (ii) for large time, it develops into a train of smooth solitons; (iii) for small ω, this soliton train is close to a train of peakons, which are piecewise smooth solutions of the CH equation for $\omega =0$. To cite this article: A. Boutet de Monvel, D. Shepelsky, C. R. Acad. Sci. Paris, Ser. I 343 (2006).     

On several problems about automorphisms of the free group of rank two

Let $F_n$ be a free group of rank n generated by $x_1,\dots ,x_n$. In this paper we discuss three algorithmic problems related to automorphisms of $F_2$.A word $u=u(x_1,\dots ,x_n)$ of $F_n$ is called positive if no negative exponents of $x_i$ occur in u. A word u in $F_n$ is called potentially positive if $?(u)$ is positive for some automorphism ? of $F_n$. We prove that there is an algorithm to decide whether or not a given word in $F_2$ is potentially positive, which gives an affirmative solution to problem F34a in [G. Baumslag, A.G. Myasnikov, V. Shpilrain, Open problems in combinatorial group theory, second ed., in: Contemp. Math., vol. 296, 2002, pp. 1–38, online version: http://www.grouptheory.info] for the case of $F_2$.Two elements u and v in $F_n$ are said to be boundedly translation equivalent if the ratio of the cyclic lengths of $?(u)$ and $?(v)$ is bounded away from 0 and from ∞ for every automorphism ? of $F_n$. We provide an algorithm to determine whether or not two given elements of $F_2$ are boundedly translation equivalent, thus answering question F38c in the online version of [G. Baumslag, A.G. Myasnikov, V. Shpilrain, Open problems in combinatorial group theory, second ed., in: Contemp. Math., vol. 296, 2002, pp. 1–38, online version: http://www.grouptheory.info] for the case of $F_2$.We also provide an algorithm to decide whether or not a given finitely generated subgroup of $F_2$ is the fixed point group of some automorphism of $F_2$, which settles problem F1b in [G. Baumslag, A.G. Myasnikov, V. Shpilrain, Open problems in combinatorial group theory, second ed., in: Contemp. Math., vol. 296, 2002, pp. 1–38, online version: http://www.grouptheory.info] in the affirmative for the case of $F_2$.     

On L-functions of certain exponential sums

Let ${\mathbb{F}}_q$ denote the finite field of order q of characteristic p. We study the p-adic valuations for zeros of L-functions associated with exponential sums of the following family of Laurent polynomials$f(x)=a_1{x}_{n+1}(x_1+\frac{1}{x_1})+\cdots +a_n{x}_{n+1}(x_n+\frac{1}{x_n})+a_{n+1}{x}_{n+1}+\frac{1}{x_{n+1}}$ where $a_i\in {\mathbb{F}}_q^{⁎}$, $i=1,2,\dots ,n+1$. When $n=2$, the estimate of the associated exponential sum appears in Iwaniecʼs work on small eigenvalues of the Laplace–Beltrami operator acting on automorphic functions with respect to the group ${\Gamma }_0(p)$, and Adolphson and Sperber gave complex absolute values for zeros of the corresponding L-function. Using the decomposition theory of Wan, we determine the generic Newton polygon (q-adic values of the reciprocal zeros) of the L-function. Working on the chain level version of Dworkʼs trace formula and using Wanʼs decomposition theory, we are able to give an explicit Hasse polynomial for the generic Newton polygon in low dimensions, i.e., $n⩽3$.     

The coloring complex and cyclic coloring complex of a complete k-uniform hypergraph

In this paper, we study the homology of the coloring complex and the cyclic coloring complex of a complete k-uniform hypergraph. We show that the coloring complex of a complete k-uniform hypergraph is shellable, and we determine the rank of its unique nontrivial homology group in terms of its chromatic polynomial. We also show that the dimension of the $(n?k?1)\text{st}$ homology group of the cyclic coloring complex of a complete k-uniform hypergraph is given by a binomial coefficient. Further, we discuss a complex whose r-faces consist of all ordered set partitions $[B_1,\dots ,B_{r+2}]$ where none of the $B_i$ contain a hyperedge of the complete k-uniform hypergraph H and where $1\in B_1$. It is shown that the dimensions of the homology groups of this complex are given by binomial coefficients. As a consequence, this result gives the dimensions of the multilinear parts of the cyclic homology groups of $\mathbb{C}[x_1,\dots ,x_n]/\{x_{i_1}\dots x_{i_k}|i_1\dots i_k\text{is a hyperedge of}H\}$.     

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).     

L'électron habillé non relativiste dans un champ magnétique

We consider a nonrelativistic electron interacting with a classical magnetic field pointing along the $x_3$-axis and with a quantized electromagnetic field. Because of the translation invariance along the $x_3$-axis, we consider the reduced Hamiltonian associated with the total momentum along the $x_3$-axis and, after introducing an ultraviolet cutoff and an infrared regularization, we prove that the reduced Hamiltonian has a ground state if the coupling constant and the total momentum along the $x_3$-axis are sufficiently small. Finally, we determine the absolutely continuous spectrum of the reduced Hamiltonian and we prove that the renormalized mass of the electron is greater than its bare one. To cite this article: L. Amour et al., C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Regular expression constrained sequence alignment

We introduce regular expression constrained sequence alignment as the problem of finding the maximum alignment score between given strings $S_1$ and $S_2$ over all alignments such that in these alignments there exists a segment where some substring $s_1$ of $S_1$ is aligned to some substring $s_2$ of $S_2$, and both $s_1$ and $s_2$ match a given regular expression R, i.e. $s_1,s_2\in L(R)$ where $L(R)$ is the regular language described by R. For complexity results we assume, without loss of generality, that $n=|S_1|⩾|m|=|S_2|$. A motivation for the problem is that protein sequences can be aligned in a way that known motifs guide the alignments. We present an $\mathrm{O}(nmr)$ time algorithm for the regular expression constrained sequence alignment problem where $r=\mathrm{O}(t^4)$, and t is the number of states of a nondeterministic finite automaton N that accepts $L(R)$. We use in our algorithm a nondeterministic weighted finite automaton M that we construct from N. M has $\mathrm{O}(t^2)$ states where the transition-weights are obtained from the given costs of edit operations, and state-weights correspond to optimum alignment scores we compute using the underlying dynamic programming solution for sequence alignment. If we are given a deterministic finite automaton D accepting $L(R)$ with $t_d$ states then our construction creates a deterministic finite automaton $M_d$ with $t_d^2$ states. In this case, our algorithm takes $\mathrm{O}(t_d^{2}nm)$ time. Using $M_d$ results in faster computation than using M when $t_d<t^2$. If we only want to compute the optimum score, the space required by our algorithm is $\mathrm{O}(t^{2}n)$ ($\mathrm{O}(t_d^{2}m)$ if we use a given $M_d$). If we also want to compute an optimal alignment then our algorithm uses $\mathrm{O}(t^{2}m+t^2|s_1||s_2|)$ space ($\mathrm{O}(t_d^{2}m+t_d^2|s_1||s_2|)$ space if we use a given $M_d$) where $s_1$ and $s_2$ are substrings of $S_1$ and $S_2$, respectively, $s_1,s_2\in L(R)$, and $s_1$ and $s_2$ are aligned together in the optimal alignment that we construct. We also show that our method generalizes for the case of the problem with affine gap penalties, and for finding optimal regular expression constrained local sequence alignments.     

Weighted bilinear Hardy inequalities

We characterize the weights w, $w_1$, $w_2$ such that the weighted bilinear Hardy inequality$\left(\underset{a}{\overset{b}{\int }}\right(\underset{a}{\overset{x}{\int }}f{)}^q(\underset{a}{\overset{x}{\int }}g{)}^{q}w(x)dx{)}^{\frac{1}{q}}?C(\underset{a}{\overset{b}{\int }}{f}^{p_1}{w}_1{)}^{\frac{1}{p_1}}(\underset{a}{\overset{b}{\int }}{g}^{p_2}{w}_2{)}^{\frac{1}{p_2}}$ holds for all nonnegative functions f and g, with a positive constant C independent of f and g, for all possible values of q, $p_1$ and $p_2$ with $1<q,p_1,p_2<\infty$. We also characterize the good weights for the weighted bilinear n-dimensional Hardy inequality to hold.