On decompositions in homotopy theory

We first describe Krull-Schmidt theorems decomposing spaces and simply-connected co- spaces into atomic factors in the category of pointed nilpotent -complete spaces of finite type. We use this to construct a 1-1 correspondence between homotopy types of atomic spaces and homotopy types of atomic co- spaces, and construct a split fibration which connects them and illuminates the decomposition. Various properties of these constructions are analyzed.

     

Oscillation theory at a finite singularity

It is well known that every weak solution (with boundary values 0) of a semilinear equation $\text{Au + ?(x, u) = g}$ is a regular solution if ? fulfils the growth condition $\text{(1) ¦?(x, u)¦? c ¦u¦}{}^{\mathrm{<mtext>(n\; +\; 2m)</mtext><mtext>(n\; ?\; 2m)</mtext><mtext>\; ?\; ?</mtext>}}$. Here 2m is the order of A. In this paper we weaken this condition to $\text{c ¦u ¦}{}^{\mathrm{<mtext>(n\; +\; 2m)</mtext><mtext>(n\; ?\; 2m)</mtext><mtext>\; +\; 1</mtext>}}\text{? ?(x, u)u ? ?c ¦u ?}{}^{\mathrm{<mtext>(n\; +\; 2m)</mtext><mtext>(n\; ?\; 2m)</mtext><mtext>\; +\; 1\; ?\; ?</mtext>}}$. This requires a technique completely different from that which may be applied in case (1).     

An existence theory for loopy graph decompositions

Let v≥k≥1 and λ≥0 be integers. Recall that a (v, k, λ) block design is a collection ??of k‐subsets of a v‐set X in which every unordered pair of elements in X is contained in exactly λ of the subsets in ??. Now let G be a graph with no multiple edges. A (v, G, λ) graph design is a collection ??of subgraphs, each isomoprhic to G, of the complete graph K_v such that each edge of K_v appears in exactly λof the subgraphs in ??. A famous result of Wilson states that for a fixed simple graph G and integer λ, there exists a (v, G, λ) graph design for all sufficiently large integers v satisfying certain necessary conditions. Here, we extend this result to include the case of loops in G. As a consequence, we obtain the asymptotic existence of equireplicate graph designs. Applications of the equireplicate condition are given. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:280‐289, 2011     

New representations of spline-wavelet decompositions

New representations of the decomposition and reconstruction operators are obtained in the cases of an infinite flow (with a grid on an open interval) and a finite flow (with a grid on a segment) for the space of (in general, not polynomial) splines of Lagrange type. Bibliography: 12 titles.     

From singularity theory to finiteness of Walrasian equilibria

The main result of this paper states that there exists a residual subset of the set of critical economies whose associated equilibria are finite in number. We also show that this subset does not contain any open set and therefore the result is the best possible for our choice of topology (compact-open topology). The proof rests on results and concepts from singularity theory.     

A numerical approach to some basic theorems in singularity theory

In this paper, we give the explicit bounds for the data of objects involved in some basic theorems of singularity theory: the inverse, implicit and rank theorems for Lipschitz mappings, the splitting lemma and the Morse lemma, the density and openness of Morse functions. We expect that the results will make singularities more applicable and will be useful for numerical analysis and some fields of computing.     

Statistical theory of shape under elliptical models and singular value decompositions

The size-and-shape and shape distributions based on non-central and non-isotropic elliptical distributions are derived in this paper by using the singular value decomposition (SVD). The general densities require the computation of new integrals involving zonal polynomials. The invariance of the central shape distribution is also proved. Finally, some particular densities are applied in a classical data of Biology, and the inference based on exact distributions is performed after choosing the best model by using a modified BIC^∗ criterion.     

On asymptotic decompositions of o-solutions in the theory of quasilinear systems of difference equations

We consider a quasilinear system of difference equations with certain conditions. We prove that there exists a formal partial o-solution of this system in the form of functional series of special type. We also prove a theorem on the asymptotic behavior of this solution. Odessa University, Odessa. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 49, No. 5, pp. 672–677, May, 1997.     

New polytope decompositions and Euler-Maclaurin formulas for simple integral polytopes

We give new weighted decompositions for simple polytopes, generalizing previous results of Lawrence-Varchenko and Brianchon-Gram. We start with Witten's non-abelian localization principle in equivariant cohomology for the norm-square of the moment map in the context of toric varieties to obtain a decomposition for Delzant polytopes. Then, by a purely combinatorial argument, we show that this formula holds for any simple polytope. As an application, we study Euler-Maclaurin formulas.     

Repetition in reduced decompositions

Given a permutation w, we show that the number of repeated letters in a reduced decomposition of w is always less than or equal to the number of 321- and 3412-patterns appearing in w. Moreover, we prove bijectively that the two quantities are equal if and only if w avoids the ten patterns 4321, 34 512, 45 123, 35 412, 43 512, 45 132, 45 213, 53 412, 45 312, and 45 231.     

Rainbow decompositions

A rainbow coloring of a graph is a coloring of the edges with distinct colors. We prove the following extension of Wilson's Theorem. For every integer there exists an so that for all , if

then every properly edge-colored contains pairwise edge-disjoint rainbow copies of .

Our proof uses, as a main ingredient, a double application of the probabilistic method.