On the semiclassical approximation to the eigenvalue gap of Schrödinger operators

We consider two types of Schrödinger operators $H(t)=?d^2/d{x}^2+q(x)+t\cos x$ and $H(t)=?d^2/d{x}^2+q(x)+A\cos (tx)$ defined on $L^2(\mathbb{R})$, where q is an even potential that is bounded from below, A is a constant, and $t>0$ is a parameter. We assume that $H(t)$ has at least two eigenvalues below its essential spectrum; and we denote by ${\lambda }_1(t)$ and ${\lambda }_2(t)$ the lowest eigenvalue and the second one, respectively. The purpose of this paper is to study the asymptotics of the gap $\Gamma (t)={\lambda }_2(t)?{\lambda }_1(t)$ in the limit as $t\to \infty$.     

Inviscid limit for the derivative Ginzburg–Landau equation with small data in modulation and Sobolev spaces

Applying the frequency-uniform decomposition technique, we study the Cauchy problem for derivative Ginzburg–Landau equation $u_t=(\nu +\mathrm{i})\mathrm{\Delta }u+{\overrightarrow{\lambda }}_1?\mathrm{?}({|u|}^{2}u)+({\overrightarrow{\lambda }}_2?\mathrm{?}u){|u|}^2+\alpha {|u|}^{2\delta }u$, where $\delta \in \mathbb{N}$, ${\overrightarrow{\lambda }}_1,{\overrightarrow{\lambda }}_2$ are complex constant vectors, $\nu \in [0,1]$, $\alpha \in \mathbb{C}$. For $n\ge 3$, we show that it is uniformly global well posed for all $\nu \in [0,1]$ if initial data $u_0$ in modulation space $M_{2,1}^s$ and Sobolev spaces $H^{s+n/2}$ ($s>3$) and $6u_0{6}_{L^2}$ is small enough. Moreover, we show that its solution will converge to that of the derivative Schrödinger equation in $C(0,T;L^2)$ if $\nu \to 0$ and $u_0$ in $M_{2,1}^s$ or $H^{s+n/2}$ with $s>4$. For $n=2$, we obtain the local well-posedness results and inviscid limit with the Cauchy data in $M_{1,1}^s$ ($s>3$) and $6u_0{6}_{L^1}?1$.     

Some asymptotic properties for solutions of one-dimensional advection–diffusion equations with Cauchy data in Lp(R)

We state and discuss a number of fundamental asymptotic properties of solutions $u(?,t)$ to one-dimensional advection–diffusion equations of the form $u_t+f{(u)}_x=(a{(u)u_x)}_x$, $x\in \mathbb{R}$, $t>0$, assuming initial values $u(?,0)=u_0\in L^p(\mathbb{R})$ for some $1?p<\infty$. To cite this article: P. Braz e Silva, P.R. Zingano, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

Codes defined by forms of degree 2 on Hermitian surfaces and Sørensen's conjecture

We study the functional codes $C_h(X)$ defined by Lachaud in [G. Lachaud, Number of points of plane sections and linear codes defined on algebraic varieties, in: Arithmetic, Geometry, and Coding Theory, Luminy, France, 1993, de Gruyter, Berlin, 1996, pp. 77–104] where $X\subset {\mathbb{P}}^N$ is an algebraic projective variety of degree d and dimension m. When X is a Hermitian surface in $\mathit{PG}(3,q)$, Sørensen in [A.B. Sørensen, Rational points on hypersurfaces, Reed–Muller codes and algebraic-geometric codes, PhD thesis, Aarhus, Denmark, 1991], has conjectured for $h⩽t$ (where $q=t^2$) the following result:$\mathrm{\#}{X}_{Z(f)}({\mathbb{F}}_q)⩽h(t^3+t^2-t)+t+1$ which should give the exact value of the minimum distance of the functional code $C_h(X)$. In this paper we resolve the conjecture of Sørensen in the case of quadrics (i.e. $h=2$), we show the geometrical structure of the minimum weight codewords and their number; we also estimate the second weight and the geometrical structure of the codewords reaching this second weight.     

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.