Small worlds

Small world models are networks consisting of many local links and fewer long range ‘shortcuts’. In this paper, we consider some particular instances, and rigorously investigate the distribution of their inter‐point network distances. Our results are framed in terms of approximations, whose accuracy increases with the size of the network. We also give some insight into how the reduction in typical inter‐point distances occasioned by the presence of shortcuts is related to the dimension of the underlying space. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19, 54–74, 2001     

Small profinite structures

We propose a model-theoretic framework for investigating profinite structures. We prove that in many cases small profinite structures interpret infinite groups. This corresponds to results of Hrushovski and Peterzil on interpreting groups in locally modular stable and o-minimal structures.

     

Small skew fields

A small field of positive characteristic is commutative. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Small Box-Behnken design

Box-Behnken design has been popularly used for the second-order response surface model. It is formed by combining two-level factorial designs with incomplete block designs in a special manner—the treatments in each block are replaced by an identical design. In this paper, we construct small Box-Behnken design. These designs can fit the second-order response surface model with reasonably high efficiencies but with only a much smaller run size. The newly constructed designs make use of balanced incomplete block design (BIBD) or partial BIBD, and replace treatments partly by 2_III³⁻¹ designs and partly by full factorial designs. It is shown that the orthogonality properties in the original Box and Behnken designs will be kept in the new designs. Furthermore, we classify the parameters into groups and introduce Group Moment Matrix (GMM) to estimate all the parameters in each group. This allows us to significantly reduce the amount of computational costs in the construction of the designs.     

Small exponent asymptotics

We study the surprisingly complicated asymptotic character ofa simple first-order differential equation, which involves aterm with a low exponent of the dependent variable. While numericalsolutions and straightforward asymptotic expansions indicatea clearly defined boundary layer type transition, we find thatthe correct asymptotic structure involves a 'hidden' boundarylayer, and that a straightforward approach cannot discern this.     

Small non-Arguesian lattices

Presented by R. McKenzie.     

Small loop spaces

The importance of small loops in the covering space theory was pointed out by Brodskiy, Dydak, Labuz, and Mitra in [2] and [3]. A small loop is a loop which is homotopic to a loop contained in an arbitrarily small neighborhood of its base point and a small loop space is a topological space in which every loop is small. Small loops are the strongest obstruction to semi-locally simply connectedness. We construct a small loop space using the Harmonic Archipelago. Furthermore, we define the small loop group of a space and study its impact on covering spaces, in particular its contribution to the fundamental group of the universal covering space.     

Small holding circles

A circle C holds a convex body K if C does not meet the interior of K and if there does not exist any euclidean displacement which moves C as far as desired from K, avoiding the interior of K. The purpose of this note is to explore how small can be a holding circle. In particular it is shown that the diameter of such a holding circle can be less than the width w of the body but is always greater than 2w/3.     

Small Forbidden Configurations

In the present paper we continue the work begun by Sauer, Perles, Shelah and Anstee on forbidden configurations of 0–1 matrices. We give asymptotically exact bounds for all possible 2 × l forbidden submatrices and almost all 3 × l ones. These bounds are improvements of the general bounds, or else new constructions show that the general bound is best possible. It is interesting to note that up to the present state of our knowledge every forbidden configuration results in polynomial asymptotic.     

On Exponentially Small Effects in Dynamical Systems with a Small Parameter

In the present paper, we obtain a theorem that enables us to treat different exponentially small effects of dynamics from a unified point of view. As an example, we discuss the problem of fast phase averaging in a nonautonomous Hamiltonian system with 3/2 degrees of freedom. Bibliography: 5 titles.__________Published in Zapiski Nauchnykh Seminarov POMI, Vol. 300, 2003, pp. 273–278.     

Small gaps between primes

Combining Goldston-Yildirim’s method on k-correlations of the truncated von Mangoldt function with Maier’s matrix method, we show that for all r ≧ 1 where p _n denotes the nth prime number and γ is Euler’s constant. This is the best known result for any r ≧ 11.      

Small subsets of groups

Given an infinite group G and an infinite cardinal κ|G|, we say that a subset A of G is κ-large (κ-small) if there exists F[G]^<κ such that G=FA (GFA is κ-large for each F[G]^<κ). The subject of the paper is the family of all κ-small subsets. We describe the left ideal of the right topological semigroup βG determined by . We study interrelations between κ-small and other (P_κ-small and κ-thin) subsets of groups, and prove that G can be generated by some 2-thin subsets. We partition G in countable many subsets which are κ-small for each κω. We show that [G]^<κ is dual to provided that either κ is regular and κ=|G|, or G is Abelian and κ is a limit cardinal, or G is a divisible Abelian group.     

Codes of Small Defect

The parameters of a linear code C over GF(q) are given by [n,k,d], where n denotes the length, k the dimension and d the minimum distance of C. The code C is called MDS, or maximum distance separable, if the minimum distance d meets the Singleton bound, i.e. d = n-k+1 Unfortunately, the parameters of an MDS code are severely limited by the size of the field. Thus we look for codes which have minimum distance close to the Singleton bound. Of particular interest is the class of almost MDS codes, i.e. codes for which d=n-k. We will present a condition on the minimum distance of a code to guarantee that the orthogonal code is an almost MDS code. This extends a result of Dodunekov and Landgev Dodunekov. Evaluation of the MacWilliams identities leads to a closed formula for the weight distribution which turns out to be completely determined for almost MDS codes up to one parameter. As a consequence we obtain surprising combinatorial relations in such codes. This leads, among other things, to an answer to a question of Assmus and Mattson 5 on the existence of self-dual [2d,d,d]-codes which have no code words of weight d+1. Actually there are more codes than Assmus and Mattson expected, but the examples which we know are related to the expected ones.