Results 1  10
of
221,614
Decomposition Theorems in Differential Geometry
"... By definition a net on a manifold is a family of complementary foliations. Nets and net morphisms between netted manifolds allow to develop basic tools for the decomposability of netted manifolds. In this way new generalizations of de Rham's decomposition theorem are obtained. In a second part ..."
Abstract
 Add to MetaCart
By definition a net on a manifold is a family of complementary foliations. Nets and net morphisms between netted manifolds allow to develop basic tools for the decomposability of netted manifolds. In this way new generalizations of de Rham's decomposition theorem are obtained. In a second part
A Cohomology Decomposition Theorem
"... this paper we will prove a parallel algebraic decomposition theorem for certain kinds of unstable algebras over the mod p Steenrod algebra. This algebraic result gives a new proof of the theorem of Jackowski and McClure and has the potential to lead to homotopy decompositon theorems for many spaces ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
this paper we will prove a parallel algebraic decomposition theorem for certain kinds of unstable algebras over the mod p Steenrod algebra. This algebraic result gives a new proof of the theorem of Jackowski and McClure and has the potential to lead to homotopy decompositon theorems for many spaces
Decompositions theorems in lgroups
"... In this note we report some results about convergence and decomposition theorems, proved in collaboration with D. Candeloro in [2]. An lgroup R is said to be Dedekind complete if every nonempty subset of R, bounded from above, has supremum in R. We note that convergence of series can be defined, at ..."
Abstract
 Add to MetaCart
In this note we report some results about convergence and decomposition theorems, proved in collaboration with D. Candeloro in [2]. An lgroup R is said to be Dedekind complete if every nonempty subset of R, bounded from above, has supremum in R. We note that convergence of series can be defined
The Decomposition Theorem and the topology of algebraic maps
, 2007
"... We give a motivated introduction to the theory of perverse sheaves, culminating in the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber. A goal of this survey is to show how the theory develops naturally from classical constructions used in the study of topological properties of alg ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We give a motivated introduction to the theory of perverse sheaves, culminating in the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber. A goal of this survey is to show how the theory develops naturally from classical constructions used in the study of topological properties
Abstract decomposition theorem and applications
 Contemporary Mathematics
, 2005
"... elementary classes K with the amalgamation property, under the assumption that certain axioms regarding independence, existence of some prime models, and regular types are satisfied. This context encompasses the following: (1) K is the class of models of an ℵ0stable first order theory. (2) K is the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
diagram D. We also prove the nonstructure part necessary to obtain a Main Gap theorem for (5), which appears in the second author’s Ph.D. thesis [Le]. The main gap in the contexts (1) and (2) are theorems of Shelah [Sh a]; (3) is by Grossberg and Hart [GrHa]; (4) by Hyttinen and Shelah [HySh2].
Dilworth’s Decomposition Theorem for
"... Summary. The following theorem is due to Dilworth [12]: Let P be a partially ordered set. If the maximal number of elements in an independent subset (antichain) of P is k, then P is the union of k chains (cliques). In this article we formalize an elegant proof of the above theorem for finite posets ..."
Abstract
 Add to MetaCart
Summary. The following theorem is due to Dilworth [12]: Let P be a partially ordered set. If the maximal number of elements in an independent subset (antichain) of P is k, then P is the union of k chains (cliques). In this article we formalize an elegant proof of the above theorem for finite
Results 1  10
of
221,614