Blow up for the critical generalized Korteweg–de Vries equation. I: Dynamics near the soliton

We consider the quintic generalized Korteweg–de Vries equation (gKdV) $$u_t + (u_{xx} + u^5)_x =0,$$ which is a canonical mass critical problem, for initial data in H ¹ close to the soliton. In earlier works on this problem, finite- or infinite-time blow up was proved for non-positive energy solutions, and the solitary wave was shown to be the universal blow-up profile, see [16], [26] and [20]. For well-localized initial data, finite-time blow up with an upper bound on blow-up rate was obtained in [18]. In this paper, we fully revisit the analysis close to the soliton for gKdV in light of the recent progress on the study of critical dispersive blow-up problems (see [31], [39], [32] and [33], for example). For a class of initial data close to the soliton, we prove that three scenarios only can occur: (i) the solution leaves any small neighborhood of the modulated family of solitons in the scale invariant L ² norm; (ii) the solution is global and converges to a soliton as t → ∞; (iii) the solution blows up in finite time T with speed $$\|u_x(t)\|_{L^2} \sim \frac{C(u_0)}{T-t} \quad {\rm as}\, t\to T.$$ Moreover, the regimes (i) and (iii) are stable. We also show that non-positive energy yields blow up in finite time, and obtain the characterization of the solitary wave at the zero-energy level as was done for the mass critical non-linear Schrödinger equation in [31].     

The Mixed Curvatures on C N

The aim of the present paper is devoted to the investigation of some geometrical properties on the middle envelope in terms of the invariants of the third quadratic form of the normal line congruence C_N . The mixed middle curvature and mixed curvature on C_N are obtained in tenus of the Mean and Gauss curvatures of the surface of reference. Our study is considered as a continuation to Stephanidis ([1], [2], [3], [4], [5]). The technique adapted here is based on the methods of moving frames and their related exteriour forms [6] and [7].     

A symmetry property for q-weighted Robinson–Schensted and other branching insertion algorithms

In [19], a \(q\) -weighted version of the Robinson–Schensted algorithm was introduced. In this paper, we show that this algorithm has a symmetry property analogous to the well-known symmetry property of the usual Robinson–Schensted algorithm. The proof uses a generalisation of the growth diagram approach introduced by Fomin [5–8]. This approach, which uses ‘growth graphs’, can also be applied to a wider class of insertion algorithms which have a branching structure, including some of the other \(q\) -weighted versions of the Robinson–Schensted algorithm which have recently been introduced by Borodin–Petrov [2].     

Critical branching Brownian motion with absorption: survival probability

We consider branching Brownian motion on the real line with absorption at zero, in which particles move according to independent Brownian motions with the critical drift of \(-\sqrt{2}\) . Kesten (Stoch Process 7:9–47, 1978) showed that almost surely this process eventually dies out. Here we obtain upper and lower bounds on the probability that the process survives until some large time \(t\) . These bounds improve upon results of Kesten (Stoch Process 7:9–47, 1978), and partially confirm nonrigorous predictions of Derrida and Simon (EPL 78:60006, 2007).     

Right-convergence of sparse random graphs

