Decomposition of ℓ-group-valued measures

We deal with decomposition theorems for modular measures µ: L → G defined on a D-lattice with values in a Dedekind complete ?-group. Using the celebrated band decomposition theorem of Riesz in Dedekind complete ?-groups, several decomposition theorems including the Lebesgue decomposition theorem, the Hewitt-Yosida decomposition theorem and the Alexandroff decomposition theorem are derived. Our main result—also based on the band decomposition theorem of Riesz—is the Hammer-Sobczyk decomposition for ?-group-valued modular measures on D-lattices. Recall that D-lattices (or equivalently lattice ordered effect algebras) are a common generalization of orthomodular lattices and of MV-algebras, and therefore of Boolean algebras. If L is an MV-algebra, in particular if L is a Boolean algebra, then the modular measures on L are exactly the finitely additive measures in the usual sense, and thus our results contain results for finitely additive G-valued measures defined on Boolean algebras.     

Spine Decompositions and Limit Theorems for a Class of Critical Superprocesses

In this paper we first establish a decomposition theorem for size-biased Poisson random measures. As consequences of this decomposition theorem, we get a spine decomposition theorem and a 2-spine decomposition theorem for some critical superprocesses. Then we use these spine decomposition theorems to give probabilistic proofs of the asymptotic behavior of the survival probability and Yaglom’s exponential limit law for critical superprocesses.

     

Complete multipartite decompositions of complete graphs and complete <Emphasis Type="Italic">n</Emphasis>-partite graphs

In this paper, a new concept of an optimal complete multipartite decomposition of type 1 (type 2) of a complete n-partite graph Q _n is proposed and another new concept of a normal complete multipartite decomposition of K _n is introduced. It is showed that an optimal complete multipartite decomposition of type 1 of K _n is a normal complete multipartite decomposition. As for any complete multipartite decomposition of K _n , there is a derived complete multipartite decomposition for Q _n . It is also showed that any optimal complete multipartite decomposition of type 1 of Q _n is a derived decomposition of an optimal complete multipartite decomposition of type 1 of K _n . Besides, some structural properties of an optimal complete multipartite decomposition of type 1 of K _n are given. Supported by the National Natural Science Foundation of China (10271110).     

Atoll decompositions of graphs

An island decomposition of a graph G consists of a set of vertex-disjoint paths which cover the vertex set of G. If the endpoints of the paths are mutually nonadjacent, then we have an atoll decomposition. We characterize graphs requiring two paths in an island decomposition yet having no atoll decomposition. Results are given relating atoll decompositions to cutpoints and Hamiltonian blocks.     

Symmetric-Triangular Decomposition and its Applications Part I: Theorems and Algorithms

A new decomposition of a nonsingular matrix, the Symmetric times Triangular (ST) decomposition, is proposed. By this decomposition, every nonsingular matrix can be represented as a product of a symmetric matrix S and a triangular matrix T. Furthermore, S can be made positive definite. Two numerical algorithms for computing the ST decomposition with positive definite S are presented.     

A Brylawski decomposition for finite ordered sets

A decomposition is given for finite ordered sets P and is shown to be a unique decomposition in the sense of Brylawski. Hence there exists a universal invariant g(P) for this decomposition, and we compute g(P) explicitly. Some modifications of this decomposition are considered; in particular, one which forms a bidecomposition together with disjoint union.     

Intrinsic mono‐component decomposition of functions: An advance of Fourier theory

We propose a function decomposition model, called intrinsic mono‐component decomposition (IMD). It is a continuation of the recent study on adaptive decomposition of functions into mono‐components (MCs). It is a further improvement of two recent results of which one is adaptive decomposition of functions into modified inner functions, and the other is decomposition by using adaptive Takenaka‐Malmquist systems. The proposed new decomposition model is of less restriction and thus gains more adaptivity. The theory is valid to both the unit circle and the real line contexts. Copyright © 2009 John Wiley & Sons, Ltd.     

Algorithmic aspects of a general modular decomposition theory

