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.     

The Group of Automorphisms of the Rational Group Algebra of a Finite Metacyclic Group

We investigate the group of automorphisms Aut(? G) of a rational group algebra ? G of a finite metacyclic group G by first describing the simple components of the Wedderburn decomposition of ? G and then investigating when two of these simple components are isomorphic.     

Doob's Decomposition Theorem for Fuzzy (Super) Submartingales

Abstract

The notions of fuzzy random variables and fuzzy (super) submartingales are introduced. In this paper we provide the necessary and sufficient conditions of Doob's decomposition for fuzzy (super) submartingales. Finally, we discuss the decomposition of fuzzy (super) submartingales on R, and an example is given which explains that not every fuzzy (super) submartingale has Doob's decomposition.     

Approximate multiplication of tensor matrices based on the individual filtering of factors

Algorithms are proposed for the approximate calculation of the matrix product $ \tilde C $ \tilde C ≈ C = A · B, where the matrices A and B are given by their tensor decompositions in either canonical or Tucker format of rank r. The matrix C is not calculated as a full array; instead, it is first represented by a similar decomposition with a redundant rank and is then reapproximated (compressed) within the prescribed accuracy to reduce the rank. The available reapproximation algorithms as applied to the above problem require that an array containing r ^2d elements be stored, where d is the dimension of the corresponding space. Due to the memory and speed limitations, these algorithms are inapplicable even for the typical values d = 3 and r ∼ 30. In this paper, methods are proposed that approximate the mode factors of C using individually chosen accuracy criteria. As an application, the three-dimensional Coulomb potential is calculated. It is shown that the proposed methods are efficient if r can be as large as several hundreds and the reapproximation (compression) of C has low complexity compared to the preliminary calculation of the factors in the tensor decomposition of C with a redundant rank.     

A dyadic decomposition approach to a finitely degenerate hyperbolic problem

Abstract We use the Littlewood-Paley decomposition technique to obtain a C^∞-well-posedness result for a weakly hyperbolic equation with a finite order of degeneration. Keywords: Littlewood-Paley decomposition, Hyperbolic equations, C^∞-well-posedness, Approximate energy method     

Optional decomposition of optional supermartingales and applications to filtering and finance

ABSTRACT

The classical Doob–Meyer decomposition and its uniform version the optional decomposition are stated on probability spaces with filtrations satisfying the usual conditions. However, the comprehensive needs of filtering theory and mathematical finance call for their generalizations to more abstract spaces without such technical restrictions. The main result of this paper states that there exists a uniform Doob–Meyer decomposition of optional supermartingales on unusual probability spaces. This paper also demonstrates how this decomposition works in the construction of optimal filters in the very general setting of the filtering problem for optional semimartingales. Finally, the application of these optimal filters of optional semimartingales to mathematical finance is presented.     

Decomposition theorem for the cd-index of Gorenstein<Superscript>*</Superscript> posets

We prove a decomposition theorem for the cd-index of a Gorenstein^* poset analogous to the decomposition theorem for the intersection cohomology of a toric variety. From this we settle a conjecture of Stanley that the cd-index of Gorenstein* lattices is minimized on Boolean algebras.     

Siegel coordinates and moduli spaces for morphisms of Abelian varieties

We describe the moduli spaces of morphisms between polarized complex abelian varieties. The discrete invariants, derived from a Poincaré decomposition of morphisms, are the types of polarizations and of lattice homomorphisms occurring in the decomposition. For a given type of morphisms the moduli variety is irreducible, and is obtained from a product of Siegel spaces modulo the action of a discrete group. Mathematics Subject Classification (2000) 14K20     

Linear Stochastic Differential Equations Driven by a Fractional Brownian Motion with Hurst Parameter Less than 1/2

Abstract

In this article, we use the chaos decomposition approach to establish the existence of a unique continuous solution to linear fractional differential equations of the Skorohod type. Here, the coefficients are deterministic, the initial condition is anticipating and the underlying fractional Brownian motion has Hurst parameter less than 1/2. We provide an explicit expression for the chaos decomposition of the solution in order to show our results.     

Triangular Decomposition of Composition Algebras of Domestic Canonical Algebras

Let A be a domestic canonical algebra over a finite field. In this article, we prove that the composition algebra C(A) of A has a triangular decomposition 𝒫·𝒯·? corresponding to the division of the indecomposable modules into the preprojectives, the regulars, and the preinjectives.     

On the Alexandroff decomposition theorem

We prove an Alexandroff decomposition type theorem, which extends a decomposition theorem proved in [de LUCIA, P.—MORALES, P.: Decomposition of group-valued measures in orthoalgebras, Fund. Math. 158 (1998), 109–124].      