The paper is devoted to the problem of establishing right-convergence of sparse random graphs. This concerns the convergence of the logarithm of number of homomorphisms from graphs or hyper-graphs \(\mathbb{G }_N, N\ge 1\) to some target graph \(W\) . The theory of dense graph convergence, including random dense graphs, is now well understood (Borgs et al. in Ann Math 176:151–219, 2012; Borgs et al. in Adv Math 219:1801–1851, 2008; Chatterjee and Varadhan in Eur J Comb 32:1000–1017, 2011; Lovász and Szegedy in J Comb Theory Ser B 96:933–957, 2006), but its counterpart for sparse random graphs presents some fundamental difficulties. Phrased in the statistical physics terminology, the issue is the existence of the limits of appropriately normalized log-partition functions, also known as free energy limits, for the Gibbs distribution associated with \(W\) . In this paper we prove that the sequence of sparse Erdös-Rényi graphs is right-converging when the tensor product associated with the target graph \(W\) satisfies a certain convexity property. We treat the case of discrete and continuous target graphs \(W\) . The latter case allows us to prove a special case of Talagrand’s recent conjecture [more accurately stated as level III Research Problem 6.7.2 in his recent book (Talagrand in Mean Field Models for Spin Glasses: Volume I: Basic examples. Springer, Berlin, 2010)], concerning the existence of the limit of the measure of a set obtained from \(\mathbb{R }^N\) by intersecting it with linearly in \(N\) many subsets, generated according to some common probability law. Our proof is based on the interpolation technique, introduced first by Guerra and Toninelli (Commun Math Phys 230:71–79, 2002) and developed further in (Abbe and Montanari in On the concentration of the number of solutions of random satisfiability formulas, 2013; Bayati et al. in Ann Probab Conference version in Proceedings of 42nd Ann. Symposium on the Theory of Computing (STOC), 2010; Contucci et al. in Antiferromagnetic Potts model on the Erdös-Rényi random graph, 2011; Franz and Leone in J Stat Phys 111(3/4):535–564, 2003; Franz et al. in J Phys A Math Gen 36:10967–10985, 2003; Montanari in IEEE Trans Inf Theory 51(9):3221–3246, 2005; Panchenko and Talagrand in Probab Theory Relat Fields 130:312–336, 2004). Specifically, Bayati et al. (Ann Probab Conference version in Proceedings of 42nd Ann. Symposium on the Theory of Computing (STOC), 2010) establishes the right-convergence property for Erdös-Rényi graphs for some special cases of \(W\) . In this paper most of the results in Bayati et al. (Ann Probab Conference version in Proceedings of 42nd Ann. Symposium on the Theory of Computing (STOC), 2010) follow as a special case of our main theorem.     

On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs

Motzkin and Straus established a remarkable connection between the maximum clique and the Graph-Lagrangian of a graph in (Can. J. Math. 17:533–540, 1965). This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique number in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we provide upper bounds on the Graph-Lagrangian of a hypergraph containing dense subgraphs when the number of edges of the hypergraph is in certain ranges. These results support a pair of conjectures introduced by Peng and Zhao (Graphs Comb. 29:681–694, 2013) and extend a result of Talbot (Comb. Probab. Comput. 11:199–216, 2002).     

Further results on factorization of meromorphic solutions of partial differential equations

This paper is a continuation of Hu-Yang [2]. Here we extend Malmquist type theorem ofalgebraic differential equations of Steinmetz [3] and Tu [4] to higher order partial differential equations. The results also generalize Theorems 4.2 and 4.3 in [2].     

Vector partition functions and generalized dahmen and micchelli spaces

This is the first of a series of papers on partition functions and the index theory of transversally elliptic operators. In this paper we only discuss algebraic and combinatorial issues related to partition functions. The applications to index theory are in [4], while in [5] and [6] we shall investigate the cohomological formulas generated by this theory. Here we introduce a space of functions on a lattice which generalizes the space of quasipolynomials satisfying the difference equations associated to cocircuits of a sequence of vectors X, introduced by Dahmen and Micchelli [8]. This space $ \mathcal{F}(X) $ contains the partition function $ {\mathcal{P}_{(X)}} $ . We prove a “localization formula” for any f in $ \mathcal{F}(X) $ , inspired by Paradan's decomposition formula [12]. In particular, this implies a simple proof that the partition function $ {\mathcal{P}_{(X)}} $ is a quasi-polynomial on the Minkowski differences $ \mathfrak{c} - B(X) $ , where c is a big cell and B(X) is the zonotope generated by the vectors in X, a result due essentially to Dahmen and Micchelli.     

The Totally Nonnegative Part of G/P is a CW Complex

The totally nonnegative part of a partial ag variety G/P has been shown in [18], [17] to be a union of semialgebraic cells. Moreover, the closure of a cell was shown in [19] to be a union of smaller cells. In this paper we provide glueing maps for each of the cells to prove that (G/P)_?0 is a CW complex. This generalizes a result of Postnikov, Speyer and the second author [15] for Grassmannians.     

Computing Final Polynomials and Final Syzygies Using Buchberger’s Gröbner Bases Method

