نتایج جستجو برای: directly indecomposable
تعداد نتایج: 280627 فیلتر نتایج به سال:
In the first two volumes of Fundamenta Mathematica, Knaster and Kuratowski raised the following two questions [15], [16]: (1) If a nondegenerate, bounded plane continuum is homogeneous, is it necessarily a simple closed curve? (2) Does there exist a continuum each subcontinuum of which is indecomposable? Although Knaster settled the second question in 1922 [14], it was to remain until 1948 for ...
Two theorems about the vertices of indecomposable Specht modules for the symmetric group, defined over a field of prime characteristic p, are proved: 1. The indecomposable Specht module S has non-trivial cyclic vertex if and only if λ has p-weight 1. 2. If p does not divide n and S(n−r,1 ) is indecomposable then its vertex is a p-Sylow subgroup of Sn−r−1 × Sr. Mathematics Subject Classification...
In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triplesystems for all v ≡ 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v ≥ 12, using Skolem-type sequences.We construct, using Skolem-type sequences, three-fold triple systems having theproperties of being cyclic, simple, and indecomposable for all admissible orders v, withsome possible exception...
In this paper we study the modular structure of the permutation module H ) of the symmetric group S2n acting on set partitions of a set of size 2n into n sets each of size 2, defined over a field of odd characteristic p. In particular we characterize the vertices of the indecomposable summands of H ) and fully describe all of its indecomposable summands that lie in blocks of p-weight at most tw...
A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial is absolutely irreducible if its Newton polytope is indecomposable in the sense of Minkowski sum of polytopes. Two general constructions of indecomposable polytopes are given, and they give many simple irreducibility criteria including the well-known Eisenstein’s criterion. Polynomials from these ...
We solve the problem of computing the residual reliability (the RES problem) for all classes of P-threshold graphs for which efficient structural characterizations based on decomposition to indecomposable components have been established. In particular, we give a constructive proof of existence of linear algorithms for computing residual reliability of pseudodomishold, domishold, matrogenic and...
A subcontinuum C of a dendroid X is a bottleneck if it intersects every arc connecting two nonempty open subsets of X. We prove that every dendroid has a point p contained in arbitrarily small bottlenecks. Moreover, every plane dendroid contains a single point bottleneck. This implies, for instance, that each map from an indecomposable continuum into a plane dendroid must have an uncountable po...
Now we proceed to study representations of quivers. We start by recalling some basic definitions and constructions such as the path algebra and indecomposable representations. Then we state a theorem of Kac that describes the dimensions, where the indecomposable representations occur as well as the number of parameters needed to describe their isomorphism classes. We will prove the Kac theorem ...
The Virasoro field associated to b, c ghost systems with arbitrary integer spin λ on an n-sheeted branched covering of the Riemann sphere is deformed. This leads to reducible but indecomposable representations, if the new Virasoro field acts on the space of states, enlarged by taking the tensor product over the different sheets of the surface. For λ = 1, proven LCFT structures are made explicit...
Let R be a connected selfinjective Artin algebra, and M an indecomposable nonprojective R-module with bounded Betti numbers lying in a regular component of the Auslander-Reiten quiver of R. We prove that the Auslander-Reiten sequence ending at M has at most two indecomposable summands in the middle term. Furthermore we show that the component of the Auslander-Reiten quiver containing M is eithe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید