Description of extended eigenvalues and extended eigenvectors of integration operators on the Wiener algebra

In the present paper we consider the Volterra integration operator V   on the Wiener algebra W(D)$W(\mathbb{D})$ of analytic functions on the unit disc D$\mathbb{D}$ of the complex plane C$\mathbb{C}$. A complex number λ$\lambda$ is called an extended eigenvalue of V if there exists a nonzero operator A   satisfying the equation AV=λVA$\mathit{AV}=\lambda \mathit{VA}$. We prove that the set of all extended eigenvalues of V   is precisely the set C?{0}$\mathbb{C}?\{0\}$, and describe in terms of Duhamel operators and composition operators the set of corresponding extended eigenvectors of V$V$. The similar result for some weighted shift operator on _?p${?}_p$ spaces is also obtained.     

[1, 2]-sets in graphs

A subset S⊆V$S\subseteq V$ in a graph G=(V,E)$G=(V,E)$ is a [j,k]$[j,k]$-set if, for every vertex v∈V?S$v\in V?S$, j≤|N(v)∩S|≤k$j\le |N\left(v\right)\cap S|\le k$ for non-negative integers j$j$ and k$k$, that is, every vertex v∈V?S$v\in V?S$ is adjacent to at least j$j$ but not more than k$k$ vertices in S$S$. In this paper, we focus on small j$j$ and k$k$, and relate the concept of [j,k]$[j,k]$-sets to a host of other concepts in domination theory, including perfect domination, efficient domination, nearly perfect sets, 2-packings, and k$k$-dependent sets. We also determine bounds on the cardinality of minimum [1, 2]-sets, and investigate extremal graphs achieving these bounds. This study has implications for restrained domination as well. Using a result for [1, 3]-sets, we show that, for any grid graph G$G$, the restrained domination number is equal to the domination number of G$G$.     

On the sum of two closed subspaces

If U,V$U,V$ are closed subspaces of a Fréchet space, then E$E$ is the direct sum of U$U$ and V$V$ if and only if E^′$E^{\prime }$ is the algebraic direct sum of the annihilators U^°$U^{°}$ and V^°$V^{°}$. We provide a simple proof of this (possibly well-known) result.     

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.     

Abelian theorems for stochastic volatility models with application to the estimation of jump activity

In this paper, we prove a kind of Abelian theorem for a class of stochastic volatility models (X,V)$(X,V)$ where both the state process X$X$ and the volatility process V$V$ may have jumps. Our results relate the asymptotic behavior of the characteristic function of _XΔ$X_{\Delta }$ for some Δ>0$\Delta >0$ in a stationary regime to the Blumenthal–Getoor indexes of the Lévy processes driving the jumps in X$X$ and V$V$. The results obtained are used to construct consistent estimators for the above Blumenthal–Getoor indexes based on low-frequency observations of the state process X$X$. We derive convergence rates for the corresponding estimator and show that these rates cannot be improved in general.     

Cone isomorphisms and almost surjective operators

Let E$E$ be a Banach lattice and F$F$ a Banach space. A bounded linear operator T:E→F$T:E\to F$ is an isomorphism on the positive cone of E$E$ if and only if T^∗$T^{\ast }$ is almost surjective. A dual version of this theorem holds also. A bounded linear operator T:F→E$T:F\to E$ is almost surjective if and only if T^∗$T^{\ast }$ is an isomorphism on the positive cone of F^∗$F^{\ast }$.     

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

An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces

In this paper, a new monotonicity, M$M$-monotonicity, is introduced, and the resolvent operator of an M$M$-monotone operator is proved to be single valued and Lipschitz continuous. With the help of the resolvent operator, an equivalence between the variational inequality VI(C,F+G)$(C,F+G)$ and the fixed point problem of a nonexpansive mapping is established. A proximal point algorithm is constructed to solve the fixed point problem, which is proved to have a global convergence under the condition that F$F$ in the VI problem is strongly monotone and Lipschitz continuous. Furthermore, a convergent path Newton method, which is based on the assumption that the projection mapping _∏C(⋅)${\prod }_C(\cdot )$ is semismooth, is given for calculating ε$\epsilon$-solutions to the sequence of fixed point problems, enabling the proximal point algorithm to be implementable.     

The smallest regular polytopes of given rank

An abstract polytope is called regular   if its automorphism group has a single orbit on flags (maximal chains). In this paper, the regular n$n$-polytopes with the smallest number of flags are found, for every rank n>1$n>1$. With a few small exceptions, the smallest regular n$n$-polytopes come from a family of ‘tight’ polytopes with 2⋅4ⁿ⁻¹$2\cdot 4^{n-1}$ flags, one for each n$n$, with Schläfli symbol {4∣4∣?∣4}$\{4\mid 4\mid ?\mid 4\}$. Also with few exceptions, these have both the smallest number of elements, and the smallest number of edges in their Hasse diagram.     

On large semi-linked graphs

