Completeness and compactness for varieties over a local field

This paper shows that for a local field K, a subfield k ⊂ K and a variety X over k, X is complete if and only if for every finite field extension Kʹ | K, the set X(Kʹ) is compact in its strong topology. The author likes to thank Florian Pop, Jakob Stix, Stefan Wewers, Gunther Cornelissen and his own parents for their support. Received: 13 April 2006     

A study of the effect of ZrO2 on the magnetic properties of FePt/ZrO2 multilayer

Fe_xPt_100−x(30 nm) and [Fe_xPt_100−x(3 nm)/ZrO₂]₁₀ (x = 37, 48, 57, 63, 69) films with different ZrO₂ content were prepared by RF magnetron sputtering technique, then were annealed at 550 °C for 30 min. This work investigates the effect of ZrO₂ doping on the microstructural evolution, magnetic properties, grain size, as well as the ordering kinetics of FePt alloy films. The as-deposited films behaved a disordered state, and the ordered L1₀ structure was obtained by post-annealing. The magnetic properties of the films are changed from soft magnetism to hard magnetism after annealing. The variation of the largest coercivities of [Fe_xPt_100−x/ZrO₂]₁₀ films with the Fe atomic percentage, x and differing amounts of ZrO₂ content reveals that as we increase the ZrO₂ content we must correspondingly increase the amount of Fe. This phenomenon suggests that the Zr or O atoms of ZrO₂ preferentially react with the Fe atoms of FePt alloy to form compounds. In addition, introducing the nonmagnetic ZrO₂ can reduce the intergrain exchange interactions of the FePt/ZrO₂ films, and the interactions are decreased as the ZrO₂ content increases, the dipole interactions are observed in FePt/ZrO₂ films as the ZrO₂ content is more than 15%.     

On dimensional rigidity of bar-and-joint frameworks

Let V={1,2,…,n}. A mapping p:V→R^r, where p¹,…,pⁿ are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in R^r, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in R^r is said to be dimensionally rigid iff there does not exist a framework G(q) in R^s for s?r+1, such that ∥qⁱ-q^j∥²=∥pⁱ-p^j∥² for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p¹,…,pⁿ of the given r-configuration are in general position, is also investigated.     

Prospective and retrospective analyses under logistic regression models

In logistic case-control studies, Prentice and Pyke (Biometrika 66 (1979) 403-411) showed that valid point estimators of the odds-ratio parameters and their standard errors may be obtained by fitting the prospective logistic regression model to case-control data. Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) generalized Prentice and Pyke's (Biometrika 66 (1979) 403-411) results to robust logistic case-control studies. In this paper, we extend the results of Prentice and Pyke (Biometrika 66 (1979) 403-411) and Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) to a class of statistics and a class of unbiased estimating equations. We present some results on simulation and on the analysis of two real datasets.     

Some new topological cardinal inequalities

In this paper we make use of the Pol-Šapirovski?'s technique to prove several cardinal inequalities, which generalize other well-known inequalities.     

Algorithms for finding connected separators between antipodal points

A set (or a collection of sets) contained in the Euclidean space Rm is symmetric if it is invariant under the antipodal map. Given a symmetric unicoherent polyhedron X (like an n-dimensional cube or a sphere) and an odd real function f defined on vertices of a certain symmetric triangulation of X, we algorithmically construct a connected symmetric separator of X by choosing a subcollection of the triangulation. Each element of the subcollection contains the vertices v and u such that f(v)f(u)?0.     

On the moduli spaces of multipolygonal linkages in the plane

One can form a polygonal linkage by identifying initial and terminal points of two free linkages. Likewise, one can form a multipolygonal linkage by identifying initial and terminal points of three free linkages. The geometric and topological properties of moduli spaces of multipolygonal linkages in the plane are studied. These spaces are compact algebraic varieties. Some conditions under which these spaces are smooth manifolds, cross products or disjoint unions of moduli spaces of polygonal linkages, or connected, are determined. Dimensions in smooth manifold cases and some Euler characteristics are computed. A classification of generic multiquadrilateral linkages is also made.     

Coalgebraic representations of distributive lattices with operators

We present a framework for extending Stone's representation theorem for distributive lattices to representation theorems for distributive lattices with operators. We proceed by introducing the definition of algebraic theory of operators over distributive lattices. Each such theory induces a functor on the category of distributive lattices such that its algebras are exactly the distributive lattices with operators in the original theory. We characterize the topological counterpart of these algebras in terms of suitable coalgebras on spectral spaces. We work out some of these coalgebraic representations, including a new representation theorem for distributive lattices with monotone operators.     

Nonminimal sets,their projections and integral representations of stable processes

New criteria are provided for determining whether an integral representation of a stable process is minimal. These criteria are based on various nonminimal sets and their projections, and have several advantages over and shed light on already available criteria. In particular, they naturally lead from a nonminimal representation to the one which is minimal. Several known examples are considered to illustrate the main results. The general approach is also adapted to show that the so-called mixed moving averages have a minimal integral representation of the mixed moving average type.