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.     

Quandle cocycles from invariant theory

Let G$G$ be a group. Any G$G$-module M$M$ has an algebraic structure called a G$G$-family of Alexander quandles. Given a 2-cocycle of a cohomology associated with this G$G$-family, topological invariants of (handlebody) knots in the 3-sphere are defined. We develop a simple algorithm to algebraically construct n$n$-cocycles of this G$G$-family from G$G$-invariant group n$n$-cocycles of the abelian group M$M$. We present many examples of 2-cocycles of these G$G$-families using facts from (modular) invariant theory.     

On structural stability and robustness to bounded rationality

In this paper, we study the model M$M$, a parameterized class of “general games” together with an associated abstract rationality function. We prove that model M$M$ is structurally stable and robust to ?$?$-equilibria for “almost all” parameter values.     

Modules satisfying the weak Nakayama property

Let R$R$ be a commutative ring with identity. We will say that an R$R$-module M$M$ satisfies the weak Nakayama property, if IM=M$IM=M$, where I$I$ is an ideal of R$R$, implies that for any x∈M$x\in M$ there exists a∈I$a\in I$ such that (a−1)x=0$(a-1)x=0$. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if R$R$ is a local ring, then R$R$ is a Max ring if and only if J(R)$J\left(R\right)$, the Jacobson radical of R$R$, is T$T$-nilpotent if and only if every R$R$-module satisfies the weak Nakayama property.     

Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs

A semicomplete multipartite or semicomplete c$c$-partite digraph D$D$ is a biorientation of a c$c$-partite graph. A semicomplete multipartite digraph D$D$ is called strongly quasi-Hamiltonian-connected, if for any two distinct vertices x$x$ and y$y$ of D$D$, there is a path P$P$ from x$x$ to y$y$ such that P$P$ contains at least one vertex from each partite set of D$D$.     

On finite capacity queues with time dependent arrival rates

We consider the finite capacity M/M/1−K$M/M/1-K$ queue with a time dependent arrival rate λ(t)$\lambda \left(t\right)$. Assuming that the capacity K$K$ is large and that the arrival rate varies slowly with time (as t/K$t/K$), we construct asymptotic approximations to the probability of finding n$n$ customers in the system at time t$t$, as well as the mean number. We consider various time ranges, where the system is nearly empty, nearly full, or is filled to a fraction of its capacity. Extensive numerical studies are used to back up the asymptotic analysis.     

Sensitivity of Boolean formulas

The sensitivity set of a Boolean function at a particular input is the set of input positions where changing that one bit changes the output. Analogously we define the sensitivity set of a Boolean formula in a conjunctive normal form at a particular truth assignment, it is the set of positions where changing that one bit of the truth assignment changes the evaluation of at least one of the conjunct in the formula. We consider Boolean formulas in a generalized conjunctive normal form. Given a set ?$?$ of Boolean functions, an ?$?$-constraint is an application of a function from ?$?$ to a tuple of literals built upon distinct variables, an ?$?$-formula is then a conjunction of ?$?$-constraints. In this framework, given a truth assignment I$I$ and a set of positions S$S$, we are able to enumerate all ?$?$-formulas that are satisfied by I$I$ and that have S$S$ as the sensitivity set at I$I$. We prove that this number depends on the cardinality of S$S$ only, and can be expressed according to the sensitivity of the Boolean functions in ?$?$.     

Infinitesimal orbit type theorem for normalizable actions

Let α:G×M→M$\alpha :G\times M\to M$ be a differentiable action of a Lie group G$G$ on a connected differentiable manifold M$M$. Assume that the local tube theorem holds at every x∈M$x\in M$. Then the following is proved: there is a maximal infinitesimal orbit type, called the principal, such that the union of the orbits belonging to this infinitesimal type is an open and dense set in M$M$.     

The approximation characteristic of diagonal matrix in probabilistic setting

In this paper, the approximation characteristic of a diagonal matrix in probabilistic and average case settings is investigated. And the asymptotic degree of the probabilistic linear (n,δ)$(n,\delta )$-width and p$p$-average linear n$n$-width of diagonal matrix M$M$ are determined.     

A short proof of the Doob–Meyer theorem

Every submartingale S$S$ of class D$D$ has a unique Doob–Meyer decomposition S=M+A$S=M+A$, where M$M$ is a martingale and A$A$ is a predictable increasing process starting at 0.     

On the complexity of the bondage and reinforcement problems

