Search results for "Complex."
showing 10 items of 5824 documents
Isometries of weighted spaces of holomorphic functions on unbounded domains
2009
We study isometries between weighted spaces of holomorphic functions on unbounded domains in ℂn. We show that weighted spaces of holomorphic functions on unbounded domains may exhibit behaviour different from that observed on bounded domains. We calculate the isometries for specific weights on the complex plane and the right half-plane.
Characterizing varieties of colength ≤4
2009
Let A be an associative algebra over a field F of characteristic zero, and let χ n (A), n = 1,2,…, be the sequence of cocharacters of A. For every n ≥ 1, let l n (A) denote the nth colength of A, counting the number of S n -irreducibles appearing in χ n (A). In this article, we classify the algebras A such that the sequence of colengths l n (A), n = 1,2,…, is bounded by four. Moreover we construct a finite number of algebras A 1,…, A d , such that l n (A) ≤ 4 if and only if A 1,…, A d ∉ var(A).
Complemented Subspaces and Interpolation Properties in Spaces of Polynomials
1997
LetXbe a Banach space whose dualX* has typep ∈ (1, 2]. Ifmis an integer greater thanp/(p − 1) and (xn) is a seminormalized sequence weakly convergent to zero, there is a subsequence (yn) of (xn) such that, for each element (an) ofl∞, there is anm-homogeneous continuous polynomialPonXwithP(yn) = an,n = 1, 2,… . Some interpolation and complementation properties are also given in P(mlp), form < p, as well as in other spaces of polynomials and multilinear functionals.
Proper identities, Lie identities and exponential codimension growth
2008
Abstract The exponent exp ( A ) of a PI-algebra A in characteristic zero is an integer and measures the exponential rate of growth of the sequence of codimensions of A [A. Giambruno, M. Zaicev, On codimension growth of finitely generated associative algebras, Adv. Math. 140 (1998) 145–155; A. Giambruno, M. Zaicev, Exponential codimension growth of P.I. algebras: An exact estimate, Adv. Math. 142 (1999) 221–243]. In this paper we study the exponential rate of growth of the sequences of proper codimensions and Lie codimensions of an associative PI-algebra. We prove that the corresponding proper exponent exists for all PI-algebras, except for some algebras of exponent two strictly related to t…
Error-Free Affine, Unitary, and Probabilistic OBDDs
2021
We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las-Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results for the automata counterparts of these models.
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
2017
We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The “memoryless” term means that players forget history from previous rounds, and their behavior is obtained only by input and message from the opposite player. The model is interesting because this allows us to get lower bounds for models like automata, Ordered Binary Decision Diagrams and streaming algorithms. At the same time, we can prove stronger results with this restriction. We present a lower bound for quantum memoryless protocols. Additionally, we show a lower bound for Disjointness function for this model. As an application of communicatio…
Finite State Transducers with Intuition
2010
Finite automata that take advice have been studied from the point of view of what is the amount of advice needed to recognize nonregular languages. It turns out that there can be at least two different types of advice. In this paper we concentrate on cases when the given advice contains zero information about the input word and the language to be recognized. Nonetheless some nonregular languages can be recognized in this way. The help-word is merely a sufficiently long word with nearly maximum Kolmogorov complexity. Moreover, any sufficiently long word with nearly maximum Kolmogorov complexity can serve as a help-word. Finite automata with such help can recognize languages not recognizable …
Standard Sturmian words and automata minimization algorithms
2015
The study of some close connections between the combinatorial properties of words and the performance of the automata minimization process constitutes the main focus of this paper. These relationships have been, in fact, the basis of the study of the tightness and the extremal cases of Hopcroft's algorithm, that is, up to now, the most efficient minimization method for deterministic finite state automata. Recently, increasing attention has been paid to another minimization method that, unlike the approach proposed by Hopcroft, is not based on refinement of the set of states of the automaton, but on automata operations such as determinization and reverse, and is also applicable to non-determ…
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 …
Efficient CNF Encoding of Boolean Cardinality Constraints
2003
In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical applications. The proposed encoding is efficient with respect to unit propagation, which is implemented in almost all complete CNF satisfiability solvers. We prove the practical efficiency of this encoding on some problems arising in discrete tomography that involve many cardinality constraints. This encoding is also used together with a trivial variable elimination in order to re-encode parity learning benchmarks so that a simple Davis and Putnam procedure can solve them.