On the length of an external branch in the Beta-coalescent

In this paper, we consider Beta(2−α,α)$(2-\alpha ,\alpha )$ (with 1<α<2$1<\alpha <2$) and related Λ$\Lambda$-coalescents. If T⁽ⁿ⁾$T^{\left(n\right)}$ denotes the length of a randomly chosen external branch of the n$n$-coalescent, we prove the convergence of n^α−1T⁽ⁿ⁾$n^{\alpha -1}{T}^{\left(n\right)}$ when n$n$ tends to ∞$\infty$, and give the limit. To this aim, we give asymptotics for the number σ⁽ⁿ⁾${\sigma }^{\left(n\right)}$ of collisions which occur in the n$n$-coalescent until the end of the chosen external branch, and for the block counting process associated with the n$n$-coalescent.     

Partial rigidity of degenerate CR embeddings into spheres

In this paper, we study degenerate CR embeddings f$f$ of a strictly pseudoconvex hypersurface M⊂Cⁿ⁺¹$M\subset {\mathbb{C}}^{n+1}$ into a sphere S$\mathbb{S}$ in a higher dimensional complex space C^N+1${\mathbb{C}}^{N+1}$. The degeneracy of the mapping f$f$ will be characterized in terms of the ranks of the CR second fundamental form and its covariant derivatives. In 2004, the author, together with X. Huang and D. Zaitsev, established a rigidity result for CR embeddings f$f$ into spheres in low codimensions. A key step in the proof of this result was to show that degenerate mappings are necessarily contained in a complex plane section of the target sphere (partial rigidity). In the 2004 paper, it was shown that if the total rank d$d$ of the second fundamental form and all of its covariant derivatives is <n$<n$ (here, n$n$ is the CR dimension of M$M$), then f(M)$f\left(M\right)$ is contained in a complex plane of dimension n+d+1$n+d+1$. The converse of this statement is also true, as is easy to see. When the total rank d$d$ exceeds n$n$, it is no longer true, in general, that f(M)$f\left(M\right)$ is contained in a complex plane of dimension n+d+1$n+d+1$, as can be seen by examples. In this paper, we carry out a systematic study of degenerate CR mappings into spheres. We show that when the ranks of the second fundamental form and its covariant derivatives exceed the CR dimension n$n$, then partial rigidity may still persist, but there is a “defect” k$k$ that arises from the ranks exceeding n$n$ such that f(M)$f\left(M\right)$ is only contained in a complex plane of dimension n+d+k+1$n+d+k+1$. Moreover, this defect occurs in general, as is illustrated by examples.     

Stable extendibility of vector bundles over real projective spaces

Let F$\mathbb{F}$ be either the real number field R$\mathbb{R}$ or the complex number field C$\mathbb{C}$ and RPⁿ${\mathbb{RP}}^n$ the real projective space of dimension n. Theorems A and C in Hemmi and Kobayashi (2008) [2] give necessary and sufficient conditions for a given F$\mathbb{F}$-vector bundle over RPⁿ${\mathbb{RP}}^n$ to be stably extendible to RP^m${\mathbb{RP}}^m$ for every m?n$m?n$. In this paper, we simplify the theorems and apply them to the tangent bundle of RPⁿ${\mathbb{RP}}^n$, its complexification, the normal bundle associated to an immersion of RPⁿ${\mathbb{RP}}^n$ in R^n+r${\mathbb{R}}^{n+r}$(r>0)$(r>0)$, and its complexification. Our result for the normal bundle is a generalization of Theorem A in Kobayashi et al. (2000) [8] and that for its complexification is a generalization of Theorem 1 in Kobayashi and Yoshida (2003) [5].     

Asymptotic average shadowing property on compact metric spaces

We prove that if for a continuous map f$f$ on a compact metric space X$X$, the chain recurrent set, R(f)$R\left(f\right)$ has more than one chain component, then f$f$ does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f$f$ on a compact metric space X$X$ has the asymptotic average shadowing property and if A$A$ is an attractor for f$f$, then A$A$ is the single attractor for f$f$ and we have A=R(f)$A=R\left(f\right)$. We also study diffeomorphisms with asymptotic average shadowing property and prove that if M$M$ is a compact manifold which is not finite with dimM=2$dimM=2$, then the C¹$C^1$ interior of the set of all C¹$C^1$ diffeomorphisms with the asymptotic average shadowing property is characterized by the set of Ω$\Omega$-stable diffeomorphisms.     

