1,407 research outputs found
On powers of operators with spectrum in cantor sets and spectral synthesis
For , let be the perfect
symmetric set associated with , that is and Let
be an integer and be a nonnegative real number. We show that any
invertible operator on a Banach space with spectrum contained in
that satisfies \begin{eqnarray*} & & \big\| T^{n} \big\| = O \big( n^{s} \big),
\,n \rightarrow +\infty \\ & \textrm{and} & \big\| T^{-n} \big\| = O \big(
e^{n^{\beta}} \big), \, n \rightarrow +\infty \textrm{ for some } \beta <
b(1/q),\end{eqnarray*} also satisfies the stronger property We also show that this
result is false for when is not a Pisot number and that the
constant is sharp. As a consequence we prove that, if is a
submulticative weight such that and , for some
constants and then satisfies spectral
synthesis in the Beurling algebra of all continuous functions on the unit
circle such that
Weighted Big Lipschitz algebras of analytic functions and closed ideals
We give the smallest closed ideal with given hull and inner factor for some
weighted big Lipschitz algebras of analytic functions
A simple proof for visibility paths in simple polygons
The purpose of this note is to give a simple proof for a necessary and
sufficient condition for visibility paths in simple polygons. A visibility path
is a curve such that every point inside a simple polygon is visible from at
least one point on the path. This result is essential for finding the shortest
watchman route inside a simple polygon specially when the route is restricted
to curved paths
Query-points visibility constraint minimum link paths in simple polygons
We study the query version of constrained minimum link paths between two
points inside a simple polygon with vertices such that there is at
least one point on the path, visible from a query point. The method is based on
partitioning into a number of faces of equal link distance from a point,
called a link-based shortest path map (SPM). Initially, we solve this problem
for two given points , and a query point . Then, the proposed
solution is extended to a general case for three arbitrary query points ,
and . In the former, we propose an algorithm with preprocessing
time. Extending this approach for the latter case, we develop an algorithm with
preprocessing time. The link distance of a - path between
, as well as the path are provided in time and , respectively, for the above two cases, where is the number of links
Unitary equivalence to truncated Toeplitz operators
In this paper we investigate operators unitarily equivalent to truncated
Toeplitz operators. We show that this class contains certain sums of tensor
products of truncated Toeplitz operators. In particular, it contains arbitrary
inflations of truncated Toeplitz operators; this answers a question posed by
Cima, Garcia, Ross, and Wogen
Effects Of Material Parameters On The Stresses In High Temperature Weldments
An integral equation is presented that relates time to equivalent stresses at the interface of two regions in a weldment operating within the creep regime. Taking the creep constitutive equation as the Norton power law, the paper investigates the effects of the stress index and the stress coefficient on the equivalent stresses at the critical interfaces in the weldment
The commutant of an operator with bounded conjugation orbits and C₀‒contractions
Let A be an invertible bounded linear operator on a complex Banach space, {A}′ the commutant of A and Bᴀ the set of all operators T such that 〖sup〗_(ₙ≥₀)∥AⁿTA⁻ⁿ ∥ < +∞. Equality {A}′ = Bᴀ was studied by many authors for differents classes of operators. In this paper we investigate a local version of this equality and the case where A is a C₀–contraction.peerReviewe
- …