Dold-Kan correspondence for dendroidal abelian groups

We prove a Dold-Kan type correspondence between the category of planar dendroidal abelian groups and a suitably constructed category of planar dendroidal chain complexes. Our result naturally extends the classical Dold-Kan correspondence between the category of simplicial abelian groups and the category of non-negatively graded chain complexes.     

On pure subgroups of locally compact abelian groups

In this note, we construct an example of a locally compact abelian group G = C × D (where C is a compact group and D is a discrete group) and a closed pure subgroup of G having nonpure annihilator in the Pontrjagin dual $\hat{G}$, answering a question raised by Hartman and Hulanicki. A simple proof of the following result is given: Suppose ${\frak K}$ is a class of locally compact abelian groups such that $G \in {\frak K}$ implies that $\hat{G} \in {\frak K}$ and nG is closed in G for each positive integer n. If H is a closed subgroup of a group $G \in {\frak K}$, then H is topologically pure in G exactly if the annihilator of H is topologically pure in $\hat{G}$. This result extends a theorem of Hartman and Hulanicki.Received: 4 April 2002     

Optimally small sumsets in finite abelian groups

Let G be a finite abelian group of order g. We determine, for all 1?r,s?g, the minimal size μ_G(r,s)=min|A+B| of sumsets A+B, where A and B range over all subsets of G of cardinality r and s, respectively. We do so by explicit construction. Our formula for μ_G(r,s) shows that this function only depends on the cardinality of G, not on its specific group structure. Earlier results on μ_G are recalled in the Introduction.     

Locally compact abelian groups admitting non-trivial quasi-convex null sequences

In this paper, we show that, for every locally compact abelian group G, the following statements are equivalent:

(i)

G contains no sequence such that {0}∪{±x_n∣n∈N} is infinite and quasi-convex in G, and x_n?0;

(ii)

one of the subgroups {g∈G∣2g=0} or {g∈G∣3g=0} is open in G;

(iii)

G contains an open compact subgroup of the form or for some cardinal κ.

     

Are linear algorithms always good for linear problems?

We exhibit linear problems for which every linear algorithm has infinite error, and show a (mildly) nonlinear algorithm with finite error. The error of this nonlinear algorithm can be arbitrarily small if appropriate information is used. We illustrate these examples by the inversion of a finite Laplace transform, a problem arising in remote sensing.     

Multiplicative cones — a family of three eigenvalue graphs

The possibilities for a graph onn vertices with spectrum >>– and some vertex of valencen–1 are presented. Some of these are constructed.     

Sharply 2- and 3-transitive groups with kernels of finite index

Aequationes mathematicae -     

Covering abelian groups with cyclic subsets

Summary Letk andm be positive integers. An abelian groupG is said to have ann-cover if there is a subsetS ofG consisting ofn elements such that every non-zero element ofG can be expressed in the formig for some elementg inS and integeri, 1 i k. Lets _n (k) be the largest order of abelian groups that have ann-cover. We investigate the behavior ofs _n (k)/k ask andn is fixed.     

Permutation groups of prime degree, a quick proof of Burnside’s theorem

A transitive permutation group of prime degree is doubly transitive or solvable. We give a direct proof of this theorem by Burnside which uses neither S-ring type arguments nor representation theory.Received: 9 December 2004     

All 113 and 123-configurations are rational

Summary A conjecture of Grünbaum states that everyn ³ -configuration in the real plane can also be realized in the rational plane. We prove this conjecture forn 12 by computing rational coordinates for all 31 types of 11³ -configurations and all 228 types of 12³- configurations in the classification of Daublebsky.Researc hsupported by the Institute for Mathematics and its Applications, Minneapolis, with funds provided by the National Science Foundation.