Final polynomials and final syzygies provide an explicit representation of polynomial identities promised by Hilbert’s Nullstellensatz. Such representations have been studied independently by Bokowski [2,3,4] and Whiteley [23,24] to derive invariant algebraic proofs for statements in geometry. In the present paper we relate these methods to some recent developments in computational algebraic geometry. As the main new result we give an algorithm based on B. Buchberger’s Gröbner bases method for computing final polynomials and final syzygies over the complex numbers. Degree upper bound for final polynomials are derived from theorems of Lazard and Brownawell, and a topological criterion is proved for the existence of final syzygies. The second part of this paper is expository and discusses applications of our algorithm to real projective geometry, invariant theory and matrix theory.     

Transfinite Extension to Q m-normality Theory

The theory of Q _m-normal families, m ∈ ?, was developed by P. Montel for the cases m = 0 (normal families) [5] and m = 1 (quasinormal families) [4] and later generalized by C.T. Chuang [2] for any m ≥ 0. In this paper, we extend the definition to an arbitrary ordinal number α as follows. Given E ? D, define the α-th derived set $E^{(\alpha)}_D$ of E with respect to D by $(E^{(\alpha-1)}_D)^{(1)}_D$ if α has an immediate predecessor and by ${\mathop \bigcap\limits_{\beta<\alpha}} E^{(\beta)}_D$ if α is a limit ordinal. Then a family ${\cal F}$ of meromorphic functions on a plane domain D is Q_α-normal if each sequence S of functions in ${\cal F}$ has a subsequence which converges locally χ-uniformaly on the domain DE, where E = E(S) ? D satisfies $E^{(\alpha)}_{D}=\emptyset$ . Inparticular, a Q ₀ -normal family is a normal family, and a Q ₁ -normal family is a quasi- normal family. We also give analogues to some basic results in Q_m-normality theory and extend Zalcman’s Lemma to Q _α -normal families where α is an infinite countable (enumerable) ordinal number.     

A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces

We consider the two-player, complete information game of Cops and Robber played on undirected, finite, reflexive graphs. A number of cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if, after a move, a cop and the robber are on the same vertex. The minimum number of cops needed to catch the robber on a graph is called the cop number of that graph. Let c(g) be the supremum over all cop numbers of graphs embeddable in a closed orientable surface of genus g, and likewise ${\tilde c(g)}$ for non-orientable surfaces. It is known (Andreae, 1986) that, for a fixed surface, the maximum over all cop numbers of graphs embeddable in this surface is finite. More precisely, Quilliot (1985) showed that c(g) ≤ 2g + 3, and Schröder (2001) sharpened this to ${c(g)\le \frac32g + 3}$ . In his paper, Andreae gave the bound ${\tilde c(g) \in O(g)}$ with a weak constant, and posed the question whether a stronger bound can be obtained. Nowakowski & Schröder (1997) obtained ${\tilde c(g) \le 2g+1}$ . In this short note, we show ${\tilde c(g) \leq c(g-1)}$ , for any g ≥ 1. As a corollary, using Schröder’s results, we obtain the following: the maximum cop number of graphs embeddable in the projective plane is 3, the maximum cop number of graphs embeddable in the Klein Bottle is at most 4, ${\tilde c(3) \le 5}$ , and ${\tilde c(g) \le \frac32g + 3/2}$ for all other g.     

Algebraic Hecke characters and strictly compatible systems of abelian mod p Galois representations over global fields

In [10] (C R Acad Sci Paris Ser I Math 323(2) 117–120, 1996), [11] (Math Res Lett 10(1):71–83 2003), [12] (Can J Math 57(6):1215–1223 2005), Khare showed that any strictly compatible systems of semisimple abelian mod p Galois representations of a number field arises from a unique finite set of algebraic Hecke characters. In this article, we consider a similar problem for arbitrary global fields. We give a definition of Hecke character which in the function field setting is more general than previous definitions by Goss and Gross and define a corresponding notion of compatible system of mod p Galois representations. In this context we present a unified proof of the analog of Khare’s result for arbitrary global fields. In a sequel we shall apply this result to strictly compatible systems arising from Drinfeld modular forms, and thereby attach Hecke characters to cuspidal Drinfeld Hecke eigenforms.     

The Mellin Transform and Spectral Properties of Toric Varieties

