Related papers: Growth Results and Euclidean Ideals

The Cohen-Lenstra heuristic is a universal principle that assigns to each group a probability that tells how often this group should occur "in nature". The most important, but not the only, applications are sequences of class groups, which…

Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…

Many classical ring-theoretic results state that an ideal that is maximal with respect to satisfying a special property must be prime. We present a "Prime Ideal Principle" that gives a uniform method of proving such facts, generalizing the…

We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…

We present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of…

We give a definition of a class of Dedekind domains which includes the rings of integers of global fields and give a proof that all rings in this class have finite ideal class group. We also prove that this class coincides with the class of…

We propose a modification to the Cohen--Lenstra prediction for the distribution of class groups of number fields, which should also apply when the base field contains non-trivial roots of unity. The underlying heuristic derives from the…

Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…

This paper studies an intriguing phenomenon related to the good generalization performance of estimators obtained by using large learning rates within gradient descent algorithms. First observed in the deep learning literature, we show that…

It is shown that every Leavitt path algebra L of an arbitrary directed graph E over a field K is an arithmetical ring, that is, the two-sided ideals of L form a distributive lattice. It is also shown that L is a multiplication ring, that…

We study the Eisenstein ideal of Drinfeld modular curves of small levels, and the relation of the Eisenstein ideal to the cuspidal divisor group and the component groups of Jacobians of Drinfeld modular curves. We prove that the…

We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…

This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…

Conventional rule learning algorithms aim at finding a set of simple rules, where each rule covers as many examples as possible. In this paper, we argue that the rules found in this way may not be the optimal explanations for each of the…

Suppose that $X$ is an integral scheme (quasi-)projective over a complete local ring of mixed characteristic. Using ideas of Takamatsu-Yoshikawa and Bhatt-Ma-et. al, we define a notion of a $+$-test ideal on $X$, including for divisors and…

Herding is a deterministic algorithm used to generate data points that can be regarded as random samples satisfying input moment conditions. The algorithm is based on the complex behavior of a high-dimensional dynamical system and is…

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

We consider ideals in a polynomial ring generated by collections of power sum polynomials, and obtain conditions under which these define complete intersection rings, normal domains, and unique factorization domains. We also settle a key…

Ideals in Leavitt path algebras have been shown to share many properties with those of integral domains. Since studying factorizations of ideals in integral domains into special types of ideals (particularly, prime, prime-power, primary,…

We prove that there are >>X^{1/30}/(log X) imaginary quadratic number fields with an ideal class group of 3-rank at least 5 and discriminant bounded in absolute value by X. This improves on an earlier result of Craig, who proved the…