Searcharxiv⌕ Search

arXiv subjects

Gabriele Nebe

Publications and source records attributed to Gabriele Nebe.

At least 55 records · Page 3Linked to original sources
arXiv2012

On automorphisms of extremal even unimodular lattices of dimension 48

The automorphism groups of the three known extremal even unimodular lattices of dimension 48 and the one of dimension 72 are computed using the classification of finite simple groups. Restrictions on the possible automorphisms of 48-dimensional extremal lattices are obtained. We classify all extremal lattices of dimension 48 having an automorphism of order $m$ with $φ(m) > 24$. In particular the lattice $P_{48n}$ is the unique extremal 48-dimensional lattice that arises as an ideal lattice over a cyclotomic number field.

math.NT↗
arXiv2012

Golden lattices

Let $\vartheta := \frac{-1+\sqrt{5}}{2}$ be the golden ratio. A golden lattice is an even unimodular $\Z[\vartheta ]$-lattice of which the Hilbert theta series is an extremal Hilbert modular form. We construct golden lattices from extremal even unimodular lattices and obtain families of dense modular lattices.

math.NT↗
arXiv2012

On tight spherical designs

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

math.CO↗
arXiv2012

The unreasonable effectiveness of the tensor product

Using the Hermitian tensor product description of the extremal even unimodular lattice of dimension 72 found by Nebe in 2010 we show its extremality with the methods from Coulangeons article in Acta Arith. 2000.

math.NT↗
arXiv2011

On extremal self-dual ternary codes of length 48

All extremal ternary codes of length 48 that have some automorphism of prime order $p\geq 5$ are equivalent to one of the two known codes, the Pless code or the extended quadratic residue code.

cs.IT↗
arXiv2011

On the Equivalence of Quadratic APN Functions

Establishing the CCZ-equivalence of a pair of APN functions is generally quite difficult. In some cases, when seeking to show that a putative new infinite family of APN functions is CCZ inequivalent to an already known family, we rely on computer calculation for small values of n. In this paper we present a method to prove the inequivalence of quadratic APN functions with the Gold functions. Our main result is that a quadratic function is CCZ-equivalent to an APN Gold function if and only if it is EA-equivalent to that Gold function. As an application of this result, we prove that a trinomial family of APN functions that exist on finite fields of order 2^n where n = 2 mod 4 are CCZ inequivalent to the Gold functions. The proof relies on some knowledge of the automorphism group of a code associated with such a function.

math.CO↗
arXiv2010

An even unimodular 72-dimensional lattice of minimum 8

An even unimodular 72-dimensional lattice $Γ$ having minimum 8 is constructed as a tensor product of the Barnes lattice and the Leech lattice over the ring of integers in the imaginary quadratic number field with discriminant $-7$. The automorphism group of $Γ$ contains the absolutely irreducible rational matrix group $(\PSL_2(7) \times \SL _2(25)) : 2$.

math.NT↗
arXiv2009

On theta series attached to maximal lattices and their adjoints

The space spanned by theta series of adjoints of maximal even lattices of exact level $N$ and determinant $N^2$ has the Weierstrass property and hence allows to define extremality for arbitrary squarefree level $N$. We find examples of such dual extremal lattices.

math.NT↗
arXiv2009

Lower bounds for measurable chromatic numbers

The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of distance graphs on compact metric spaces. In particular we consider distance graphs on the unit sphere. There we transform the original infinite semidefinite program into an infinite linear program which then turns out to be an extremal question about Jacobi polynomials which we solve explicitly in the limit. As an application we derive new lower bounds for the measurable chromatic number of the Euclidean space in dimensions 10,..., 24, and we give a new proof that it grows exponentially with the dimension.

math.CO↗
arXiv2009

Automorphisms of doubly-even self-dual binary codes

The automorphism group of a binary doubly-even self-dual code is always contained in the alternating group. On the other hand, given a permutation group $G$ of degree $n$ there exists a doubly-even self-dual $G$-invariant code if and only if $n$ is a multiple of 8, every simple self-dual $\F_2G$-module occurs with even multiplicity in $\F_2^n$, and $G$ is contained in the alternating group.

math.NT↗
arXiv2008

Hermitian modular forms congruent to 1 modulo p

For any natural number $\ell $ and any prime $p\equiv 1 \pmod{4}$ not dividing $\ell $ there is a Hermitian modular form of arbitrary genus $n$ over $L:=\Q [\sqrt{-\ell}]$ that is congruent to 1 modulo $p$ which is a Hermitian theta series of an $O_L$-lattice of rank $p-1$ admitting a fixed point free automorphism of order $p$. It is shown that also for non-free lattices such theta series are modular forms.

math.NT↗
arXiv2006

Kneser-Hecke-operators in coding theory

The Kneser-Hecke-operator is a linear operator defined on the complex vector space spanned by the equivalence classes of a family of self-dual codes of fixed length. It maps a linear self-dual code $C$ over a finite field to the formal sum of the equivalence classes of those self-dual codes that intersect $C$ in a codimension 1 subspace. The eigenspaces of this self-adjoint linear operator may be described in terms of a coding-theory analogue of the Siegel $Φ$-operator.

math.NT↗