Induction and foundation in the theory of hereditarily finite sets

The paper contains an axiomatic treatment of the intuitionistic theory of hereditarily finite sets, based on an induction axiom-schema and a finite set of single axioms. The main feature of the principle of induction used (due to Givant and Tarski) is that it incorporates Foundation. On the analogy of what is done in Arithmetic, in the axiomatic system selected the transitive closure of the membership relation is taken as a primitive notion, so as to permit an immediate adaptation of the theory to cases of restricted induction (in particular primitive recursive induction). At the end of the paper several different forms of induction, which play an important role in the development of the theory, are compared. An alternative axiomatization of the theory, which is of intrinsic interest, is also discussed.     

A mixed directed-undirected data structure for a parallel implementation of a domain decomposition algorithm

The choice of data structures influences the parallelization, efficiency and the manageability of a mesh refinement program. We introduce a mixed directed-undirected graph that combines both communication and scheduling needs. An inverted index is maintained for the directed graph to improve code performance and readability.This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract No. W-7405-Eng-48.     

Partially finite convex programming,Part I: Quasi relative interiors and duality theory

We study convex programs that involve the minimization of a convex function over a convex subset of a topological vector space, subject to a finite number of linear inequalities. We develop the notion of the quasi relative interior of a convex set, an extension of the relative interior in finite dimensions. We use this idea in a constraint qualification for a fundamental Fenchel duality result, and then deduce duality results for these problems despite the almost invariable failure of the standard Slater condition. Part II of this work studies applications to more concrete models, whose dual problems are often finite-dimensional and computationally tractable.     

Algebraic properties of the 1 + 1-dimensional Heisenberg spin field model

The Estabrook-Wahlquist prolongation method is applied to the (compact and noncompact) continuous isotropic Heisenberg model in 1 + 1 dimensions. Using a special realization (an algebra of the Kac-Moody type) of the arising incomplete prolongation Lie algebra, a whole family of nonlinear field equations containing the original Heisenberg system is generated.     

Déformations des algèbres de Lie locales et analogue du théorème d'algébricité de Carles

Sans résumé

---

     

Castelnuovo-Mumford regularity by approximation

The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given a system of approximating modules whose regularities are known. Such approximations can arise naturally for modules constructed by inductive combinatorial means. We apply these methods to bound the regularity of ideals constructed as combinations of linear ideals and the module of derivations of a hyperplane arrangement as well as to give degree bounds for invariants of finite groups.     

The six semifield planes associated with a semifield flock

In 1965 Knuth (J. Algebra 2 (1965) 182) noticed that a finite semifield was determined by a 3-cube array (a_ijk) and that any permutation of the indices would give another semifield. In this article we explain the geometrical significance of these permutations. It is known that a pair of functions (f,g) where f and g are functions from GF(q) to GF(q) with the property that f and g are linear over some subfield and g(x)²+4xf(x) is a non-square for all x∈GF(q)∗, q odd, give rise to certain semifields, one of which is commutative of rank 2 over its middle nucleus, one of which arises from a semifield flock of the quadratic cone, and another that comes from a translation ovoid of Q(4,q). We show that there are in fact six non-isotopic semifields that can be constructed from such a pair of functions, which will give rise to six non-isomorphic semifield planes, unless (f,g) are of linear type or of Dickson-Kantor-Knuth type. These six semifields fall into two sets of three semifields related by Knuth operations.     

On uniformity of exponential dichotomies for delay equations

It is shown that there cannot exist a uniform exponential dichotomy for any linear delay equation with a positive finite delay.     

Uniform persistence for nonautonomous and random parabolic Kolmogorov systems

The purpose of this paper is to investigate uniform persistence for nonautonomous and random parabolic Kolmogorov systems via the skew-product semiflows approach. It is first shown that the uniform persistence of the skew-product semiflow associated with a nonautonomous (random) parabolic Kolmogorov system implies that of the system. Various sufficient conditions in terms of the so-called unsaturatedness and/or Lyapunov exponents for uniform persistence of the skew-product semiflows are then provided. Among others, it is shown that if the associated skew-product semiflow has a global attractor and its restriction to the boundary of the state space has a Morse decomposition which is unsaturated or whose external Lyapunov exponents are positive, then it is uniformly persistent. More specific conditions are discussed for uniform persistence in n-species, particularly 3-species, random competitive systems.