Let H$H$ be a multigraph, possibly with loops, and consider a set S⊆V(H)$S\subseteq V\left(H\right)$. A (simple) graph G$G$ is (H,S)$(H,S)$-semi-linked   if, for every injective map f:S→V(G)$f:S\to V\left(G\right)$, there exists an injective map g:V(H)?S→V(G)?f(S)$g:V\left(H\right)?S\to V\left(G\right)?f\left(S\right)$ and a set of |E(H)|$\left|E\left(H\right)\right|$ internally disjoint paths in G$G$ connecting pairs of vertices of  f(S)∪g(V(H)?S)$f\left(S\right)\cup g(V\left(H\right)?S)$ for every edge between the corresponding vertices of H$H$. This new concept of (H,S)$(H,S)$-semi-linkedness is a generalization of H$H$-linkedness  . We establish a sharp minimum degree condition for a sufficiently large graph G$G$ to be (H,S)$(H,S)$-semi-linked.     

On the spectral density function of the Laplacian of a graph

Let X$X$ be a finite graph. Let |V|$\left|V\right|$ be the number of its vertices and d$d$ be its degree. Denote by _F1(X)$F_1\left(X\right)$ its first spectral density function which counts the number of eigenvalues ≤λ²$\le {\lambda }^2$ of the associated Laplace operator. We provide an elementary proof for the estimate _F1(X)(λ)−_F1(X)(0)≤2⋅(|V|−1)⋅d⋅λ$F_1\left(X\right)\left(\lambda \right)-F_1\left(X\right)\left(0\right)\le 2\cdot (\left|V\right|-1)\cdot d\cdot \lambda$ for 0≤λ<1$0\le \lambda <1$ which has already been proved by Friedman (1996) [3] before. We explain how this gives evidence for conjectures about approximating Fuglede–Kadison determinants and L²$L^2$-torsion.     

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.     

Hopf subalgebras and tensor powers of generalized permutation modules

By means of a certain module V$V$ and its tensor powers in a finite tensor category, we study a question of whether the depth of a Hopf subalgebra R$R$ of a finite-dimensional Hopf algebra H$H$ is finite. The module V$V$ is the counit representation induced from R$R$ to H$H$, which is then a generalized permutation module, as well as a module coalgebra. We show that if in the subalgebra pair either Hopf algebra has finite representation type, or V$V$ is either semisimple with R^∗$R^{\ast }$ pointed, projective, or its tensor powers satisfy a Burnside ring formula over a finite set of Hopf subalgebras including R$R$, then the depth of R$R$ in H$H$ is finite. One assigns a nonnegative integer depth to V$V$, or any other H$H$-module, by comparing the truncated tensor algebras of V$V$ in a finite tensor category and so obtains upper and lower bounds for depth of a Hopf subalgebra. For example, a relative Hopf restricted module has depth 1, and a permutation module of a corefree subgroup has depth less than the number of values of its character.     

On functional limits of short- and long-memory linear processes with GARCH(1,1) noises

This paper considers the short- and long-memory linear processes with GARCH (1,1) noises. The functional limit distributions of the partial sum and the sample autocovariances are derived when the tail index α$\alpha$ is in (0,2)$(0,2)$, equal to 2, and in (2,∞)$(2,\infty )$, respectively. The partial sum weakly converges to a functional of α$\alpha$-stable process when α<2$\alpha <2$ and converges to a functional of Brownian motion when α≥2$\alpha \ge 2$. When the process is of short-memory and α<4$\alpha <4$, the autocovariances converge to functionals of α/2$\alpha /2$-stable processes; and if α≥4$\alpha \ge 4$, they converge to functionals of Brownian motions. In contrast, when the process is of long-memory, depending on α$\alpha$ and β$\beta$ (the parameter that characterizes the long-memory), the autocovariances converge to either (i) functionals of α/2$\alpha /2$-stable processes; (ii) Rosenblatt processes (indexed by β$\beta$, 1/2<β<3/4$1/2<\beta <3/4$); or (iii) functionals of Brownian motions. The rates of convergence in these limits depend on both the tail index α$\alpha$ and whether or not the linear process is short- or long-memory. Our weak convergence is established on the space of càdlàg functions on [0,1]$[0,1]$ with either (i) the _J1$J_1$ or the _M1$M_1$ topology (Skorokhod, 1956); or (ii) the weaker form S$S$ topology (Jakubowski, 1997). Some statistical applications are also discussed.     

On the radius of spatial analyticity for semilinear symmetric hyperbolic systems

We study the problem of propagation of analytic regularity for semi-linear symmetric hyperbolic systems. We adopt a global perspective and we prove that if the initial datum extends to a holomorphic function in a strip of radius (= width) _ε0${\epsilon }_0$, the same happens for the solution u(t,⋅)$u(t,\cdot )$ for a certain radius ε(t)$\epsilon (t)$, as long as the solution exists. Our focus is on precise lower bounds on the spatial radius of analyticity ε(t)$\epsilon (t)$ as t grows.     

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.