An Enumerative Geometry for Magic and Magilatin Labellings

A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Dedicated to the memory of Claudia Zaslavsky, 1917–2006 Received August 10, 2005     

Mackey Topologies and Mixed Topologies in Riesz Spaces

The possibility of characterizing the Mackey topology of a dual pair of vector spaces as a generalized inductive limit (or mixed) topology is investigated. Positive answers are given for a wide range of dual pairs of Riesz spaces (vector lattices) and non-commutative Banach function spaces (or symmetric operator spaces).     

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.     

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.     

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.     

π1-classification of real arrangements with up to eight lines

One of the open questions in the geometry of line arrangements is to what extent does the incidence lattice of an arrangement determine its fundamental group. Line arrangements of up to 6 lines were recently classified by K.M. Fan (Michigan Math. J. 44(2) (1997) 283), and it turns out that the incidence lattice of such arrangements determines the projective fundamental group. We use actions on the set of wiring diagrams, introduced in (Garber et al. (J. Knot Theory Ramf.), to classify real arrangements of up to 8 lines. In particular, we show that the incidence lattice of such arrangements determines both the affine and the projective fundamental groups.     

Completely empty pyramids on integer lattices and two-dimensional faces of multidimensional continued fractions

In this paper we develop an integer-affine classification of three-dimensional multistory, completely empty convex marked pyramids. We apply it to obtain the complete lists of compact two-dimensional faces of multidimensional continued fractions lying in planes at integer distances 2, 3, 4, …  to the origin. The faces are considered up to the action of the group of integer-linear transformations.     

显微镜工作台闭环控制系统的设计与实现

高精度工作台控制系统是现代自动显微系统的重要组成部分,其精度直接影响显微镜对样品的检测质量。介绍了一种基于AT89C52单片机的显微镜工作台闭环控制系统的设计方案。工作台移动时作为检测元件的光栅输出脉冲信号。单片机控制电路实现脉冲的计数并计算误差值,控制步进电机进行反馈补偿。步进电机通过细分驱动模块可以以四种不同的步距驱动工作台移动,以实现显微镜对工作台移动速度的不同需要。8位数码管实时显示工作台移动的实际位置。实验结果表明,该系统的重复定位精度可达到0.020mm,可满足显微镜对控制工作台的要求。     

A remark on Serrin’s Theorem

An approximation theorem for families of weakly coercive convex functions by means of countably many smooth families of convex functions is proved. As a consequence, the classical “three-fold” lower semicontinuity theorem for integral functionals of the Calculus of Variations by James Serrin is unified in one single statement.     

The dual Brunn-Minkowski theory for bounded Borel sets: Dual affine quermassintegrals and inequalities

This paper develops a significant extension of E. Lutwak's dual Brunn-Minkowski theory, originally applicable only to star-shaped sets, to the class of bounded Borel sets. The focus is on expressions and inequalities involving chord-power integrals, random simplex integrals, and dual affine quermassintegrals. New inequalities obtained include those of isoperimetric and Brunn-Minkowski type. A new generalization of the well-known Busemann intersection inequality is also proved. Particular attention is given to precise equality conditions, which require results stating that a bounded Borel set, almost all of whose sections of a fixed dimension are essentially convex, is itself essentially convex.