Search results for "Regular"
showing 10 items of 855 documents
Fixed point properties and proximinality in Banach spaces
2009
Abstract In this paper we prove the existence of a fixed point for several classes of mappings (mappings admitting a center, nonexpansive mappings, asymptotically nonexpansive mappings) defined on the closed convex subsets of a Banach space satisfying some proximinality conditions. In particular, we derive a sufficient condition, more general than weak star compactness, such that if C is a bounded closed convex subset of l 1 satisfying this condition, then every nonexpansive mapping T : C → C has a fixed point.
A Riemann manifold structure of the spectra of weighted algebras of holomorphic functions
2009
[EN] In this paper we give general conditions on a countable family V of weights on an unbounded open set U in a complex Banach space X such that the weighted space HV (U) of holomorphic functions on U has a Frechet algebra structure. For such weights it is shown that the spectrum of HV(U) has a natural analytic manifold structure when X is a symmetrically regular Banach space, and in particular when X = C-n. (C) 2009 Elsevier Ltd. All rights reserved.
P-matrix completions under weak symmetry assumptions
2000
An n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative P-matrix, (weakly) sign-symmetric, positive, nonnegative P0,1-matrix, or Fischer, or Koteljanskii matrix. In this paper, we are interested in Π-matrix completion problems, that is, when a partial Π-matrix has a Π-matrix completion. Here, we prove that a combinatorially symmetric partial positive P-matrix has a positive P-matrix completion if the graph of its specified entries is an n-cycle. In general, a combinatorially symmetric partial Π-matrix has a Π-matrix completion if the graph of its specified entries is a 1-chordal graph. This condition is also necessary for (weakly) sign-symmetric …
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
2007
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
Quantum Pushdown Automata
2000
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [13]. In this paper we introduce the notion of quantum pushdown automata (QPA) in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [11]. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity criteria of quantum Turing machines [4]. We show that QPA can recognize every regular language. Finally we present some simple languages recognized by QPA, two of them are not recognizable by deterministic pushdown automata and one seems to be not recognizable by probabilistic pushdown …
Languages Recognizable by Quantum Finite Automata
2006
There are several nonequivalent definitions of quantum finite automata. Nearly all of them recognize only regular languages but not all regular languages. On the other hand, for all these definitions there is a result showing that there is a language l such that the size of the quantum automaton recognizing L is essentially smaller than the size of the minimal deterministic automaton recognizing L. For most of the definitions of quantum finite automata the problem to describe the class of the languages recognizable by the quantum automata is still open. The partial results are surveyed in this paper. Moreover, for the most popular definition of the QFA, the class of languages recognizable b…
2-SYMMETRIC CRITICAL POINT THEOREMS FOR NON-DIFFERENTIABLE FUNCTIONS
2008
AbstractIn this paper, some min–max theorems for even andC1functionals established by Ghoussoub are extended to the case of functionals that are the sum of a locally Lipschitz continuous, even term and a convex, proper, lower semi-continuous, even function. A class of non-smooth functionals admitting an unbounded sequence of critical values is also pointed out.
Binding energies and pairing gaps in semi-magic nuclei obtained using new regularized higher-order EDF generators
2016
We present results of the Hartree-Fock-Bogolyubov calculations performed using nuclear energy density functionals based on regularized functional generators at next-to-leading and next-to-next-to-leading order. We discuss properties of binding energies and pairing gaps determined in semi-magic spherical nuclei. The results are compared with benchmark calculations performed for the functional generator SLyMR0 and functional UNEDF0.
On computing the degree of convexity of polyominoes
2015
In this paper we present an algorithm which has as input a convex polyomino $P$ and computes its degree of convexity, defined as the smallest integer $k$ such that any two cells of $P$ can be joined by a monotone path inside $P$ with at most $k$ changes of direction. The algorithm uses space $O(m + n)$ to represent a polyomino $P$ with $n$ rows and $m$ columns, and has a running time $O(min(m; r k))$, where $r$ is the number of corners of $P$. Moreover, the algorithm leads naturally to a decomposition of $P$ into simpler polyominoes.
Weak regularity and consecutive topologizations and regularizations of pretopologies
2009
Abstract L. Foged proved that a weakly regular topology on a countable set is regular. In terms of convergence theory, this means that the topological reflection Tξ of a regular pretopology ξ on a countable set is regular. It is proved that this still holds if ξ is a regular σ -compact pretopology. On the other hand, it is proved that for each n ω there is a (regular) pretopology ρ (on a set of cardinality c ) such that ( RT ) k ρ > ( RT ) n ρ for each k n and ( RT ) n ρ is a Hausdorff compact topology, where R is the reflector to regular pretopologies. It is also shown that there exists a regular pretopology of Hausdorff RT -order ⩾ ω 0 . Moreover, all these pretopologies have the property…