Iterated monoidal categories

We develop a notion of an n-fold monoidal category and show that it corresponds in a precise way to the notion of an n-fold loop space. Specifically, the group completion of the nerve of such a category is an n-fold loop space, and free n-fold monoidal categories give rise to a finite simplicial operad of the same homotopy type as the classical little cubes operad used to parametrize the higher H-space structure of an n-fold loop space. We also show directly that this operad has the same homotopy type as the n-th Smith filtration of the Barratt-Eccles operad and the n-th filtration of Berger's complete graph operad. Moreover, this operad contains an equivalent preoperad which gives rise to Milgram's small model for when n=2 and is very closely related to Milgram's model of for n>2.     

Composite structure of global unbounded solutions of nonlinear heat equations with critical Sobolev exponents

We describe special asymptotic structures of solutions of the semilinear heat equation

     

On the ?ojasiewicz-Simon gradient inequality

We prove a general version of the ?ojasiewicz-Simon inequality, and we show how to apply the abstract result to study energy functionals E of the form

     

Maximum norm stability of difference schemes for parabolic equations on overset nonmatching space-time grids

In this paper, theoretical results are described on the maximum norm stability and accuracy of finite difference discretizations of parabolic equations on overset nonmatching space-time grids. We consider parabolic equations containing a linear reaction term on a space-time domain which is decomposed into an overlapping collection of cylindrical subregions of the form , for . Each of the space-time domains are assumed to be independently grided (in parallel) according to the local geometry and space-time regularity of the solution, yielding space-time grids with mesh parameters and . In particular, the different space-time grids need not match on the regions of overlap, and the time steps can differ from one grid to the next. We discretize the parabolic equation on each local grid by employing an explicit or implicit -scheme in time and a finite difference scheme in space satisfying a discrete maximum principle. The local discretizations are coupled together, without the use of Lagrange multipliers, by requiring the boundary values on each space-time grid to match a suitable interpolation of the solution on adjacent grids. The resulting global discretization yields a large system of coupled equations which can be solved by a parallel Schwarz iterative procedure requiring some communication between adjacent subregions. Our analysis employs a contraction mapping argument.

Applications of the results are briefly indicated for reaction-diffusion equations with contractive terms and heterogeneous hyperbolic-parabolic approximations of parabolic equations.

     

Strongly inequivalent representations and Tutte polynomials of matroids

We develop constructive techniques to show that non-isomorphic 3-connected matroids that are representable over a fixed finite field and that have the same Tutte polynomial abound. In particular, for most prime powers q, we construct infinite families of sets of 3-connected matroids for which the matroids in a given set are non-isomorphic, are representable over GF(q), and have the same Tutte polynomial. Furthermore, the cardinalities of the sets of matroids in a given family grow exponentially as a function of rank, and there are many such families.In Memory of Gian-Carlo Rota     

A note on the isotopy problem for $$ \mathbb{R}^2 $$ -planes

For a class of stable planes we define a notion of isotopy equivalence with respect to that class and prove that any two planes of a certain class of -planes comprising all affine -planes are isotopy equivalent. Furthermore we obtain that all affine -planes are isotopy equivalent in the class of affine -planes. Finally we give an example which shows that this approach cannot be easily generalized to 2-dimensional projective planes, and we outline a different way for a possible generalization.Received: 27 April 2001     

Symmetric Groups and Lattices

This paper deals with various problems in lattice theory involving local extrema. In particular, we construct infinite series of highly symmetric spherical 3-designs which include some of the examples constructed in [9] in dimensions 5 and 7. We also construct new types of dual-extreme lattices.Received June 29, 2002; in final form January 14, 2003 Published online May 16, 2003     

On the Metrical Theory of Continued Fraction Mixing Fibred Systems and Its Application to Jacobi-Perron Algorithm

 We study the metrical theory of fibred systems, in particular, in the case of continued fraction mixing systems. We get the limit distribution of the largest value of a continued fraction mixing stationary stochastic process with infinite expectation and some related results. These are analogous to J. Galambos, W. Philipp, and H. G. Diamond–J. D. Vaaler theorems for the regular continued fractions. As an application, we see that these theorems hold for Jacobi-Perron algorithm. Received September 30, 2001; in revised form January 8, 2002     

Combings of groups and the grammar of reparameterization

A new construction of combings is used to distinguish between several previously indistinguishable classes of groups associated to the theory of automatic groups and non-positive curvature in group theory. We construct synchronously bounded combings for a class of groups that are neither bicombable nor automatic. The linguistic complexity of these combings is analysed: in many cases the language of words in the combing is an indexed language.