Search results for " Opera"
showing 10 items of 3606 documents
Bounded Bi-ideals and Linear Recurrence
2013
Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.
Estimating norms inC*-algebras of discrete groups
1976
LetG be a discrete group, letK be a finite subset ofG and let χ K be the characteristic function ofK. Then χ K acts by convolution as a bounded operator onL2(G). We will prove that the norm |||χ K ||| of this operator always satisfies the following estimate: $$|||\chi _{\rm K} |||^2 \leqq k + 2\sqrt {w\left( {k - 1} \right)\left( {k - w} \right)} + \left( {k - 2} \right)\left( {k - w} \right)$$ . Here .
The Minimum Amount of Useful Space: New Results and New Directions
2014
We consider minimal space requirements when using memory with restricted access policy (pushdown - hence giving pushdown automata (PDAs), and counter - hence giving counter automata (CAs)) in connection with two-way and realtime head motion. The main results are that: (i) loglogn is a tight space lower bound for accepting general nonregular languages on weak realtime PDAs, (ii) there exist unary nonregular languages accepted by realtime alternating CAs within weak logn space, (iii) there exist nonregular languages accepted by two-way DPADs within strong loglogn space, and, (iv) there exist unary nonregular languages accepted by two-way CAs with quantum and classical states within middle log…
Browder's theorems through localized SVEP
2005
A bounded linear operator T ∈ L(X) on aBanach space X is said to satisfy “Browder’s theorem” if the Browder spectrum coincides with the Weyl spectrum. T ∈ L(X) is said to satisfy “a-Browder’s theorem” if the upper semi-Browder spectrum coincides with the approximate point Weyl spectrum. In this note we give several characterizations of operators satisfying these theorems. Most of these characterizations are obtained by using a localized version of the single-valued extension property of T. In the last part we shall give some characterizations of operators for which “Weyl’s theorem” holds.
Dissipative operators and differential equations on Banach spaces
1991
If we consider the initial value problem Inline Equation $$x'(t) = f(t,x(t)),{\text{ }}x(0) = {x_0}$$ on the real line, it is well known that one—sided bounds like Inline Equation $$\left[ {f(t,x) - f\left( {t,y} \right)} \right]\left( {x - {\text{y}}} \right) \leqslant \omega {\left( {x - y} \right)^2}$$ give much better information about the behaviour of solutions than the Lipschitz- type estimates Inline Equation $$ \left| {f\left( {t,x} \right) - f\left( {t,y} \right)} \right| \leqslant L\left| {x - y} \right|,$$ because ω, unlike L, may be negative.
Approximation Operators of Binomial Type
1999
Our objective is to present a unified theory of the approximation operators of binomial type by exploiting the main technique of the so- called “ umbral calculus” or “finite operator calculus” (see [18], [20]-[22]). Let us consider the basic sequence (bn)n≥0 associated to a certain delta operator Q. By supposing that b n (x) ≥ 0, x ∈ [0, ∞), our purpose is to put in evidence some approximation properties of the linear positive operators (L Q n ) n≥1 which are defined on C[0,1] by \( L_n^Qf = \sum\limits_{k = 0}^n {\beta _n^Q{,_k}f\left( {\frac{k}{n}} \right),\beta _{n{,_k}}^Q\left( x \right): = } \frac{1}{{{b_n}\left( n \right)}}\left( {\begin{array}{*{20}{c}} n \\ k \end{array}} \right){b_…
Hyperidentities of some generalizations of lattices
1998
In the paper we present bases and hyperbases of hyperidentities of some generalizations of the variety L of all lattices and the variety D of distributive lattices. We describe the form of hyperidentities of some varieties with two binary operations.
The Variation of the Fractional Maximal Function of a Radial Function
2017
Abstract In this article, we study the regularity of the non-centered fractional maximal operator $M_{\beta}$. As the main result, we prove that there exists $C(n,\beta)$ such that if $q=n/(n-\beta)$ and $f$ is radial function, then $\|DM_{\beta}f\|_{L^{q}({\mathbb{R}^n})}\leq C(n,\beta)\|Df\|_{L^{1}({\mathbb{R}^n})}$. The corresponding result was previously known only if $n=1$ or $\beta=0$. Our proofs are almost free from one-dimensional arguments. Therefore, we believe that the new approach may be very useful when trying to extend the result for all $f\in W^{1,1}({\mathbb{R}^n})$.
On bijections vs. unary functions
1996
A set of finite structures is in Binary NP if it can be characterized by existential second order formulas in which second order quantification is over relations of arity 2. In [DLS95] subclasses of Binary NP were considered, in which the second order quantifiers range only over certain classes of relations. It was shown that many of these subclasses coincide and that all of them can be ordered in a three-level linear hierarchy, the levels of which are represented by bijections, successor relations and unary functions respectively.
Basic Definitions and Facts
2001
Symbol is treated here as a primitive entity as point or line in geometry. Let Con = {f α : α < β} be a well-ordered set of symbols called a language type. β is an ordinal number. The elements of the above set are called connectives. To each connective f α a natural number α(α) ∈ w called the rank of f α or the arity of f α is assigned. The arity α(α) defines the number of arguments of f α . Thus we speak of nullary, unary, or binary connectives, etc. In the sequel Con is assumed to be fixed but arbitrary.