In this paper we apply the results of [W] on the twisted Mellin transform to problems in toric geometry. In particular, we use these results to describe the asymptotics of probability densities associated with the monomial eigenstates, z ^k , $ k \in \mathbb{Z}^{d} $ , in Bargmann space and prove an “upstairs” version of the spectral density theorem of [BGU]. We also obtain for the z ^k ’s, “upstairs” versions of the results of [STZ] on distribution laws for eigenstates on toric varieties.     

Further remarks on the non-degeneracy condition

The structure of the set of positive solutions of the semilinear elliptic boundary value problem depends on a certain non-degeneracy condition, which was proved by K.J. Brown [2] and T. Ouyang and J. Shi [12], with a shorter proof given later by P. Korman [8]. In this note we present a more general result, communicated to us by L. Nirenberg [13]. We also discuss the extensions in cases when the domain D is in R ², and it is either symmetric or convex.     

p-adic logarithmic forms and a problem of Erdős

For any natural number m(>1) let P(m) denote the greatest prime divisor of m. By the problem of Erd?s in the title of the present paper we mean the general version of his problem, that is, his conjecture from 1965 that $$\frac{P(2^n-1)}{n} \to \infty \quad {\rm as}\, n \to \infty$$ (see Erd?s [10]) and its far-reaching generalization to Lucas and Lehmer numbers. In the present paper the author delivers three refinements upon Yu [40] required by C. L. Stewart for solving completely the problem of Erd?s (see Stewart [25]). The author gives also some remarks on the solution of this problem, aiming to be more streamlined with respect to the p-adic theory of logarithmic forms.     

Bounds of Singular Integrals on Weighted Hardy Spaces and Discrete Littlewood–Paley Analysis

We apply the discrete version of Calderón??s reproducing formula and Littlewood?CPaley theory with weights to establish the $H^{p}_{w} \to H^{p}_{w}$ (0<p<??) and $H^{p}_{w}\to L^{p}_{w}$ (0<p??1) boundedness for singular integral operators and derive some explicit bounds for the operator norms of singular integrals acting on these weighted Hardy spaces when we only assume w??A _??. The bounds will be expressed in terms of the A _q constant of w if q>q _w =inf?{s:w??A _s }. Our results can be regarded as a natural extension of the results about the growth of the A _p constant of singular integral operators on classical weighted Lebesgue spaces $L^{p}_{w}$ in Hytonen et al. (arXiv:1006.2530, 2010; arXiv:0911.0713, 2009), Lerner (Ill.?J.?Math. 52:653?C666, 2008; Proc. Am. Math. Soc. 136(8):2829?C2833, 2008), Lerner et?al. (Int.?Math. Res. Notes 2008:rnm 126, 2008; Math. Res. Lett. 16:149?C156, 2009), Lacey et?al. (arXiv:0905.3839v2, 2009; arXiv:0906.1941, 2009), Petermichl (Am. J. Math. 129(5):1355?C1375, 2007; Proc. Am. Math. Soc. 136(4):1237?C1249, 2008), and Petermichl and Volberg (Duke Math. J. 112(2):281?C305, 2002). Our main result is stated in Theorem?1.1. Our method avoids the atomic decomposition which was usually used in proving boundedness of singular integral operators on Hardy spaces.     

Approximating the maximum size of a k-regular induced subgraph by an upper bound on the co-k-plex number

Let ?? _k and $ {\hat{\alpha }_k} $ denote respectively the maximum cardinality of a k-regular induced subgraph and the co-k-plex number of a given graph. In this paper, we introduce a convex quadratic programming upper bound on $ {\hat{\alpha }_k} $ , which is also an upper bound on ?? _k . The new bound denoted by $ {\hat{\upsilon }_k} $ improves the bound ?? _k given in [3]. For regular graphs, we prove a necessary and sufficient condition under which $ {\hat{\upsilon }_k} $ equals ?? _k . We also show that the graphs for which $ {\hat{\alpha }_k} $ equals $ {\hat{\upsilon }_k} $ coincide with those such that ?? _k equals ?? _k . Next, an improvement of $ {\hat{\upsilon }_k} $ denoted by $ {\hat{\vartheta }_k} $ is proposed, which is not worse than the upper bound ? _k for ?? _k introduced in [8]. Finally, some computational experiments performed to appraise the gains brought by $ {\hat{\vartheta }_k} $ are reported.