Critical exponents for non-simultaneous blow-up in a localized parabolic system

The paper deals with the radially symmetric solutions of _ut=Δu+u^m(x,t)vⁿ(0,t)$u_t=\Delta u+u^m(x,t)v^n(0,t)$, _vt=Δv+u^p(0,t)v^q(x,t)$v_t=\Delta v+u^p(0,t)v^q(x,t)$, subject to null Dirichlet boundary conditions. For the blow-up classical solutions, we propose the critical exponents for non-simultaneous blow-up by determining the complete and optimal classification for all the non-negative exponents: (i) There exist initial data such that u$u$ (v$v$) blows up alone if and only if m>p+1$m>p+1$ (q>n+1$q>n+1$), which means that any blow-up is simultaneous if and only if m≤p+1$m\le p+1$, q≤n+1$q\le n+1$. (ii) Any blow-up is u$u$ (v$v$) blowing up with v$v$ (u$u$) remaining bounded if and only if m>p+1$m>p+1$, q≤n+1$q\le n+1$ (m≤p+1$m\le p+1$, q>n+1$q>n+1$). (iii) Both non-simultaneous and simultaneous blow-up may occur if and only if m>p+1$m>p+1$, q>n+1$q>n+1$. Moreover, we consider the blow-up rate and set estimates which were not obtained in the previously known work for the same model.     

Multidimensional extension of the Morse–Hedlund theorem

A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence x$x$ over a finite alphabet is ultimately periodic if and only if, for some n$n$, the number of different factors of length n$n$ appearing in x$x$ is less than n+1$n+1$. Attempts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let d≥2$d\ge 2$. A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of Z^d${\mathbb{Z}}^d$ definable by a first order formula in the Presburger arithmetic 〈Z;<,+〉$〈\mathbb{Z};<,+〉$. With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse–Hedlund theorem to an arbitrary dimension d$d$ and characterize sets of Z^d${\mathbb{Z}}^d$ definable in 〈Z;<,+〉$〈\mathbb{Z};<,+〉$ in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often.     

Weak convergence of the Stratonovich integral with respect to a class of Gaussian processes

For a Gaussian process X$X$ and smooth function f$f$, we consider a Stratonovich integral of f(X)$f\left(X\right)$, defined as the weak limit, if it exists, of a sequence of Riemann sums. We give covariance conditions on X$X$ such that the sequence converges in law. This gives a change-of-variable formula in law with a correction term which is an Itô integral of f^?$f^{?}$ with respect to a Gaussian martingale independent of X$X$. The proof uses Malliavin calculus and a central limit theorem from Nourdin and Nualart (2010) [8]. This formula was known for fBm with H=1/6$H=1/6$ Nourdin et al. (2010) [9]. We extend this to a larger class of Gaussian processes.     

Critical edges for the assignment problem: Complexity and exact resolution

This paper investigates two problems related to the determination of critical edges for the minimum cost assignment problem. Given a complete bipartite balanced graph with n$n$ vertices on each part and with costs on its edges, k$k$Most Vital Edges Assignment consists of determining a set of k$k$ edges whose removal results in the largest increase in the cost of a minimum cost assignment. A dual problem, Min Edge Blocker Assignment, consists of removing a subset of edges of minimum cardinality such that the cost of a minimum cost assignment in the remaining graph is larger than or equal to a specified threshold. We show that k$k$Most Vital Edges Assignment is NP$NP$-hard to approximate within a factor c<2$c<2$ and Min Edge Blocker Assignment is NP$NP$-hard to approximate within a factor 1.36$1.36$. We also provide an exact algorithm for k$k$Most Vital Edges Assignment that runs in O(n^k+2)$O\left(n^{k+2}\right)$. This algorithm can also be used to solve exactly Min Edge Blocker Assignment.     