Let G=(V,E)$G=(V,E)$ be a graph. A subset D⊆V$D\subseteq V$ is a dominating set if every vertex not in D$D$ is adjacent to a vertex in D$D$. A dominating set D$D$ is called a total dominating set if every vertex in D$D$ is adjacent to a vertex in D$D$. The domination (resp. total domination) number of G$G$ is the smallest cardinality of a dominating (resp. total dominating) set of G$G$. The bondage (resp. total bondage) number of a nonempty graph G$G$ is the smallest number of edges whose removal from G$G$ results in a graph with larger domination (resp. total domination) number of G$G$. The reinforcement (resp. total reinforcement) number of G$G$ is the smallest number of edges whose addition to G$G$ results in a graph with smaller domination (resp. total domination) number. This paper shows that the decision problems for the bondage, total bondage, reinforcement and total reinforcement numbers are all NP-hard.     

Oscillation of harmonic functions for subordinate Brownian motion and its applications

In this paper, we establish an oscillation estimate of nonnegative harmonic functions for a pure-jump subordinate Brownian motion. The infinitesimal generator of such subordinate Brownian motion is an integro-differential operator. As an application, we give a probabilistic proof of the following form of relative Fatou theorem for such subordinate Brownian motion X$X$ in a bounded κ$\kappa$-fat open set; if u$u$ is a positive harmonic function with respect to X$X$ in a bounded κ$\kappa$-fat open set D$D$ and h$h$ is a positive harmonic function in D$D$ vanishing on D^c$D^c$, then the non-tangential limit of u/h$u/h$ exists almost everywhere with respect to the Martin-representing measure of h$h$.     

Weak convergence of censored and reflected stable processes

It is shown that if a sequence of open n$n$-sets _Dk$D_k$ increases to an open n$n$-set D$D$ then reflected stable processes in _Dk$D_k$ converge weakly to the reflected stable process in D$D$ for every starting point x$x$ in D$D$. The same result holds for censored α$\alpha$-stable processes for every x$x$ in D$D$ if D$D$ and _Dk$D_k$ satisfy the uniform Hardy inequality. Using the method in the proof of the above results, we also prove the weak convergence of reflected Brownian motions in unbounded domains.     

Restrictions of an invertible chaotic operator to its invariant subspaces

Let M$M$ be a closed subspace of a separable, infinite dimensional Hilbert space H$H$ with dim(H/M)=∞$dim(H/M)=\infty$. We show that a bounded linear operator A:M→M$A:M\to M$ has an invertible chaotic extension T:H→H$T:H\to H$ if and only if A$A$ is bounded below. Motivated by our result, we further show that A:M→M$A:M\to M$ has a chaotic Fredholm extension T:H→H$T:H\to H$ if and only if A$A$ is left semi-Fredholm.     

Continuity properties of the ball hull mapping

The ball hull mapping  β$\beta$ associates with each closed bounded convex set K$K$ in a Banach space its ball hull β(K)$\beta \left(K\right)$, defined as the intersection of all closed balls containing K$K$. We are concerned in this paper with continuity and Lipschitz continuity (with respect to the Hausdorff metric) of the ball hull mapping. It is proved that β$\beta$ is a Lipschitz map in finite dimensional polyhedral spaces. Both properties, finite dimension and polyhedral norm, are necessary for this result. Characterizing the ball hull mapping by means ofH$H$-convexity we show, with the help of a remarkable example from combinatorial geometry, that there exist norms with noncontinuous β$\beta$ map, even in finite dimensional spaces. Using this surprising result, we then show that there are infinite dimensional polyhedral spaces (in the usual sense of Klee) for which the map β$\beta$ is not continuous. A property known as ball stability implies that β$\beta$ has Lipschitz constant one. We prove that every Banach space of dimension greater than two can be renormed so that there is an intersection of closed balls for which none of its parallel bodies is an intersection of closed balls, thus lacking ball stability.     

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.     

Approximate martingale estimating functions for stochastic differential equations with small noises

An approximate martingale estimating function with an eigenfunction is proposed for an estimation problem about an unknown drift parameter for a one-dimensional diffusion process with small perturbed parameter ε$\epsilon$ from discrete time observations at n$n$ regularly spaced time points k/n$k/n$, k=0,1,…,n$k=0,1,\dots ,n$. We show asymptotic efficiency of an M$M$-estimator derived from the approximate martingale estimating function as ε→0$\epsilon \to 0$ and n→∞$n\to \infty$ simultaneously.