Finiteness of U‐rank implies simplicity in homogeneous structures

A (large) superstable homogeneous structure is said to be simple if every complete type over any set A has a free extension over any B ? A. In this paper we give a characterization for this property in terms of U‐rank. As a corollary we get that if the structure has finite U‐rank, then it is simple. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Binary types in ℵ0‐categorical weakly o‐minimal theories

Orthogonality of all families of pairwise weakly orthogonal 1‐types for ?₀‐categorical weakly o‐minimal theories of finite convexity rank has been proved in 6 . Here we prove orthogonality of all such families for binary 1‐types in an arbitrary ?₀‐categorical weakly o‐minimal theory and give an extended criterion for binarity of ?₀‐categorical weakly o‐minimal theories (additionally in terms of binarity of 1‐types). © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Perturbation theory for generalized and constrained linear least squares

The perturbation analysis of weighted and constrained rank‐deficient linear least squares is difficult without the use of the augmented system of equations. In this paper a general form of the augmented system is used to get simple perturbation identities and perturbation bounds for the general linear least squares problem both for the full‐rank and rank‐deficient problem. Perturbation identities for the rank‐deficient weighted and constrained case are found as a special case. Interesting perturbation bounds and condition numbers are derived that may be useful when considering the stability of a solution of the rank‐deficient general least squares problem. Copyright © 2000 John Wiley & Sons, Ltd.     

Finitely generated submodels of an uncountably categorical homogeneous structure

We generalize the result of non‐finite axiomatizability of totally categorical first‐order theories from elementary model theory to homogeneous model theory. In particular, we lift the theory of envelopes to homogeneous model theory and develope theory of imaginaries in the case of ω‐stable homogeneous classes of finite U‐rank. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Minimum rank of skew-symmetric matrices described by a graph

The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. The problem of determining minimum (symmetric) rank has been studied extensively. We define the minimum skew rank of a simple graph G to be the smallest possible rank among all skew-symmetric matrices over F whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. We apply techniques from the minimum (symmetric) rank problem and from skew-symmetric matrices to obtain results about the minimum skew rank problem.     

A Unified Integral Equation Scheme for Doubly Periodic Laplace and Stokes Boundary Value Problems in Two Dimensions

We present a spectrally accurate scheme to turn a boundary integral formulation for an elliptic PDE on a single unit cell geometry into one for the fully periodic problem. The basic idea is to use a small least squares solve to enforce periodic boundary conditions without ever handling periodic Green's functions. We describe fast solvers for the two‐dimensional (2D) doubly periodic conduction problem and Stokes nonslip fluid flow problem, where the unit cell contains many inclusions with smooth boundaries. Applications include computing the effective bulk properties of composite media (homogenization) and microfluidic chip design. We split the infinite sum over the lattice of images into a directly summed “near” part plus a small number of auxiliary sources that represent the (smooth) remaining “far” contribution. Applying physical boundary conditions on the unit cell walls gives an expanded linear system, which, after a rank‐1 or rank‐3 correction and a Schur complement, leaves a well‐conditioned square system that can be solved iteratively using fast multipole acceleration plus a low‐rank term. We are rather explicit about the consistency and nullspaces of both the continuous and discretized problems. The scheme is simple (no lattice sums, Ewald methods, or particle meshes are required), allows adaptivity, and is essentially dimension‐ and PDE‐independent, so it generalizes without fuss to 3D and to other elliptic problems. In order to handle close‐to‐touching geometries accurately we incorporate recently developed spectral quadratures. We include eight numerical examples and a software implementation. We validate against high‐accuracy results for the square array of discs in Laplace and Stokes cases (improving upon the latter), and show linear scaling for up to 10⁴ randomly located inclusions per unit cell. © 2018 Wiley Periodicals, Inc.     

A Generic Identification Theorem for L1-groups of finite Morley rank

This paper provides a method for identifying “sufficiently rich” simple groups of finite Morley rank with simple algebraic groups over algebraically closed fields. Special attention is given to the even type case, and the paper contains a number of structural results about simple groups of finite Morley rank and even type.     

A new trichotomy theorem for groups of finite Morley rank