On testing Hamiltonicity of graphs

Let us fix a function f(n)=o(nlnn)$f\left(n\right)=o(nlnn)$ and real numbers 0≤α<β≤1$0\le \alpha <\beta \le 1$. We present a polynomial time algorithm which, given a directed graph G$G$ with n$n$ vertices, decides either that one can add at most βn$\beta n$ new edges to G$G$ so that G$G$ acquires a Hamiltonian circuit or that one cannot add αn$\alpha n$ or fewer new edges to G$G$ so that G$G$ acquires at least e^−f(n)n!$e^{-f\left(n\right)}n!$ Hamiltonian circuits, or both.     

Phase transition in equilibrium fluctuations of symmetric slowed exclusion

We analyze the equilibrium fluctuations of density, current and tagged particle in symmetric exclusion with a slow bond. The system evolves in the one-dimensional lattice and the jump rate is everywhere equal to one except at the slow bond where it is αn^−β$\alpha n^{-\beta }$, with α>0$\alpha >0$, β∈[0,+∞]$\beta \in [0,+\infty ]$ and n$n$ is the scaling parameter. Depending on the regime of β$\beta$, we find three different behaviors for the limiting fluctuations whose covariances are explicitly computed. In particular, for the critical value β=1$\beta =1$, starting a tagged particle near the slow bond, we obtain a family of Gaussian processes indexed in α$\alpha$, interpolating a fractional Brownian motion of Hurst exponent 1/4$1/4$ and the degenerate process equal to zero.     

Embedding cycles of given length in oriented graphs

Kelly, Kühn and Osthus conjectured that for any ?≥4$?\ge 4$ and the smallest number k≥3$k\ge 3$ that does not divide ?$?$, any large enough oriented graph G$G$ with δ⁺(G),δ⁻(G)≥⌊|V(G)|/k⌋+1${\delta }^{+}\left(G\right),{\delta }^{-}\left(G\right)\ge \lfloor \left|V\left(G\right)\right|/k\rfloor +1$ contains a directed cycle of length ?$?$. We prove this conjecture asymptotically for the case when ?$?$ is large enough compared to k$k$ and k≥7$k\ge 7$. The case when k≤6$k\le 6$ was already settled asymptotically by Kelly, Kühn and Osthus.     

On the effectiveness of a generalization of Miller’s primality theorem

Berrizbeitia and Olivieri showed in a recent paper that, for any integer r$r$, the notion of ω$\omega$-prime to base a$a$ leads to a primality test for numbers n≡1$n\equiv 1$ mod r$r$, that under the Extended Riemann Hypothesis (ERH) runs in polynomial time. They showed that the complexity of their test is at most the complexity of the Miller primality test (MPT), which is O((logn)^4+o(1))$O\left({(logn)}^{4+o\left(1\right)}\right)$. They conjectured that their test is more effective than the MPT if r$r$ is large.     

A new upper bound on the acyclic chromatic indices of planar graphs

An acyclic edge coloring of a graph G$G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a^′(G)$a^{\prime }\left(G\right)$ of G$G$ is the smallest integer k$k$ such that G$G$ has an acyclic edge coloring using k$k$ colors. It was conjectured that a^′(G)≤Δ+2$a^{\prime }\left(G\right)\le \Delta +2$ for any simple graph G$G$ with maximum degree Δ$\Delta$. In this paper, we prove that if G$G$ is a planar graph, then a^′(G)≤Δ+7$a^{\prime }\left(G\right)\le \Delta +7$. This improves a result by Basavaraju et al. [M. Basavaraju, L.S. Chandran, N. Cohen, F. Havet, T. Müller, Acyclic edge-coloring of planar graphs, SIAM J. Discrete Math. 25 (2011) 463–478], which says that every planar graph G$G$ satisfies a^′(G)≤Δ+12$a^{\prime }\left(G\right)\le \Delta +12$.     

Concentration and multiplicity of solutions for a fourth-order equation with critical nonlinearity

