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.     

Constructing cubature formulae of degree 5 with few points

This paper is devoted to construct a family of fifth degree cubature formulae for n$n$-cube with symmetric measure and n$n$-dimensional spherically symmetrical region. The formula forn$n$-cube contains at most n²+5n+3$n^2+5n+3$ points and for n$n$-dimensional spherically symmetrical region contains only n²+3n+3$n^2+3n+3$ points. Moreover, the numbers can be reduced to n²+3n+1$n^2+3n+1$ and n²+n+1$n^2+n+1$ if n=7$n=7$ respectively, the latter of which is minimal.     

Estimating the ground state energy of the Schrödinger equation for convex potentials

In 2011, the fundamental gap conjecture for Schrödinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schrödinger equation with a convex potential and relative error ε$\epsilon$. Classical deterministic algorithms solving this problem have cost exponential in the number of its degrees of freedom d$d$. We show a quantum algorithm, that is based on a perturbation method, for estimating the ground state energy with relative error ε$\epsilon$. The cost of the algorithm is polynomial in d$d$ and ε⁻¹${\epsilon }^{-1}$, while the number of qubits is polynomial in d$d$ and logε⁻¹$log{\epsilon }^{-1}$. In addition, we present an algorithm for preparing a quantum state that overlaps within 1−δ,δ∈(0,1)$1-\delta ,\delta \in (0,1)$, with the ground state eigenvector of the discretized Hamiltonian. This algorithm also approximates the ground state with relative error ε$\epsilon$. The cost of the algorithm is polynomial in d$d$, ε⁻¹${\epsilon }^{-1}$ and δ⁻¹${\delta }^{-1}$, while the number of qubits is polynomial in d$d$, logε⁻¹$log{\epsilon }^{-1}$ and logδ⁻¹$log{\delta }^{-1}$.     

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.     

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.     

Two remarks on frequent hypercyclicity

We show that if T:X→X$T:X\to X$ is a continuous linear operator on an F$F$-space X≠{0}$X\ne \left\{0\right\}$, then the set of frequently hypercyclic vectors of T$T$ is of first category in X$X$, and this answers a question of A. Bonilla and K.-G. Grosse-Erdmann. We also show that if T:X→X$T:X\to X$ is a bounded linear operator on a Banach space X≠{0}$X\ne \left\{0\right\}$ and if T$T$ is frequently hypercyclic (or, more generally, syndetically transitive), then the T^∗$T^{\ast }$-orbit of every non-zero element of X^∗$X^{\ast }$ is bounded away from 0, and in particular T^∗$T^{\ast }$ is not hypercyclic.     

On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence

In many applications it has been observed that hybrid-Monte Carlo sequences perform better than Monte Carlo and quasi-Monte Carlo sequences, especially in difficult problems. For a mixed s$s$-dimensional sequence m$m$, whose elements are vectors obtained by concatenating d$d$-dimensional vectors from a low-discrepancy sequence q$q$ with (s−d)$(s-d)$-dimensional random vectors, probabilistic upper bounds for its star discrepancy have been provided. In a paper of G. Ökten, B. Tuffin and V. Burago [G. Ökten, B. Tuffin, V. Burago, J. Complexity 22 (2006), 435–458] it was shown that for arbitrary ε>0$\epsilon >0$ the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$ is bounded by ε$\epsilon$ with probability at least 1−2exp(−ε²N/2)$1-2exp(-{\epsilon }^{2}N/2)$ for N$N$ sufficiently large. The authors did not study how large N$N$ actually has to be and if and how this actually depends on the parameters s$s$ and ε$\epsilon$. In this note we derive a lower bound for N$N$, which significantly depends on s$s$ and ε$\epsilon$. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$, which holds without any restrictions on N$N$. In this sense it improves on the bound of Ökten, Tuffin and Burago and is more helpful in practice, especially for small sample sizes N$N$. We compare this bound to other known bounds.     

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.     

An upper bound for a valence of a face in a parallelohedral tiling

Consider a face-to-face parallelohedral tiling of R^d${\mathbb{R}}^d$ and a (d−k)$(d-k)$-dimensional face F$F$ of the tiling. We prove that the valence of F$F$ (i.e. the number of tiles containing F$F$ as a face) is not greater than 2^k$2^k$. If the tiling is affinely equivalent to a Voronoi tiling for some lattice (the so called Voronoi case), this gives a well-known upper bound for the number of vertices of a Delaunay k$k$-cell. Yet we emphasize that such an affine equivalence is not assumed in the proof.     

Convergence of invariant measures for singular stochastic diffusion equations

It is proved that the solutions to the singular stochastic p$p$-Laplace equation, p∈(1,2)$p\in (1,2)$ and the solutions to the stochastic fast diffusion equation with nonlinearity parameter r∈(0,1)$r\in (0,1)$ on a bounded open domain Λ⊂R^d$\Lambda \subset {\mathbb{R}}^d$ with Dirichlet boundary conditions are continuous in mean, uniformly in time, with respect to the parameters p$p$ and r$r$ respectively (in the Hilbert spaces L²(Λ)$L^2\left(\Lambda \right)$, H⁻¹(Λ)$H^{-1}\left(\Lambda \right)$ respectively). The highly singular limit case p=1$p=1$ is treated with the help of stochastic evolution variational inequalities, where P$\mathbb{P}$-a.s. convergence, uniformly in time, is established.     

Iterative approximation of solutions of nonlinear equations of Hammerstein type

Suppose X$X$ is a real q$q$-uniformly smooth Banach space and F,K:X→X$F,K:X\to X$ are Lipschitz ?$?$-strongly accretive maps with D(K)=F(X)=X$D\left(K\right)=F\left(X\right)=X$. Let u^∗$u^{\ast }$ denote the unique solution of the Hammerstein equation u+KFu=0$u+KFu=0$. An iteration process recently introduced by Chidume and Zegeye is shown to converge strongly to u^∗$u^{\ast }$. No invertibility assumption is imposed on K$K$ and the operators K$K$ and F$F$ need not be defined on compact subsets of X$X$. Furthermore, our new technique of proof is of independent interest. Finally, some interesting open questions are included.     

Blow-up and propagation of disturbances for fast diffusion equations

This paper is concerned with the Cauchy problem for the fast diffusion equation _ut−Δu^m=αu^_p1$u_t-\Delta u^m=\alpha u^{p_1}$ in R^N${\mathbb{R}}^N$ (N≥1$N\ge 1$), where m∈(0,1)$m\in (0,1)$, _p1>1$p_1>1$ and α>0$\alpha >0$. The initial condition _u0$u_0$ is assumed to be continuous, nonnegative and bounded. Using a technique of subsolutions, we set up sufficient conditions on the initial value _u0$u_0$ so that u(t,x)$u(t,x)$ blows up in finite time, and we show how to get estimates on the profile of u(t,x)$u(t,x)$ for small enough values of t>0$t>0$.     

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

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.     

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.     

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.     

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