Related papers: Growth Results and Euclidean Ideals

Let F be a local non-archimedean field. We prove a formula relating orbital integrals in GL(n,F) (for the unit Hecke function) and the generating series counting ideals of a certain ring. Using this formula, we give an explicit estimate for…

We investigate the average number of lattice points within a ball for the $n$th cyclotomic number field, where the lattice is chosen at random from the set of unit determinant ideal lattices of the field. We show that this average is nearly…

We describe the prime ideals and, in particular, the maximal ideals in products $R = \prod D_\lambda$ of families $(D_\lambda)_{\lambda \in \Lambda}$ of commutative rings. We show that every maximal ideal is induced by an ultrafilter on the…

We investigate improvements to the algorithm for the computation of ideal class groups described by Jacobson in the imaginary quadratic case. These improvements rely on the large prime strategy and a new method for performing the linear…

Classical rich-get-richer models have found much success in being able to broadly reproduce the statistics and dynamics of diverse real complex systems. These rich-get-richer models are based on classical urn models and unfold step-by-step…

An analogue over imaginary quadratic fields of a result in algebraic number theory known as Ihara's lemma is established. More precisely, we show that for a prime ideal P of the ring of integers of an imaginary quadratic field F, the kernel…

We propose a modification of the predictions of the Cohen--Lenstra heuristic for class groups of number fields in the case where roots of unity are present in the base field. As evidence for this modified formula we provide a large set of…

Let S be a polynomial algebra over a field. If I is the edge ideal of a perfect semiregular tree, then we give precise formulas for values of depth, Stanley depth, projective dimension, regularity and Krull dimension of S/I.

In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…

We define a generalized likelihood function based on uncertainty measures and show that maximizing such a likelihood function for different measures induces different types of classifiers. In the probabilistic framework, we obtain…

Hierarchical latent class (HLC) models are tree-structured Bayesian networks where leaf nodes are observed while internal nodes are latent. There are no theoretically well justified model selection criteria for HLC models in particular and…

We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…

Let $R$ be a polynomial ring in $N$ variables over an arbitrary field $K$ and let $I$ be an ideal of $R$ generated by $n$ polynomials of degree at most 2. We show that there is a bound on the projective dimension of $R/I$ that depends only…

We generalize the theory of logarithmic derivations through a self-contained study of modules here dubbed tangential idealizers. We establish reflexiveness criteria for such modules, provided the ring is a factorial domain. As a main…

D. Hensley showed in 1994 that the number of steps taken by the Euclidean algorithm to find the greatest common divisor of two natural numbers less than or equal to n follows a normal distribution in the limit as n tends to infinity. V.…

Based on the intuitive notion of convexity, we formulate a universal property defining interval objects in a category with finite products. Interval objects are structures corresponding to closed intervals of the real line, but their…

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

Learning-to-optimize leverages machine learning to accelerate optimization algorithms. While empirical results show tremendous improvements compared to classical optimization algorithms, theoretical guarantees are mostly lacking, such that…

Ulrich ideals in numerical semigroup rings of small multiplicity are studied. If the semigroups are three-generated but not symmetric, the semigroup rings are Golod, since the Betti numbers of the residue class fields of the semigroup rings…

We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…