Search results for " set"
showing 10 items of 2095 documents
Composition operators on uniform algebras, essential norms, and hyperbolically bounded sets
2006
Let A be a uniform algebra, and let o be a self-map of the spectrum M A of A that induces a composition operator C o on A. The object of this paper is to relate the notion of "hyperbolic boundedness" introduced by the authors in 2004 to the essential spectrum of C o . It is shown that the essential spectral radius of C o , is strictly less than 1 if and only if the image of M A under some iterate o n of o is hyperbolically bounded. The set of composition operators is partitioned into "hyperbolic vicinities" that are clopen with respect to the essential operator norm. This partition is related to the analogous partition with respect to the uniform operator norm.
The parameterized local deduction theorem for quasivarieties of algebras and its application
1996
Let τ be an algebraic type. To each classK of τ-algebras a consequence relation ⊧ K defined on the set of τ-equations is assigned. Some weak forms of the deduction theorem for ⊧ K and their algebraic counterparts are investigated. The (relative) congruence extension property (CEP) and its variants are discussed.CEP is shown to be equivalent to a parameter-free form of the deduction theorem for the consequence ⊧ K .CEP has a strong impact on the structure ofK: for many quasivarietiesK,CEP implies thatK is actually a variety. This phenomenon is thoroughly discussed in Section 5. We also discuss first-order definability of relative principal congruences. This property is equivalent to the fact…
Upper and lower approximations of general aggregation operators based on fuzzy rough sets
2015
Our paper deals with constructions of upper and lower general aggregation operators which act on fuzzy sets. These constructions are based on fuzzy rough sets and provide two approximations (upper and lower) of the pointwise extension and the t-extension of an ordinary aggregation operator. Considering two lattices of corresponding general aggregation operators we describe two approximate systems with respect to a lattice of fuzzy equivalence relations.
A general concept of fuzzy connectives, negations and implications based on t-norms and t-conorms
1983
All known connectives 'and'/'or' for fuzzy sets or some classes can be introduced as t-norms/t-conorms, where Ling's representation theorem is used as a basic tool, and which is illustrated by various known and new examples (Section 2). Given a strict negation function and one connective, the other can be constructed, so that the corresponding De Morgan law is valid. In case of given Archimedean connectives, there can be constructed negation functions (Section 3). Given a non-strict Archimedean connective, a negation function and the other connective can be constructed, so that in addition to the De Morgan laws, the excluded middle law and the law of non-contradiction are valid, i.e. the ne…
Operators in Rigged Hilbert spaces: some spectral properties
2014
A notion of resolvent set for an operator acting in a rigged Hilbert space $\D \subset \H\subset \D^\times$ is proposed. This set depends on a family of intermediate locally convex spaces living between $\D$ and $\D^\times$, called interspaces. Some properties of the resolvent set and of the corresponding multivalued resolvent function are derived and some examples are discussed.
An example concerning the zero set of the Jacobian
2006
AbstractLet f∈W1,1(Ω,Rn) be a homeomorphism of finite distortion K. It is known that if K1/(n−1)∈L1(Ω), then the Jacobian Jf of f is positive almost everywhere in Ω. We will show that this integrability assumption on K is sharp in any Orlicz-scale: if α is increasing function (satisfying minor technical assumptions) such that limt→∞α(t)=∞, then there exists f such that K1/(n−1)/α(K)∈L1(Ω) and Jf vanishes in a set of positive measure.
Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
2007
Consider the problem of evaluating an AND-OR formula on an $N$-bit black-box input. We present a bounded-error quantum algorithm that solves this problem in time $N^{1/2+o(1)}$. In particular, approximately balanced formulas can be evaluated in $O(\sqrt{N})$ queries, which is optimal. The idea of the algorithm is to apply phase estimation to a discrete-time quantum walk on a weighted tree whose spectrum encodes the value of the formula.
On the conical density properties of measures on $\mathbb{R}^n$
2005
We compare conical density properties and spherical density properties for general Borel measures on $\mathbb{R}^n$ . As a consequence, we obtain results for packing and Hausdorff measures $\mathcal{P}_h$ and $\mathcal{H}_h$ provided that the gauge function $h$ satisfies certain conditions. One consequence of our general results is the following: let $m, n\,{\in}\,\mathbb{N}, 0\,{\lt}\,s\,{\lt}\,m\,{\leq}\,n$ , $0\,{\lt}\,\eta\,{\lt}\,1$ , and suppose that $V$ is an $m$ -dimensional linear subspace of $\mathbb{R}^n$ . Let $\mu$ be either the $s$ -dimensional Hausdorff measure or the $s$ -dimensional packing measure restricted to a set $A$ with $\mu(A)\,{\lt}\,\infty$ . Then for $\mu$ -almos…
A Note on Algebraic Sums of Subsets of the Real Line
2002
AbstractWe investigate the algebraic sums of sets for a large class of invari-ant ˙-ideals and ˙- elds of subsets of the real line. We give a simpleexample of two Borel subsets of the real line such that its algebraicsum is not a Borel set. Next we show a similar result to Proposition 2from A. Kharazishvili paper [4]. Our results are obtained for ideals withcoanalytical bases. 1 Introduction We shall work in ZFC set theory. By !we denote natural numbers. By 4wedenote the symmetric di erence of sets. The cardinality of a set Xwe denoteby jXj. By R we denote the real line and by Q we denote rational numbers. IfAand Bare subsets of R n and b2R , then A+B= fa+b: a2A^b2Bgand A+ b= A+ fbg. Simila…
Circular sturmian words and Hopcroft’s algorithm
2009
AbstractIn order to analyze some extremal cases of Hopcroft’s algorithm, we investigate the relationships between the combinatorial properties of a circular sturmian word (x) and the run of the algorithm on the cyclic automaton Ax associated to (x). The combinatorial properties of words taken into account make use of sturmian morphisms and give rise to the notion of reduction tree of a circular sturmian word. We prove that the shape of this tree uniquely characterizes the word itself. The properties of the run of Hopcroft’s algorithm are expressed in terms of the derivation tree of the automaton, which is a tree that represents the refinement process that, in the execution of Hopcroft’s alg…