Translative integral formulae for convex bodies

Translative versions of the principal kinematic formula for quermassintegrals of convex bodies are studied. The translation integral is shown to be a sum of Crofton type integrals of mixed volumes. As corollaries new integral formulas for mixed volumes are obtained. For smooth centrally symmetric bodies the functionals occurring in the principal translative formula are expressed by measures on Grassmannians which are related to the generating measures of the bodies.Dedicated to Professor Otto Haupt with best wishes on his 100th birthday     

Convexity theories IV. Klein-Hilbert parts in convex modules

The Klein-Hilbert part relation, which was introduced by Gleason in function algebras and investigated for convex subsets of real vector spaces by Bear and Bauer in [3], [5], [2], is defined for convex modules. It turns out that all results that were proved for convex sets can also be proved for convex modules, which constitute the algebraic theory generated by convex sets and which have a close connection to physics and mathematical economics.     

An uncountable family of almost nilpotent varieties of polynomial growth

A non-nilpotent variety of algebras is almost nilpotent if any proper subvariety is nilpotent. Let the base field be of characteristic zero. It has been shown that for associative or Lie algebras only one such variety exists. Here we present infinite families of such varieties. More precisely we shall prove the existence of1) a countable family of almost nilpotent varieties of at most linear growth and2) an uncountable family of almost nilpotent varieties of at most quadratic growth.     

A Robertson-type uncertainty principle and quantum Fisher information

Let A₁,…,A_N be complex self-adjoint matrices and let ρ be a density matrix. The Robertson uncertainty principle

     

The circumpolygon with maximal area

The convex circumpolygon with maximal area to a given convex polygon can be determined by means of dynamic programming. The effort of this method increases cubically with respect to the number of sides. It is further shown that the optimal circum-polygon can be constructed with ruler and circle. The applied version of dynamic programming can be also used for solving Steiner's problem of the inpoiygon with minimal circumference but it demands a higher effort than Phú's method.     

Hessian measures of semi-convex functions and applications to support measures of convex bodies

This paper originates from the investigation of support measures of convex bodies (sets of positive reach), which form a central subject in convex geometry and also represent an important tool in related fields. We show that these measures are absolutely continuous with respect to Hausdorff measures of appropriate dimensions, and we determine the Radon-Nikodym derivatives explicitly on sets of σ-finite Hausdorff measure. The results which we obtain in the setting of the theory of convex bodies (sets of positive reach) are achieved as applications of various new results on Hessian measures of convex (semi-convex) functions. Among these are a Crofton formula, results on the absolute continuity of Hessian measures, and a duality theorem which relates the Hessian measures of a convex function to those of the conjugate function. In particular, it turns out that curvature and surface area measures of a convex body K are the Hessian measures of special functions, namely the distance function and the support function of K. Received: 15 July 1999     

Optimality conditions for non-finite valued convex composite functions

Burke (1987) has recently developed second-order necessary and sufficient conditions for convex composite optimization in the case where the convex function is finite valued. In this note we present a technique for reducing the infinite valued case to the finite valued one. We then use this technique to extend the results in Burke (1987) to the case in which the convex function may take infinite values. We conclude by comparing these results with those established by Rockafellar (1989) for the piecewise linear-quadratic case.Dedicated to the memory of Robin W. ChaneyResearch supported in part by the National Science Foundation under grants DMS-8602399 and DMS-8803206, and by the Air Force Office of Scientific Research under grant ISSA-860080.Research supported in part by the Natural Sciences and Engineering Research Council of Canada under grant OGP41983.     

Group algebras and enveloping algebras with nonmatrix and semigroup identities

Let Kbe a field of characteristic p> 0. Denote by ω(R) the augmentation ideal of either a group algebra (R) = K[G] or a restricted enveloping algebra R= u(L) over K. We first characterize those Rfor which ω(R) satisfies a polynomial identity not satisfied by the algebra of all 2 × 2 matrices over K. Then, we examine those Rfor which U J(R) satisfies a semigroup identity (that is, a polynomial identity which can be written as the difference of two monomials).     

Ontology concepts and tools for statistical genomics

In computer science, an ontology is any formally structured vocabulary covering a conceptual domain. Gene Ontology (GO) is a structured collection of terms defining biological processes, cellular components, or molecular functions for the purpose of characterizing gene products and functions. The structure of GO is a directed acyclic graph (DAG) with typed edges. We describe a simple formalism for working with ontologies for statistical purposes, and define object-ontology complexes, which encode the usage of the vocabulary to label objects under analysis. Recently developed concepts of information content and semantic similarity are evaluated and used to explore the association between LocusLink loci and GO. We investigate relations between GO DAG structure, association evidence codes and term information content, illustrate computation of semantic similarities of genes within and between clusters discovered in a microarray, and describe a more general ontology and its use in inference on genetic network structure.     

On coverings of plane convex sets by translates of strips

In the euclidean planeE ² letS ₁,S ₂, ... be a sequence of strips of widthsw ₁,w ₂, .... It is shown thatE ² can be covered by translates of the stripsS _i if w ₁ ^3/2 = . Further results concern conditions in order that a compact convex domain inE ² can be covered by translates ofS ₁,S ₂, ....This research was supported by National Science Foundation Research Grant MCS 76-06111.     

