Let G=(V,E) be a graph, a subset X of V is an interval of G whenever for a, b E X and xE V X , (a,x)EE (resp. (x,a)EE) if and only if (b,x)EE (resp. (x,b)EE). For instance, 0, {x}, where x E V, and V are intervals of G, called trivial intervals. A graph G is then said to be indecomposable when all of its intervals are trivial. In the opposite case, we will say that G is decomposable. We now int...

The decomposition of an arbitrary axiomatic topological quantum field theory or TQFT into indecomposable theories is given. In particular, unitary TQFT’s in arbitrary dimensions are shown to decompose into a sum of theories in which the Hilbert space of the sphere is one-dimensional, and indecomposable two-dimensional theories are classified.

It is stated in Montpetit (1987) that cyclic codes are indecomposable, but it is not true in general. In fhis paper we will give a necessary and sufficient condition for a cyclic code to be indecomposable, using its generator polynomial. @ 1999 Elsevier Science B.V. All rights reserved

Being motivated by some methods for construction of homothetically indecomposable polytopes, we obtain new methods for construction of families of integrally indecomposable polytopes. As a result, we find new infinite families of absolutely irreducible multivariate polynomials over any field F . Moreover, we provide different proofs of some of the main results of Gao [2].

We introduce a new family of indecomposable positive linear maps based on entangled quantum states. Central to our construction is the notion of an unextendible product basis. The construction lets us create indecomposable positive linear maps in matrix algebras of arbitrary high dimension. Typeset using REVTEX 1