In this paper, we consider the problem (_Pε)$(P_{\epsilon })$ : Δ²u=u^n+4/n-4+εu,u>0${\mathrm{\Delta }}^{2}u=u^{n+4/n-4}+\epsilon u,u>0$ in Ω,u=Δu=0$\Omega ,u=\mathrm{\Delta }u=0$ on ∂Ω$\mathrm{\partial }\Omega$, where Ω$\Omega$ is a bounded and smooth domain in Rⁿ,n>8${\mathbb{R}}^n,n>8$ and ε>0$\epsilon >0$. We analyze the asymptotic behavior of solutions of (_Pε)$(P_{\epsilon })$ which are minimizing for the Sobolev inequality as ε→0$\epsilon \to 0$ and we prove existence of solutions to (_Pε)$(P_{\epsilon })$ which blow up and concentrate around a critical point of the Robin's function. Finally, we show that for ε$\epsilon$ small, (_Pε)$(P_{\epsilon })$ has at least as many solutions as the Ljusternik–Schnirelman category of Ω$\Omega$.     

Zero separation results for solutions of second order linear differential equations

The oscillation of solutions of f^″+Af=0$f^{″}+Af=0$ is discussed by focusing on four separate situations. In the complex case A$A$ is assumed to be either analytic in the unit disc D$\mathbb{D}$ or entire, while in the real case A$A$ is continuous either on (−1,1)$(-1,1)$ or on (0,∞)$(0,\infty )$. In all situations A$A$ is expected to grow beyond bounds that ensure finite oscillation for all (non-trivial) solutions, and the separation between distinct zeros of solutions is considered.     

Estimation for stochastic differential equations with a small diffusion coefficient

We consider a multidimensional diffusion X$X$ with drift coefficient b(_Xt,α)$b(X_t,\alpha )$ and diffusion coefficient εa(_Xt,β)$\epsilon a(X_t,\beta )$ where α$\alpha$ and β$\beta$ are two unknown parameters, while ε$\epsilon$ is known. For a high frequency sample of observations of the diffusion at the time points k/n$k/n$, k=1,…,n$k=1,\dots ,n$, we propose a class of contrast functions and thus obtain estimators of (α,β)$(\alpha ,\beta )$. The estimators are shown to be consistent and asymptotically normal when n→∞$n\to \infty$ and ε→0$\epsilon \to 0$ in such a way that ε⁻¹n^−ρ${\epsilon }^{-1}{n}^{-\rho }$ remains bounded for some ρ>0$\rho >0$. The main focus is on the construction of explicit contrast functions, but it is noted that the theory covers quadratic martingale estimating functions as a special case. In a simulation study we consider the finite sample behaviour and the applicability to a financial model of an estimator obtained from a simple explicit contrast function.     

A boundary blow-up elliptic problem with an inhomogeneous term

By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term h$h$ affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x)$△u=b\left(x\right)g\left(u\right)+\lambda h\left(x\right)$, u>0$u>0$ in Ω$\Omega$, u_|∂Ω=∞$u{|}_{\partial \Omega }=\infty$, where Ω$\Omega$ is a bounded domain with smooth boundary in R^N${\mathbb{R}}^N$, λ>0$\lambda >0$, g∈C¹[0,∞)$g\in C^1[0,\infty )$ is increasing on [0,∞)$[0,\infty )$, g(0)=0$g\left(0\right)=0$, g^′$g^{\prime }$ is regularly varying at infinity with positive index ρ$\rho$, the weight b$b$, which is non-trivial and non-negative in Ω$\Omega$, may be vanishing on the boundary, and the inhomogeneous term h$h$ is non-negative in Ω$\Omega$ and may be singular on the boundary.     

Stable categories of higher preprojective algebras

We introduce (n+1)$(n+1)$-preprojective algebras of algebras of global dimension n$n$. We show that if an algebra is n$n$-representation-finite then its (n+1)$(n+1)$-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)$(n+1)$-preprojective algebra is (n+1)$(n+1)$-Calabi–Yau, and, more precisely, it is the (n+1)$(n+1)$-Amiot cluster category of the stable n$n$-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)$(n+1)$-cluster tilting object. We show that even if the (n+1)$(n+1)$-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}$n\in \{1,2\}$) the results above still hold for the stable category of Cohen–Macaulay modules.