A Generalization of Lazard's Elimination Theorem

Abstract

Using the classical Lazard's elimination theorem, we obtain a decomposition theorem for Lie algebras defined by generators and relations of a certain type.     

Factoring wavelet transforms into lifting steps

This article is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decomposition corresponds to a factorization of the polyphase matrix of the wavelet or subband filters into elementary matrices. That such a factorization is possible is well-known to algebraists (and expressed by the formulaSL(n;R[z, z⁻¹])=E(n;R[z, z⁻¹])); it is also used in linear systems theory in the electrical engineering community. We present here a self-contained derivation, building the decomposition from basic principles such as the Euclidean algorithm, with a focus on applying it to wavelet filtering. This factorization provides an alternative for the lattice factorization, with the advantage that it can also be used in the biorthogonal, i.e., non-unitary case. Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. It has other applications, such as the possibility of defining a wavelet-like transform that maps integers to integers. Research Tutorial Acknowledgements and Notes. Page 264.     

On the variety of rational curves inP n

Summary In this note one defines a stratification of the variety of rational curves inP ⁿ of given degree in terms of the decomposition of the normal bundle (see [E-vdV], [G-S] for the casen=3). The strata are showed to be irreducible and their dimension is computed.     

Weighted scattering matrices of regular coverings of graphs

We give a decomposition formula for the determinant det(I ? U(λ)) of the weighted bond scattering matrix U(λ) of a regular covering of G. Furthermore, we define an L-function of G, and give a determinant expression of it. As a corollary, we express some determinant of the weighted bond scattering matrix of a regular covering of G by means of its L-functions.     

A torsion—theoretic generalization of fully bounded Noetherian rings

ABSTRACT

We introduce semidirect and wreath products of finite ordered semigroups and extend some standard decomposition results to this case.     

A proof of independent Bartlett correctability of nested likelihood ratio tests

It is well known that likelihood ratio statistic is Bartlett correctable. We consider decomposition of a likelihood ratio statistic into 1 degree of freedom components based on sequence of nested hypotheses. We give a proof of the fact that the component likelihood ratio statistics are distributed mutually independently up to the order O(1/n) and each component is independently Bartlett correctable. This was implicit in Lawley (1956, Biometrika, 43, 295–303) and proved in Bickel and Ghosh (1990, Ann. Statist., 18, 1070–1090) using a Bayes method. We present a more direct frequentist proof.     

Finite Generation of Units in Alternative Loop Rings

Let L be an RA loop, that is, a loop whose loop ring in any characteristic is an alternative, but not associative, ring. Suppose that L is finite and that any noncommutative division algebra appearing as a simple component in the Wedderburn decomposition of Q L is the classical Cayley–Dickson algebra over Q. Then the unit loop of the alternative loop ring Z L of L over the ring of rational integers is finitely generated.     

ALGORITHMS ON PARAMETRIC DECOMPOSITION OF MONOMIAL IDEALS

ABSTRACT

Heinzer, Mirbagheri, Ratliff, and Shah investigate parametric decomposition of monomial ideals on a regular sequence of a commutative ring R with identity 1 and prove that if every finite intersection of monomial ideals in R is again a monomial ideal, then each monomial ideal has a unique irredundant parametric decomposition. Sturmfels, Trung, and Vogels prove a similar result without the uniqueness. Bayer, Peeva, and Strumfels study generic monomial ideals, that is monomial ideals in the polynomial ring such that no variable appears with the same nonzero exponent in two different minimal generators, and for these ideals they prove the uniqueness of the irredundant irreducible decompositions and give an algorithm to construct this unique irredundant irreducible decomposition. In this paper, we present three algorithms for finding the unique irredundant irreducible decomposition of any monomial ideal.     

On a decomposition of the Hilbert spaceL 2 and its applications to Stokes problem

The Helmholtz-Weyl decomposition of the spaceL ² is strictly related with the solutions of Stokes problem. We state the main properties of this decomposition and we apply them to Stokes problem: suitable boundary conditions reduce its solution to simpler problems; the techniques involved also allow to solve two Stokes-type problems.

---

Sunto La scomposizione di Helmholtz-Weyl dello spazioL ² è particolarmente adatta allo studio delle soluzioni del problema di Stokes. Si stabiliscono le principali proprietà della scomposizione e le loro applicazioni al problema di Stokes: opportune condizioni di bordo consentono di semplificare il problema; le tecniche utilizzate consentono anche lo studio di due problemi di tipo Stokes.