Counting problems for orthogonal sets and sublattices in function fields
Mathematika · 2026-04 · 72 (2)
DOI: 10.1112/mtk.70083 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematika, online erschienen am 20.03.2026. Verfasst von Noy Soffer Aranov und 1 weiteren Autor:innen. Die Arbeit nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Let . Analogous to orthogonality in the Euclidean space , there exists a well‐studied notion of ultrametric orthogonality in . In this paper, we extend the work of [4] on counting problems related to orthogonality in . For example, we resolve an open question posed in [4] by bounding the size of the largest “orthogonal sets” in . Furthermore, using similar ideas and techniques, we investigate analogues of Hadamard matrices over . Finally, we also use ultrametric orthogonality to compute the number of sublattices of with a certain geometric structure, and to determine the number of orthogonal bases of a sublattice in . The resulting formulas depend crucially on successive minima.
Zitieren
APA
Aranov, N. S., & Behajaina, A. (2026). Counting problems for orthogonal sets and sublattices in function fields. Mathematika, 72(2). https://doi.org/10.1112/mtk.70083
Vancouver
Aranov NS, Behajaina A. Counting problems for orthogonal sets and sublattices in function fields. Mathematika. 2026;72(2). doi:10.1112/mtk.70083
BibTeX
@article{Aranov2026,
author = {Aranov, Noy Soffer and Behajaina, Angelot},
title = {Counting problems for orthogonal sets and sublattices in function fields},
journal = {Mathematika},
year = {2026},
volume = {72},
number = {2},
doi = {10.1112/mtk.70083}
}
EUVIMED