Related papers: Growth Results and Euclidean Ideals

Fixing a nontrivial automorphism of a number field K, we associate to ideals in K an invariant (with values in {0,1,-1}) that we call the "spin" and for which the associated L-function does not possess Euler products. We are nevertheless…

We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

Conventional ideal point models rely on Gaussian or quadratic utility functions that violate the triangle inequality, producing non-metric distances that complicate geometric interpretation and undermine clustering and dispersion-based…

In this paper we state and explain techniques useful for the computation of strong Gr\"obner and standard bases over Euclidean domains: First we investigate several strategies for creating the pair set using an idea by Lichtblau. Then we…

When people mention the mathematical achievements of Euclid, his geometrical achievements always spring to mind. But, his Number-Theoretical achievements (See Books 7, 8 and 9 in his magnum opus \emph{Elements} [1]) are rarely spoken. The…

The proof of the theorem, which states that the Euclidean metric on the set of random points in an $n$-dimensional Euclidean space with the distribution of a special class, converges in probability in the limit $n\rightarrow\infty$ to the…

Let $R = Z[C]$ be the integral group ring of a finite cyclic group $C$. Dennis and al. proved that $R$ is a generalized Euclidean ring in the sense of P. M. Cohn, i.e., $SL_n(R)$ is generated by the elementary matrices for all $n$. We prove…

This paper considers generalized linear models using rule-based features, also referred to as rule ensembles, for regression and probabilistic classification. Rules facilitate model interpretation while also capturing nonlinear dependences…

We prove that the prime ideals in every class of a number field contain arbitrary large truncated ideal classes.

We give a parametrization of square roots of the ideal class of the inverse different of rings defined by binary forms in terms of the orbits of a coregular representation. This parametrization, which can be construed as a new integral…

We discuss two main ways in comparing and evaluating the size of sets: the "Cantorian" way, grounded on the so called Hume principle (two sets have equal size if they are equipotent), and the "Euclidean" way, maintaining Euclid's principle…

In this paper we investigate some properties of ideals in group algebras of finite groups over fields. First, we highlight an important link between their dimension, their minimal Hamming distance and the group order. This is a generalized…

We recast Euclid's proof of the infinitude of prime numbers as a Euclidean Criterion for a domain to have infinitely many atoms. We make connections with Furstenberg's "topological" proof of the infinitude of prime numbers and show that our…

In 2001, M. Bhargava stunned the mathematical world by extending Gauss's 200-year-old group law on integral binary quadratic forms, now familiar as the ideal class group of a quadratic ring, to yield group laws on a vast assortment of…

We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…

We formulate a model for the average behaviour of ray class groups of real quadratic fields with respect to a fixed rational modulus, locally at a finite set $S$ of odd primes. To that end, we introduce Arakelov ray class groups of a number…

We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…

A new method is proposed for variable screening, variable selection and prediction in linear regression problems where the number of predictors can be much larger than the number of observations. The method involves minimizing a penalized…

Based on the structure theory of pairs of skew-symmetric matrices, we give a conjecture for the Hilbert series of the exterior algebra modulo the ideal generated by two generic quadratic forms. We show that the conjectured series is an…