A new general decomposition theory inspired by modular graph decomposition is presented. This helps in unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs, this new notion called homogeneous modules not only captures the classical graph modules but also allows handling 2-connected components, star-cutsets, and other vertex subsets.The main result is that most of the nice algorithmic tools developed for the modular decomposition of graphs still apply efficiently on our generalisation of modules. Besides, when an essential axiom is satisfied, almost all the important properties can be retrieved. For this case, an algorithm given by Ehrenfeucht, Gabow, McConnell and Sullivan [A. Ehrenfeucht, H. Gabow, R. McConnell, S. Sullivan, An O(n²) Divide-and-Conquer Algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs, Journal of Algorithms 16 (1994) 283-294.] is generalised and yields a very efficient solution to the associated decomposition problem.     

Parallel domain decomposition procedures of improved D-D type for parabolic problems

Two parallel domain decomposition procedures for solving initial-boundary value problems of parabolic partial differential equations are proposed. One is the extended D-D type algorithm, which extends the explicit/implicit conservative Galerkin domain decomposition procedures, given in [5], from a rectangle domain and its decomposition that consisted of a stripe of sub-rectangles into a general domain and its general decomposition with a net-like structure. An almost optimal error estimate, without the factor H^−1/2 given in Dawson-Dupont’s error estimate, is proved. Another is the parallel domain decomposition algorithm of improved D-D type, in which an additional term is introduced to produce an approximation of an optimal error accuracy in L²-norm.     

Decomposing thick subcategories of the stable module category

Let be the stable category of finitely generated modular representations of a finite group G over a field k. We prove a Krull-Remak-Schmidt theorem for thick subcategories of . It is shown that every thick tensor-ideal of (i.e. a thick subcategory which is a tensor ideal) has a (usually infinite) unique decomposition into indecomposable thick tensor-ideals. This decomposition follows from a decomposition of the corresponding idempotent kG-module into indecomposable modules. If is the thick tensor-ideal corresponding to a closed homogeneous subvariety W of the maximal ideal spectrum of the cohomology ring , then the decomposition of reflects the decomposition of W into connected components. Received: 27 April 1998 / In revised form: 16 July 1998     

Adaptive Decomposition by Weighted Inner Functions: A Generalization of Fourier Series

In recent study adaptive decomposition of functions into basic functions of analytic instantaneous frequencies has been sought. Fourier series is a particular case of such decomposition. Adaptivity addresses certain optimal property of the decomposition. The present paper presents a fast decomposition of functions in the $\mathcal {L}^{2}(\partial {\mathbb{D}})$ spaces into a series of inner and weighted inner functions of increasing frequencies.     

Polynomial least squares fitting in the Bernstein basis

The problem of polynomial least squares fitting in which the usual monomial basis is replaced by the Bernstein basis is considered. The coefficient matrix of the overdetermined system to be solved in the least squares sense is then a rectangular Bernstein-Vandermonde matrix. In order to use the method based on the QR decomposition of A, the first stage consists of computing the bidiagonal decomposition of the coefficient matrix A. Starting from that bidiagonal decomposition, an algorithm for obtaining the QR decomposition of A is the applied. Finally, a triangular system is solved by using the bidiagonal decomposition of the R-factor of A. Some numerical experiments showing the behavior of this approach are included.     

Operator Decomposition of Graphs and the Reconstruction Conjecture

We present a new type of decomposition of graphs – the operator decomposition connected with the classical notion of homogeneous set (or module). Using this decomposition we prove that Kelly-Ulam reconstruction conjecture is true for graphs having homogeneous set with prescribed properties, as well as for non-p-connected graphs.     

The solution of linear and nonlinear systems of Volterra functional equations using Adomian–Pade technique

The purpose of this study is to implement Adomian–Pade (Modified Adomian–Pade) technique, which is a combination of Adomian decomposition method (Modified Adomian decomposition method) and Pade approximation, for solving linear and nonlinear systems of Volterra functional equations. The results obtained by using Adomian–Pade (Modified Adomian–Pade) technique, are compared to those obtained by using Adomian decomposition method (Modified Adomian decomposition method) alone. The numerical results, demonstrate that ADM–PADE (MADM–PADE) technique, gives the approximate solution with faster convergence rate and higher accuracy than using the standard ADM (MADM).     

Even polyhedral decompositions of cubic graphs

