Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K_n, is a 3‐factorization of K_n in which the components of each factor are cubes. We show that there exists a cube factorization of K_n if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Maximum norms of random sums and transient pattern formation

Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.

In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.

     

Bicircular projections and characterization of Hilbert spaces

We prove that every JB* triple with rank one bicircular projection is a direct sum of two ideals, one of which is isometrically isomorphic to a Hilbert space.

     

关于限制李超代数的分解

代数$A$ 称为不可分解的,如果 $A$ 不能分解成理想的直和.文中将证明满足$C(L_{\bar{0}})=C(L)=\{0\}$的限制李超代数能够分解成不可分解限制理想的直和,这种分解在不计理想次序的前提下是唯一的.而且还证明了限制李超代数的一些结果.     

Lanthanum nitrate decomposition by both temperature programmed heating and citrate gel combustion

Thermal decomposition of lanthanum nitrate to lanthanum oxide was carried out by both temperature programmed heating (TPH) and citrate-gel combustion. The temperature programmed heating was carried out under flow of oxidizing (air), neutral (nitrogen) and reducing (25 vol.% hydrogen+argone mixture) gases, and the processes were controlled by simultaneous thermogravimetry and differential thermal analysis. It was shown that hydrogen atmosphere helps to reduce temperatures of all decomposition steps. The results of TPH were utilized to check the nature of residues in the products of lanthanum nitrate-to-oxide conversion performed via citrate-gel combustion technique.     

Idealization of a decomposition theorem

In 1986, Tong [13] proved that a function f : (X,τ)→(Y,φ) is continuous if and only if it is α-continuous and A-continuous. We extend this decomposition of continuity in terms of ideals. First, we introduce the notions of regular-I-closed sets, A _I-sets and A _I -continuous functions in ideal topological spaces and investigate their properties. Then, we show that a function f : (X,τ,I)→(Y, φ) is continuous if and only if it is α-I-continuous and A _I-continuous. This revised version was published online in June 2006 with corrections to the Cover Date.     

Domain decomposition for an asymptotic geological fault modeling

We present in this paper a domain decomposition method to treat faults in geological basin modeling. The particularity of this model is that the faults whose widths are very small in comparison with the basin size, are not characterized as subdomains any more but as interfaces between sedimentary blocks. The originality of this work lies in the formulation of this new fault model and in the definition and the computation of the interface conditions between the subdomains. To cite this article: E. Flauraud et al., C. R. Mecanique 331 (2003).     

A note on conservation laws for a multiclass service queueing system with setup times

This paper derives a conservation law for mean waiting times in a single-server multi-class service queueing system (M ^X/G/1 type queue) with setup times which may be dependent on multiple customer classes and its arrival batch size by using the work decomposition property in the queueing system with vacations.     

GDDP: Generalized Dual Dynamic Programming Theory

This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7].