1. CMB Online first
 Jensen, Gerd; Pommerenke, Christian

On the structure of the Schild group in Relativity Theory
Alfred Schild has established conditions
that Lorentz transformations map worldvectors $(ct,x,y,z)$ with
integer coordinates onto vectors of the same kind. These transformations
are called integral Lorentz transformations.
The present paper contains supplements to
our earlier work
with a new focus on group theory. To relate the results to the
familiar matrix group nomenclature we associate Lorentz transformations
with matrices in $\mathrm{SL}(2,\mathbb{C})$. We consider the
lattice of subgroups of the group originated in Schild's paper
and obtain generating sets for the full group and its subgroups.
Keywords:Lorentz transformation, integer lattice, Gaussian integers, Schild group, subgroup Categories:22E43, 20H99, 83A05 

2. CMB Online first
 Haase, Christian; Hofmann, Jan

Convexnormal (pairs of) polytopes
In 2012 Gubeladze (Adv. Math. 2012)
introduced the notion of $k$convexnormal polytopes to show
that
integral polytopes all of whose edges are longer than $4d(d+1)$
have
the integer decomposition property.
In the first part of this paper we show that for lattice polytopes
there is no difference between $k$ and $(k+1)$convexnormality
(for
$k\geq 3 $) and improve the bound to $2d(d+1)$. In the second
part we
extend the definition to pairs of polytopes. Given two rational
polytopes $P$ and $Q$, where the normal fan of $P$ is a refinement
of
the normal fan of $Q$.
If every edge $e_P$ of $P$ is at least $d$ times as long as the
corresponding face (edge or vertex) $e_Q$ of $Q$, then $(P+Q)\cap
\mathbb{Z}^d
= (P\cap \mathbb{Z}^d ) + (Q \cap \mathbb{Z}^d)$.
Keywords:integer decomposition property, integrally closed, projectively normal, lattice polytopes Categories:52B20, 14M25, 90C10 

3. CMB 2015 (vol 59 pp. 123)
 Jensen, Gerd; Pommerenke, Christian

Discrete Spacetime and Lorentz Transformations
Alfred Schild has established conditions
that Lorentz transformations map worldvectors $(ct,x,y,z)$ with
integer coordinates onto vectors of the same kind. The problem
was dealt with in the context of tensor and spinor calculus.
Due to Schild's numbertheoretic arguments, the subject is also
interesting when isolated from its physical background.
The paper of Schild is not easy to understand. Therefore we first
present a streamlined version of his proof which is based on
the use of null vectors. Then we present a purely algebraic proof
that is somewhat shorter. Both proofs rely on the properties
of Gaussian integers.
Keywords:Lorentz transformation, integer lattice, Gaussian integers Categories:22E43, 20H99, 83A05 

4. CMB 2011 (vol 56 pp. 161)
 Rêgo, L. C.; Cintra, R. J.

An Extension of the Dirichlet Density for Sets of Gaussian Integers
Several measures for the density of sets of integers have been proposed,
such as the asymptotic density, the Schnirelmann density, and the Dirichlet density. There has been some work in the literature on extending some of these concepts of density to higher dimensional sets of integers. In this work, we propose an extension of the Dirichlet density for sets of Gaussian integers and
investigate some of its properties.
Keywords:Gaussian integers, Dirichlet density Categories:11B05, 11M99, 11N99 

5. CMB 2008 (vol 51 pp. 57)
 Dobrowolski, Edward

A Note on Integer Symmetric Matrices and Mahler's Measure
We find a lower bound on the absolute value of the discriminant of
the minimal polynomial of an integral symmetric matrix and apply
this result to find a lower bound on Mahler's measure of related
polynomials and to disprove a conjecture of D. Estes and R. Guralnick.
Keywords:integer matrices, Lehmer's problem, Mahler's measure Categories:11C20, 11R06 

6. CMB 2007 (vol 50 pp. 399)
 Komornik, Vilmos; Loreti, Paola

Expansions in Complex Bases
Beginning with a seminal paper of R\'enyi, expansions in noninteger real bases have been widely
studied in the last
forty years. They turned out to be relevant in
various domains of mathematics, such as the theory of finite
automata, number
theory, fractals or dynamical systems.
Several results were extended by Dar\'oczy and K\'atai
for expansions
in complex bases. We introduce an adaptation of the socalled greedy
algorithm to the complex case, and we
generalize one of their main theorems.
Keywords:noninteger bases, greedy expansions, betaexpansions Categories:11A67, 11A63, 11B85 
