Search arXiv⌕ Search

arXiv · 2610.16002

On bass orders in division algebras

Abstract

A result by F.-T. Tu dating from 2011 states that the orders in a local matrix algebra of dimension four that can be written as a finite intersection of maximal orders are those having an Eichler Gorenstein closure. In a more recent paper, we gave a similar characterization for orders with a Bass Gorenstein closure. More precisely, we prove that these orders are the ones that can be written as a ghost intersection, i.e., the set of points defined over the base field of an intersection of maximal orders that is defined over a field extension. Although we proved this result only for the local four-dimensional matrix algebra, the statement makes sense also for a local quaternion division algebra, since the latter turns into a matrix algebra when we extend the base field to an even degree extension. In this work, we prove an analog of our previous result in the latter setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luis Arenas-Carmona. 2026-10-12. On bass orders in division algebras. https://arxiv.org/abs/2610.16002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