• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 98
Next 10 →

Spatial Isomorphism of Abelian Von Neumann Algebras with Countably Decomposable Commutants

by T. V. Panchapagesan, Notas De Matematica, T. V. Panchapag~an , 1997
"... Let A be an abelian von Neumann algebra of operatorn on a Hilbcrt space H cmd let i b commutant A ' be countably decomposable. If G(.) h the uvlonid rpectrd meuun of A (ree Definition 5) on the Borel sets of its maximal ideal space M, then G(.) hu CGSpmperty in H cmd consequently ha8 two multi ..."
Abstract - Add to MetaCart
Let A be an abelian von Neumann algebra of operatorn on a Hilbcrt space H cmd let i b commutant A ' be countably decomposable. If G(.) h the uvlonid rpectrd meuun of A (ree Definition 5) on the Borel sets of its maximal ideal space M, then G(.) hu CGSpmperty in H cmd consequently ha8 two

The Largest Countable Inductive Set Is A Mouse Set

by Mitch Rudominer, Abstract Let R , 1999
"... Let R be the least ordinal such that L (R) is admissible. Let A = fx 2 R j (9ff ! R ) s.t. x is ordinal definable in L ff (R) g. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the theory: ZFC \Gamma Replacement + "There exists ! ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Let R be the least ordinal such that L (R) is admissible. Let A = fx 2 R j (9ff ! R ) s.t. x is ordinal definable in L ff (R) g. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the theory: ZFC \Gamma Replacement + "There exists

The Countable Character of Uncountable Graphs

by Francois Laviolette , 2004
"... We show that a graph can always be decomposed into edge-disjoint subgraphs of countable cardinality in which the edge-connectivities and edge-separations of the original graph are preserved up to countable cardinals. We also show that the vertex set of any graph can be endowed with a well-ordering w ..."
Abstract - Add to MetaCart
We show that a graph can always be decomposed into edge-disjoint subgraphs of countable cardinality in which the edge-connectivities and edge-separations of the original graph are preserved up to countable cardinals. We also show that the vertex set of any graph can be endowed with a well

Countable Unions of Simple Sets in the Core Model

by P. D. Welch - THE J. SYMBOLIC LOGIC , 1996
"... We follow [8] in asking when a set of ordinals X ` ff is a countable union of sets in K, the core model. We show that, analogously to L, an X closed under the canonical \Sigma 1 Skolem function for K ff can be so decomposed, provided K is such that no !-closed filters are put on its measure seque ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We follow [8] in asking when a set of ordinals X ` ff is a countable union of sets in K, the core model. We show that, analogously to L, an X closed under the canonical \Sigma 1 Skolem function for K ff can be so decomposed, provided K is such that no !-closed filters are put on its measure

Adaptive Overload Control for Busy Internet Servers

by Matt Welsh , David Culler , 2003
"... As Internet services become more popular and pervasive, a critical problem that arises is managing the performance of services under extreme overload. This paper presents a set of techniques for managing overload in complex, dynamic Internet services. These techniques are based on an adaptive admiss ..."
Abstract - Cited by 150 (2 self) - Add to MetaCart
admission control mechanism that attempts to bound the 90th-percentile response time of requests flowing through the service. This is accomplished by internally monitoring the performance of the service, which is decomposed into a set of event-driven stages connected with request queues. By controlling

Frames and Stable Bases for Shift-Invariant Subspaces of . . .

by Amos Ron, Zuowei Shen , 1994
"... Let X be a countable fundamental set in a Hilbert space H, and let T be the operator T : ` 2 (X) ! H : c 7! X x2X c(x)x: Whenever T is well-defined and bounded, X is said to be a Bessel sequence. If, in addition, ran T is closed, then X is a frame. Finally, a frame whose corresponding T is inje ..."
Abstract - Cited by 133 (29 self) - Add to MetaCart
Let X be a countable fundamental set in a Hilbert space H, and let T be the operator T : ` 2 (X) ! H : c 7! X x2X c(x)x: Whenever T is well-defined and bounded, X is said to be a Bessel sequence. If, in addition, ran T is closed, then X is a frame. Finally, a frame whose corresponding

Descriptive complexity of countable unions of Borel rectangles

by Dominique Lecomte, Miroslav Zeleny , 2013
"... Abstract. We give, for each countable ordinal ξ≥1, an example of a ∆0 2 countable union of Borel rectangles that cannot be decomposed into countably many Π0 ξ rectangles. In fact, we provide a graph of a partial injection with disjoint domain and range, which is a difference of two closed sets, and ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. We give, for each countable ordinal ξ≥1, an example of a ∆0 2 countable union of Borel rectangles that cannot be decomposed into countably many Π0 ξ rectangles. In fact, we provide a graph of a partial injection with disjoint domain and range, which is a difference of two closed sets

Admissible representations of probability measures

by Matthias Schröder - Electronic Notes in Theoretical Computer Science
"... In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 Theory of Effectivity. This gives rise to a natural representation of the set M(X) of Borel probability measures on X. We ..."
Abstract - Cited by 22 (0 self) - Add to MetaCart
compare this representation to a canonically constructed representation which encodes a Borel probability measure as a lower semicontinuous function from the open sets to the unit interval. This canonical representation turns out to be admissible with respect to the weak topology on M(X). Moreover, we

Admissible wavelets associated with the Heisenberg group

by Heping Liu, Lizhong Peng - Pacific J. Math , 1997
"... Let NAK be the Iwasawa decomposition of group SU(n + 1, 1). The Iwasawa subgroup P = NA can be identified with the generalized upper half–plane U n+1 and has a natural representation U on the L 2 –space of the Heisenberg group L 2 (H n). We decompose L 2 (H n) into the direct sum of the irreducible ..."
Abstract - Cited by 15 (3 self) - Add to MetaCart
the irreducible invariant closed subspaces of L 2 (H n) to L 2,ν (U n+1), the weighted L 2 –spaces on U n+1. By selecting a set of mutual orthogonal admissible wavelets, we get the direct sum decomposition of L 2,ν (U n+1) with the first component A ν (U n+1), the (weighted) Bergman space.

Σ0 α-Admissible Representations (Extended Abstract)

by Matthew De Brecht, Akihiro Yamamoto
"... Abstract. We investigate a hierarchy of representations of topological spaces by measurable functions that extends the traditional notion of admissible representations common to computable analysis. Specific instances of these representations already occur in the literature (for example, the naive C ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
previous results to generalize to arbitrary countably based T0 topological spaces. In addition, for a class of topological spaces that include the reals (with the Euclidean topology) and the power set of ω (with the Scott-topology), we give a complete characterization of the functions
Next 10 →
Results 1 - 10 of 98
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University