Searcharxiv⌕ Search

arXiv subjects

Olivier Mila

Publications and source records attributed to Olivier Mila.

8 recordsLinked to original sources
arXiv2021

Spherical Heron triangles and elliptic curves

We define spherical Heron triangles (spherical triangles with "rational" side-lengths and angles) and parametrize them via rational points of certain families of elliptic curves. We show that the congruent number problem has infinitely many solutions for most areas in the spherical setting and we find a spherical Heron triangle with rational medians. We also explore the question of spherical triangles with a single rational median or a single a rational area bisector (median splitting the triangle in half), and discuss various problems involving isosceles spherical triangles.

math.NT↗
arXiv2021

Hyperbolic Heron Triangles and Elliptic Curves

We define hyperbolic Heron triangles (hyperbolic triangles with "rational" side-lengths and area) and parametrize them in two ways as rational points of certain elliptic curves. We show that there are infinitely many hyperbolic Heron triangles with one angle $α$ and area $A$ for any (admissible) choice of $α$ and $A$; in particular, the congruent number problem has always infinitely many solutions in the hyperbolic setting. We also explore the question of hyperbolic triangles with a rational median and a rational area bisector (median splitting the triangle in half).

math.NT↗
arXiv2019

The trace field of hyperbolic gluings

We determine the adjoint trace field of gluings of general hyperbolic manifolds. This provides a new method to prove the nonarithmeticity of gluings, which can be applied to the classical construction of Gromov and Piatetski-Shapiro (and generalizations) as well as certain gluings of pieces of commensurable arithmetic manifolds. As an application we give many new examples of nonarithmetic gluings and prove that the unique nonarithmetic Coxeter 5-simplex is not commensurable to any gluing of arithmetic pieces.

math.GT↗
arXiv2018

Symmetries of weight enumerators and applications to Reed-Muller codes

Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on the symmetries given by MacWilliams' identities. This paper is intended to be a first step towards a more general investigation of symmetries of weight enumerators. We list the possible groups of symmetries, dealing both with the finite and infinite case, we develop a new algorithm to compute the group of symmetries of a given weight enumerator and apply these methods to the family of Reed-Muller codes, giving, in the binary case, an analogue of Gleason's theorem for all parameters.

cs.IT↗
arXiv2018

Hyperbolic manifolds and pseudo-arithmeticity

We introduce and motivate a notion of pseudo-arithmeticity, which possibly applies to all lattices in $\mathrm{PO}(n,1)$ with $n>3$. We further show that under an additional assumption (satisfied in all known cases), the covolumes of these lattices correspond to rational linear combinations of special values of $L$-functions.

math.GT↗
arXiv2017

Nonarithmetic hyperbolic manifolds and trace rings

We give a sufficient condition on the hyperplanes used in the inbreeding construction of Belolipetsky-Thomson to obtain nonarithmetic manifolds. We construct explicitly infinitely many examples of such manifolds that are pairwise non-commensurable and estimate their volume.

math.GT↗
arXiv2017

On the Stabilizer of Weight Enumerators of Linear Codes

This paper investigates the relation between linear codes and the stabilizer in ${\rm GL}_2(\mathbb{C})$ of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with infinite stabilizer in the non-binary case. We present an efficient algorithm to compute explicitly the stabilizer of weight enumerators and we apply it to the family of Reed-Muller codes to show that some of their weight enumerators have trivial stabilizer.

cs.IT↗