An even polyhedral decomposition of a finite cubic graph G is defined as a set of elementary cycles of even length in G with the property that each edge of G lies in exactly two of them. If G has chromatic index three, then G has an even polyhedral decomposition. We show that, contrary to a theorem of Szekkeres [2], this property to have an even polyhedral decomposition doesn't characterize the cubic graphs of chromatic index three. In particular, there exists an infinite family of sharks all having an even polyhedral decomposition.     

Duality gaps in nonconvex stochastic optimization

We consider multistage stochastic optimization models containing nonconvex constraints, e.g., due to logical or integrality requirements. We study three variants of Lagrangian relaxations and of the corresponding decomposition schemes, namely, scenario, nodal and geographical decomposition. Based on convex equivalents for the Lagrangian duals, we compare the duality gaps for these decomposition schemes. The first main result states that scenario decomposition provides a smaller or equal duality gap than nodal decomposition. The second group of results concerns large stochastic optimization models with loosely coupled components. The results provide conditions implying relations between the duality gaps of geographical decomposition and the duality gaps for scenario and nodal decomposition, respectively.Mathematics Subject Classification (1991): 90C15Acknowledgments. This work was supported by the Priority Programme Online Optimization of Large Scale Systems of the Deutsche Forschungsgemeinschaft. The authors wish to thank Andrzej Ruszczyski (Rutgers University) for helpful discussions.     

INDECOMPOSABLE INJECTIVE MODULES AND A THEOREM OF KAPLANSKY

Abstract

Every tripotent e of a generalized Jordan triple system of second order uniquely defines a decomposition of the space of the triple into a direct sum of eight components. This decomposition is a generalization of the Peirce decomposition for the Jordan triple system. The relations between components are studied in the case when e is a left unit.     

S-PLUS code for ordinal correspondence analysis

Summary  Correspondence analysis is a popular graphical tool used to analyse contingency tables. In the past, it has commonly been performed by applying a singular value decomposition to a transformation of the data in the contingency table. A recent advance in its theory is to perform a bivariate moment decomposition instead. This approach is especially useful for the detection of linear and non-linear associations between ordinal variables; a feature not readily available using singular value decomposition. This paper outlines S-PLUS code that will perform correspondence analysis using bivariate moment decomposition. It also includes a simple plotting function that will enable the graphical interpretation of the different levels of association.     

Insights into two solution procedures for the single machine tardiness problem

This paper explores the well-known modified due date (MDD) rule for minimizing total tardiness on a single machine and shows that it has a decomposition structure. Based on this finding, we propose a decomposition heuristic and draw parallels to the famous optimal decomposition algorithm. We demonstrate that the MDD rule and the decomposition algorithm have striking similarities. We also discuss the key differences between these procedures. Finally, we present a sufficient condition under which the MDD rule is optimal and conclude the paper with some directions for future research.     

Algorithmic aspects of the substitution decomposition in optimization over relations,set systems and Boolean functions

In the last years, decomposition techniques have seen an increasing application to the solution of problems from operations research and combinatorial optimization, in particular in network theory and graph theory. This paper gives a broad treatment of a particular aspect of this approach, viz. the design of algorithms to compute the decomposition possibilities for a large class of discrete structures. The decomposition considered is thesubstitution decomposition (also known as modular decomposition, disjunctive decomposition, X-join or ordinal sum). Under rather general assumptions on the type of structure considered, these (possibly exponentially many) decomposition possibilities can be appropriately represented in acomposition tree of polynomial size. The task of determining this tree is shown to be polynomially equivalent to the seemingly weaker task of determining the closed hull of a given set w.r.t. a closure operation associated with the substitution decomposition. Based on this reduction, we show that for arbitrary relations the composition tree can be constructed in polynomial time. For clutters and monotonic Boolean functions, this task of constructing the closed hull is shown to be Turing-reducible to the problem of determining the circuits of the independence system associated with the clutter or the prime implicants of the Boolean function. This leads to polynomial algorithms for special clutters or monotonic Boolean functions. However, these results seem not to be extendable to the general case, as we derive exponential lower bounds for oracle decomposition algorithms for arbitrary set systems and Boolean functions.