A remark on partial linear spaces of girth 5 with an application to strongly regular graphs

We derive a lower bound on the number of points of a partial linear space of girth 5. As an application, certain strongly regular graphs with=2 are ruled out by observing that the first subconstituents are partial linear spaces.     

Symmetric Skorohod topology onn-variable functions and hierarchical Markov properties ofn-parameter processes

Summary We introduce a new Skorohod topology for functions of several variables. Since ann-variable function may be viewed as a one-variable function with values in the set of (n–1)-variable functions, this topology is defined by induction from the classical Skorohod topology for one-variable functions. This allows us to define the notion of completen-parameter symmetric Markov processes: Such processes are, for any 1pn, rawp-parameter Markov processes (in the sense of our previous paper [17]) with values in the space of (n–p)-variable functions. We prove, for these processes and their Bochner subordinates, a maximal inequality which implies the continuity of additive functionals associated with finite energy measures. We finally present several important examples.     

Spencer cohomologies and symmetry groups

We propose the construction of a spectral sequence converging to Spencer cohomologies. By using symmetry groups of differential equations systems, we manage to unify computations by reduction to the invariant systems over a homogeneous space. The conditions of coincidence of Spencer cohomologies with the cohomologies of an invariant Spencer complex we obtain from the arithmetic of a -characteristic manifold with respect to fundamental weights of the homogeneous space.     

Brownian confinement and pinning in a Poissonian potential. II

Summary We continue our study ofd-dimensional Brownian motion in a soft repulsive Poissonian potential over a long time interval [0,t]. We prove here a pinning effect: for typical configuratons, with probability tending to 1 ast tends to , the particle gets trapped close to locations of near minima of certain variational problems. These locations lie at distances growing almost linearly witht from the origin, and the particle gets pinned within distance smaller than any positive power oft of one such location. In dimension 1, we can push further our estimates and show that in a suitable sense, the particle gets trapped with high probability, within time t and within distance (logt)²⁺ from a suitable location at distance of ordert/(logt)³ from the origin.This article was processed by the author using the LATEX style filepljour1m from Springer-Verlag     

Processes of flats induced by higher dimensional processes III

Stationary processes of k-flats in ^d can be thought of as point processes on the Grassmannian _k ^d of k-dimensional subspaces of ^d . If such a process is sampled by a (d–k+ j)-dimensional space F, it induces a process of j-flats in F. In this work we will investigate the possibility of determining the original k-process from knowledge of the intensity measures of the induced j-processes. We will see that this is impossible precisely when 1<k<d–1 and j=0,...,2[r/2]–1, where r is the rank of the manifold _k ^d . We will show how the problem is equivalent to the study of the kernel of various integral transforms, these will then be investigated using harmonic analysis on Grassmannian manifolds.The research of the first and third authors was supported in part by NSF grants DMS-9207019 and DMS-9304284. The research of the second author was supported in part by NFR contract number R-RA 4873-306 and the Swedish Academy of Sciences.     

A note on “small representations of finite distributive lattices as congruence lattices”

G. Grätzer, H. Lakser, and E. T. Schmidt proved that every distributive lattice with n join-irreducible elements can be represented as the congruence lattice of a small lattice L, that is, a lattice L with O(n ² ) elements. G. Grätzer, I. Rival, and N. Zaguia proved that, for any <2, O(n ² ) can not be improved to O(n ). In this note we show that the theorem about small representation can be improved further to get a more delicate result.     

On spectral properties ofq-oscillator operators

The property of self-adjointness of the operatorQ =a ₊ +a _- in three types ofq-oscillator algebras is considered. Spectral measures and generalized eigenfunctions ofQ are found in the cases when this operator is bounded. Generalized eigenvectors are expressed in terms ofq-Hermite polynomials. If the operatorQ is unbounded, then its closure is not self-adjoint. However, in this case, admits self-adjoint extensions. Deficiency subspaces are one-dimensional. These subspaces are explicitly found.     

The algebra of directed complexes

The theory of directed complexes is a higher-dimensional generalisation of the theory of directed graphs. In a directed graph, the simple directed paths form a subset of the free category which they generate; if the graph has no directed cycles, then the simple directed paths constitute the entire category. Generalising this, in a directed complex there is a class of split subsets which is contained in and generates a free -category; when a simple loop-freeness condition is satisfied, the split sets constitute the entire -category. The class of directed complexes is closed under the natural product and join constructions. The free -categories generated by directed complexes include the important examples associated to cubes and simplexes.     

Banach algebras of singular integral operators with piecewise continuous coefficients. General contour and weight

The Banach algebra generated by one-dimensional linear singular integral operators with matrix valued piecewise continuous coefficients in the spaceL _p (,) with an arbitrary weight is studied. The contour consists of a finite number of closed curves and open arcs with satisfy the Carleson condition. The contour may have a finite number of points of selfintersection. The symbol calculus in this algebra is the main result of the paper.     

Counterexamples in optimal quadrature

It is widely believed that order of exactness is a good measure of the quality of an algorithm for numerical quadrature. We show that this is not the case, by exhibiting a situation in which the optimal algorithm does not even integrate constants exactly. We also show that there are situations in which the penalty for using equidistant nodes is unbounded. Finally, we show that the complexity of obtaining an -approximation can be an arbitrary function of , i.e., there is no hardest quadrature problem.