1 citations · 2 across the 4 of their papers we have counts for
4 papers
Indecomposable Algebraic Integers
Daniël M. H. van Gent
In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal c…
Non-Abelian Flows in Networks
Daniël M. H. van Gent
In this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labeling of the directed edges with real numbers subject to various constr…
Moves on -graphs preserving Morita equivalence
Caleb Eckhardt, Kit Fieldhouse, Daniel Gent +3
We initiate the program of extending to higher-rank graphs (-graphs) the geometric classification of directed graph -algebras, as completed in the 2016 paper of Eilers, Res…
Algorithms for finding the gradings of reduced rings
Daniël M. H. van Gent
This work is a Master thesis supervised by Prof. Dr. H.W. Lenstra. Lenstra and Silverberg showed that each reduced order has a universal grading, which can be viewed as the `larges…