Search results for " Opera"
showing 10 items of 3606 documents
Superposition in Classes of Ultradifferentiable Functions
2006
We present a complete characterization of the classes of ultradifferentiable functions that are holomorphically closed. Moreover, we show that any class holomorphically closed is also closed under composition (now without restrictions on the number of variables). In this case, we also discuss continuity and differentiability properties of the non-linear superposition operator g → f ◦ g.
On Extremal Cases of Hopcroft’s Algorithm
2009
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees of freedom, so there can exist different sequences of refinements of the set of the states that lead to the final partition. We find an infinite family of binary automata for which such a process is unique. Some recent papers (cf. [3,7,1]) have been devoted to find families of automata for which Hopcroft’s algorithm has its worst execution time. They are unary automata associated to circular words. However, automata minimization can be achieved also in linear time when the alphabet has only one letter (cf. [14]), so in …
Orlicz–Sobolev extensions and measure density condition
2010
Abstract We study the extension properties of Orlicz–Sobolev functions both in Euclidean spaces and in metric measure spaces equipped with a doubling measure. We show that a set E ⊂ R satisfying a measure density condition admits a bounded linear extension operator from the trace space W 1 , Ψ ( R n ) | E to W 1 , Ψ ( R n ) . Then we show that a domain, in which the Sobolev embedding theorem or a Poincare-type inequality holds, satisfies the measure density condition. It follows that the existence of a bounded, possibly non-linear extension operator or even the surjectivity of the trace operator implies the measure density condition and hence the existence of a bounded linear extension oper…
Probabilistic Interpretations of Predicates
2016
In classical logic, any m-ary predicate is interpreted as an m-argument two-valued relation defined on a non-empty universe. In probability theory, m-ary predicates are interpreted as probability measures on the mth power of a probability space. m-ary probabilistic predicates are equivalently semantically characterized as m-dimensional cumulative distribution functions defined on \(\mathbb {R}^m\). The paper is mainly concerned with probabilistic interpretations of unary predicates in the algebra of cumulative distribution functions defined on \(\mathbb {R}\). This algebra, enriched with two constants, forms a bounded De Morgan algebra. Two logical systems based on the algebra of cumulative…
The Descriptive Complexity Approach to LOGCFL
1999
Building upon the known generalized-quantifier-based firstorder characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers. Our work extends the elaborate theory relating monoidal quantifiers to NC1 and its subclasses. In the absence of the BIT predicate, we resolve the main issues: we show in particular that no single outermost unary groupoidal quantifier with FO can capture all the context-free languages, and we obtain the surprising result that a variant of Greibach's "hardest contextfree language" is LOGCFL-complete under quantifier-free BIT-free interpre…
Uncountable classical and quantum complexity classes
2018
It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (A.C. Cem Say and A. Yakaryılmaz, Magic coins are useful for small-space quantum machines. Quant. Inf. Comput. 17 (2017) 1027–1043). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary la…
Uncountable Realtime Probabilistic Classes
2018
We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same result for double logarithmic space, which is also tight. When replacing the work tape with a few counters, we can still achieve similar results for unary linear-space two-counter automata, unary sublinear-space three-counter automata, and non-unary sublinear-space two-counter automata. We also show how to slightly improve the sublinear-space constructions by using more counters.
Ergodic properties of operators in some semi-Hilbertian spaces
2012
This article deals with linear operators T on a complex Hilbert space ℋ, which are bounded with respect to the seminorm induced by a positive operator A on ℋ. The A-adjoint and A 1/2-adjoint of T are considered to obtain some ergodic conditions for T with respect to A. These operators are also employed to investigate the class of orthogonally mean ergodic operators as well as that of A-power bounded operators. Some classes of orthogonally mean ergodic or A-ergodic operators, which come from the theory of generalized Toeplitz operators are considered. In particular, we give an example of an A-ergodic operator (with an injective A) which is not Cesaro ergodic, such that T * is not a quasiaff…
Metric operators, generalized hermiticity and partial inner product spaces
2015
A quasi-Hermitian operator is an operator in a Hilbert space that is similar to its adjoint in some sense, via a metric operator, i.e., a strictly positive self-adjoint operator. Motivated by the recent developments of pseudo-Hermitian quantum mechanics, we analyze the structure of metric operators, bounded or unbounded, in a Hilbert space. We introduce several generalizations of the notion of similarity between operators and explore to what extent they preserve spectral properties. Next we consider canonical lattices of Hilbert spaces generated by unbounded metric operators. Since such lattices constitute the simplest case of a partial inner product space (PIP space), we can exploit the te…
Metric Operators, Generalized Hermiticity and Lattices of Hilbert Spaces
2015
Pseudo-Hermitian quantum mechanics (QM) is a recent, unconventional, approach to QM, based on the use of non-self-adjoint Hamiltonians, whose self-adjointness can be restored by changing the ambient Hilbert space, via a so-called metric operator. The PT-symmetric Hamiltonians are usually pseudo-Hermitian operators, a term introduced a long time ago by Dieudonné for characterizing those bounded operators A that satisfy a relation of the form GA = A G, where G is a metric operator, that is, a strictly positive self-adjoint operator. This chapter explores further the structure of unbounded metric operators, in particular, their incidence on similarity. It examines the notion of similarity betw…