There is a longstanding conjecture, of Gregory Cherlin and BorisZilber, that all simple groups of finite Morley rank are simplealgebraic groups. Here we will conclude that a simple K*-groupof finite {M}orley rank and odd type either has normal rankof at most 2, or else is an algebraic group over an algebraicallyclosed field of characteristic not 2. To this end, it sufficesto produce a proper 2-generated core in groups with \Pruferrank 2 and normal rank at least 3, which is what is proved here.Our final conclusion constrains the Sylow 2-subgroups availableto a minimal counterexample and, finally, proves the trichotomytheorem in the nontame context.     

Classification of irreducible weight modules over higher rank Virasoro algebras

Let G be a rank n additive subgroup of C and Vir[G] the corresponding Virasoro algebra of rank n. In the present paper, irreducible weight modules with finite dimensional weight spaces over Vir[G] are completely determined. There are two different classes of them. One class consists of simple modules of intermediate series whose weight spaces are all 1-dimensional. The other is constructed by using intermediate series modules over a Virasoro subalgebra of rank n−1. The classification of such modules over the classical Virasoro algebra was obtained by O. Mathieu in 1992 using a completely different approach.     

On Vapnik‐Chervonenkis density over indiscernible sequences

In this paper, we study Vapnik‐Chervonenkis density (VC‐density) over indiscernible sequences (denoted VC_ind‐density). We answer an open question in [1], showing that VC_ind‐density is always integer valued. We also show that VC_ind‐density and dp‐rank coincide in the natural way.     

On definability of types of finite Cantor‐Bendixson rank

We prove that every type of finite Cantor‐Bendixson rank over a model of a first‐order theory without the strict order property is definable and has a unique nonforking extension to a global type. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

On Purity and Quasiequality of Abelian Groups

We study the Cohn purity in an abelian group regarded as a left module over its endomorphism ring. We prove that if a finite rank torsion-free abelian group G is quasiequal to a direct sum in which all summands are purely simple modules over their endomorphism rings then the module _E(G) G is purely semisimple. This theorem makes it possible to construct abelian groups of any finite rank which are purely semisimple over their endomorphism rings and it reduces the problem of endopure semisimplicity of abelian groups to the same problem in the class of strongly indecomposable abelian groups.     

Imbedding a Filial Ring with Identity

We obtain that a uniformly bounded simple module over a high rank Virasoro algebra is a module of the intermediate series, and that a simple module with finite dimensional weight spaces is either a module of the intermediate series or a so-called GHW module.

     

Simple groups of finite morley rank and Tits buildings

Theorem A:If ℬ is an infinite Moufang polygon of finite Morley rank, then ℬ is either the projective plane, the symplectic quadrangle, or the split Cayley hexagon over some algebraically closed field. In particular, ℬ is an algebraic polygon. It follows that any infinite simple group of finite Morley rank with a spherical MoufangBN-pair of Tits rank 2 is eitherPSL ₃(K),PSp ₄(K) orG ₂(K) for some algebraically closed fieldK. Spherical irreducible buildings of Tits rank ≥ 3 are uniquely determined by their rank 2 residues (i.e. polygons). Using Theorem A we show Theorem B:If G is an infinite simple group of finite Morley rank with a spherical Moufang BN-pair of Tits rank ≥ 2, then G is (interpretably) isomorphic to a simple algebraic group over an algebraically closed field. Theorem C:Let K be an infinite field, and let G(K) denote the group of K-rational points of an isotropic adjoint absolutely simple K-algebraic group G of K-rank ≥ 2. Then G(K) has finite Morley rank if and only if the field K is algebraically closed. We also obtain a result aboutBN-pairs in splitK-algebraic groups: such aBN-pair always contains the root groups. Furthermore, we give a proof that the sets of points, lines and flags of any ℵ₁-categorical polygon have Morley degree 1. Partially sponsored by the Edmund Landau Center for Research in Mathematical Analysis, supported by the Minerva Foundation (Germany). Supported by the Minerva Foundation (Germany). Research Director at the Fund for Scientific Research-Flanders (Belgium).     

Zero forcing sets and the minimum rank of graphs

The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise. This paper introduces a new graph parameter, Z(G), that is the minimum size of a zero forcing set of vertices and uses it to bound the minimum rank for numerous families of graphs, often enabling computation of the minimum rank.