The /»/'-component of a (An l)-dimensional homotopy sphere 2 e 64„ | = hP4n © (Coker7)4„_ , bounding a spin manifold M is shown to be computable in terms of the signature and the decomposable Pontrjagin numbers of M. Let Bm_i be the group of /»-cobordism classes of (m l)-dimensional homotopy spheres and let bPm C 8m_1 be the subgroup of those homotopy spheres bounding parallelizable w-manifolds...

We study the geometric structure of Lorentzian spin manifolds, which admit imaginary Killing spinors. The discussion is based on the cone construction and a normal form classification of skew-adjoint operators in signature (2, n−2). Derived geometries include Brinkmann spaces, Lorentzian Einstein-Sasaki spaces and certain warped product structures. Exceptional cases with decomposable holonomy o...

Abstract: Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs. This is achieved through dimensionality expansion that causes the graph nodes to be conditionally independent given a latent tree. The Markov updat...

In this paper some types of decomposable signed fuzzy measures have been presented. We discuss properties of 6-and ⊕decomposable signed fuzzy measures. We consider their relationship with bi-capacities.

In this paper we consider dynamic data structures for Order Decomposable Problems. This dass of Problems indude the Convex Hull Problem, the Voronoi Diagram Problem, the Maxima Problem and the Intersection of Half Spaces. This paper first describes a scheme for maintaining convex hulls in the plane dynamically in O(logn) amortized time for insert ions and O(log2n ) time for deletions. O(n) spac...

By Cayley’s theorem, any finite group G of order n can be regarded as a subgroup of the symmetric group $n. Let χ be any irreducible complex character of G and let V n χ (G) denote the symmetry classes of tensors associated with G and χ. In this paper assuming the Cayley representation of G, we obtain a formula for the dimension of V n χ (G) and discuss its non-vanishing in general. A necessary...

We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fu...

We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fu...

Decomposable Negation Normal Form formulae (DNNFs) form an interesting propositional fragment, both for efficiency and succinctness reasons. A famous subclass of the DNNF fragment is the OBDD fragment which offers many polytime queries and transformations, including quantifier eliminations (under some ordering restrictions). Nevertheless, the decomposable AND nodes at work in OBDDs enable only ...