Diagonals and numerical ranges of direct sums of matrices

For any n-by-n matrix A  , we consider the maximum number k=k(A)$k=k(A)$ for which there is a k-by-k compression of A   with all its diagonal entries in the boundary ∂W(A)$\partial W(A)$ of the numerical range W(A)$W(A)$ of A. If A   is a normal or a quadratic matrix, then the exact value of k(A)$k(A)$ can be computed. For a matrix A   of the form B⊕C$B\oplus C$, we show that k(A)=2$k(A)=2$ if and only if the numerical range of one summand, say, B is contained in the interior of the numerical range of the other summand C   and k(C)=2$k(C)=2$. For an irreducible matrix A  , we can determine exactly when the value of k(A)$k(A)$ equals the size of A  . These are then applied to determine k(A)$k(A)$ for a reducible matrix A   of size 4 in terms of the shape of W(A)$W(A)$.     

Derivations and local derivations on Freudenthal almost f-algebras

Let A be an Archimedean f  -algebra and let N(A)$N(A)$ be the set of all nilpotent elements of A. Colville et al. [4] proved that a positive linear map d:A→A$d:A\to A$ is a derivation if and only if d(A)⊂N(A)$d(A)\subset N(A)$ and d(A²)={0}$d(A^2)=\{0\}$, where A²$A^2$ is the set of all products ab in A.     

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.     

An approximation method for strictly pseudocontractive mappings

Let K$K$ be a closed convex subset of a q$q$-uniformly smooth separable Banach space, T:K→K$T:K\to K$ a strictly pseudocontractive mapping, and f:K→K$f:K\to K$ an L$L$-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1)$t\in (0,1)$, let _xt$x_t$ be the unique fixed point of tf+(1-t)T$\mathit{tf}+(1-t)T$. We prove that if T$T$ has a fixed point, then {_xt}$\{x_t\}$ converges to a fixed point of T$T$ as t$t$ approaches to 0.     

On Waringʼs problem for systems of skew-symmetric forms

This paper is devoted to a problem of finding the smallest positive integer s(m,n,k)$s(m,n,k)$ such that (m+1)$(m+1)$ generic skew-symmetric (k+1)$(k+1)$-forms in (n+1)$(n+1)$ variables as linear combinations of the same s(m,n,k)$s(m,n,k)$ decomposable skew-symmetric (k+1)$(k+1)$-forms.     

On the nonexistence of a relation between σ-left-porosity and σ-right-porosity

Given an arbitrarily weak notion of left-〈f〉$〈f〉$-porosity and an arbitrarily strong notion of right-〈g〉$〈g〉$-porosity, we construct an example of closed subset of R$\mathbb{R}$ which is not σ  -left-〈f〉$〈f〉$-porous and is right-〈g〉$〈g〉$-porous. We also briefly summarize the relations between three different definitions of porosity controlled by a function; we then observe that our construction gives the example for any combination of these definitions of left-porosity and right-porosity.     

A verified method for bounding clusters of zeros of analytic functions

In this paper, we propose a verified method for bounding clusters of zeros of analytic functions. Our method gives a disk that contains a cluster of m   zeros of an analytic function f(z)$f(z)$. Complex circular arithmetic is used to perform a validated computation of n  -degree Taylor polynomial p(z)$p(z)$ of f(z)$f(z)$. Some well known formulae for bounding zeros of a polynomial are used to compute a disk containing a cluster of zeros of p(z)$p(z)$. A validated computation of an upper bound for Taylor remainder series of f(z)$f(z)$ and a lower bound of p(z)$p(z)$ on a circle are performed. Based on these results, Rouché's theorem is used to verify that the disk contains the cluster of zeros of f(z)$f(z)$. This method is efficient in computation of the initial disk of a method for finding validated polynomial factor of an analytic function. Numerical examples are presented to illustrate the efficiency of the proposed method.     

Distance spectral radius of trees with fixed number of pendent vertices

The distance spectral radius ρ(G)$\rho (G)$ of a graph G   is the largest eigenvalue of the distance matrix D(G)$D(G)$. In this paper, we characterize the graph with minimum distance spectral radius among trees with fixed number of pendent vertices.     

On essential entropy-carrying sets

In this paper we study properties of essential entropy-carrying sets of a continuous map on a compact metric space. If f:X→X$f:X\to X$ is continuous on a compact metric space X, then the intersection of all essential entropy-carrying sets of f may or may not be an essential entropy-carrying set of f  . When this intersection is an essential entropy-carrying set we denote it by E(f)$E(f)$, the least essential entropy-carrying set, otherwise we say that E(f)$E(f)$ does not exist. We present an example where E(f)$E(f)$ does not exist but also find a sufficient condition for E(f)$E(f)$ to exist. If f   is a piecewise monotone map, we show that E(f)$E(f)$ exists and is the finite union of the entropy-carrying sets in the Nitecki Decomposition of the nonwandering set of f intersected with the closure of the periodic points of f  . When E(f)$E(f)$ exists we study how it relates to other entropy-carrying sets of f including subsets of itself.