Section and projection means of convex bodies

This paper is concerned with various geometric averages of sections or projections of convex bodies. In particular, we consider Minkowski and Blaschke sums of sections as well as Minkowski sums of projections. The main result is a Crofton-type formula for Blaschke sums of sections. This is used to establish connections between the different averages mentioned above. As a consequence, we obtain results which show that, in some circumstances, a convex body is determined by the averages of its sections or projections.The research of the first author was supported in part by NSF grants DMS-9504249 and INT-9123373     

Quaternion orthogonal designs from complex companion designs

The success of applying generalized complex orthogonal designs as space-time block codes recently motivated the definition of quaternion orthogonal designs as potential building blocks for space-time-polarization block codes. This paper offers techniques for constructing quaternion orthogonal designs via combinations of specially chosen complex orthogonal designs. One technique is used to build quaternion orthogonal designs on complex variables for any even number of columns. A second related technique is applied to maximum rate complex orthogonal designs to generate an infinite family of quaternion orthogonal designs on complex variables such that the resulting designs have no zero entries. This second technique is also used to generate an infinite family of quaternion orthogonal designs defined over quaternion variables that display a regular redundancy. The proposed constructions are theoretically important because they provide the first known direct techniques for building infinite families of orthogonal designs over quaternion variables for any number of columns.     

A problem of Kusner on equilateral sets

R. B. Kusner [R. Guy, Amer. Math. Monthly 90, 196-199 (1983)] asked whether a set of vectors in such that the distance between any pair is 1, has cardinality at most d + 1. We show that this is true for p = 4 and any , and false for all 1<p<2 with d sufficiently large, depending on p. More generally we show that the maximum cardinality is at most if p is an even integer, and at least if 1<p<2, where depends on p. Received: 5 May 2003     

Separated totally convex spaces

In this paper we define for every totally convex space a suitable topology, the radial topology. We prove that a morphism in the category TC^sep of separated totally convex spaces is an epimorphism if and only if its image is dense in the radial topology, and that TC^sep is the full subcategory of TC generated by its Hausdorff objects. These results remain valid for finitely totally convex spaces when the radial topology is replaced by the distance-radial topology.Dedicated to Karl Stein     

Rep-tiling Euclidean space

Summary Arep-tiling is a self replicating, lattice tiling ofR ⁿ .Lattice tiling means a tiling by translates of a single compact tile by the points of a lattice, andself-replicating means that there is a non-singular linear mapø: R ⁿ Rⁿ such that, for eachT , the imageø(T) is, in turn, tiled by . This topic has recently come under investigation, not only because of its recreational appeal, but because of its application to the theory of wavelets and to computer addressing. The paper presents an exposition of some recent results on rep-tiling, including a construction of essentially all rep-tilings of Euclidean space. The construction is based on radix representation of points of a lattice. One particular radix representation, called thegeneralized balanced ternary, is singled out as an example because of its relevance to the field of computer vision.     

A majorization algorithm for constrained correlation matrix approximation

We desire to find a correlation matrix of a given rank that is as close as possible to an input matrix R, subject to the constraint that specified elements in must be zero. Our optimality criterion is the weighted Frobenius norm of the approximation error, and we use a constrained majorization algorithm to solve the problem. Although many correlation matrix approximation approaches have been proposed, this specific problem, with the rank specification and the constraints, has not been studied until now. We discuss solution feasibility, convergence, and computational effort. We also present several examples.     

Determinants and the volumes of parallelotopes and zonotopes

The Minkowski sum of edges corresponding to the column vectors of a matrix A with real entries is the same as the image of a unit cube under the linear transformation defined by A with respect to the standard bases. The geometric object obtained in this way is a zonotope, Z(A). If the columns of the matrix are linearly independent, the object is a parallelotope, P(A). In the first section, we derive formulas for the volume of P(A) in various ways as , as the square root of the sum of the squares of the maximal minors of A, and as the product of the lengths of the edges of P(A) times the square root of the determinant of the matrix of cosines of angles between pairs of edges. In the second section, we use the volume formulas to derive real-case versions of several well-known determinantal inequalities—those of Hadamard, Fischer, Koteljanskii, Fan, and Szasz—involving principal minors of a positive-definite Hermitian matrix. In the last section, we consider zonotopes, obtain a new proof of the decomposition of a zonotope into its generating parallelotopes, and obtain a volume formula for Z(A).     

History and Perspectives of Quantum Groups

The advent of Quantum Groups in the course of the working out the quantum analogue of the Inverse Scattering Method from the soliton theory gives an instructive example of interinfluence of different domains of mathematics. Here I give a rather personal account of this development. Leonardo da Vinci Lecture held on November 7, 2005 Received: June 2006     

On the mean number of normals through a point in the interior of a convex body

Recently, Kathy Hann established bounds on the average number of normals through a point in a convex bodyK, in the cases whereK is either a polytope or sufficiently smooth. In addition, an Euler-type theorem was obtained for these particular classes of convex bodies. In the present work we show that all these statements are true for an arbitrary convex bodyK. For this purpose measure geometric tools and a general approximation technique will be essential.