Related papers: Growth Results and Euclidean Ideals
A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…
For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with…
Let $X$ be a set of positive integers, and let $\mathbb Z_K$ be the ring of integers of a number field $K$ of degree $n$. Denote by $N(I)$ the absolute norm of an ideal $I$ of $\mathbb Z_K$, and by $\mathcal A$ the set of principal ideals…
In this article we investigate the distribution of prime ideals of residue degree bigger than one across the ideal classes in the class group of a number field $L$. A criterion for the class group of $L$ being generated by the classes of…
We derive a family of prime ideals of the Burnside Tambara functor for a finite group $G$. In the case of cyclic groups, this family comprises the entire prime spectrum. We include some partial results towards the same result for a larger…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
Conditionally on the Generalized Riemann Hypothesis (GRH), we prove the following results: (1) a cyclic number field of degree $5$ is norm-Euclidean if and only if $\Delta=11^4,31^4,41^4$; (2) a cyclic number field of degree $7$ is…
We extend the classical notion of standardly stratified $k$-algebra (stated for finite dimensional $k$-algebras) to the more general class of rings, possibly without $1,$ with enough idempotents. We show that many of the fundamental…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
Ideal class pairings map the rational points of rank $r\geq 1$ elliptic curves $E/\Q$ to the ideal class groups $\CL(-D)$ of certain imaginary quadratic fields. These pairings imply that $$h(-D) \geq \frac{1}{2}(c(E)-\varepsilon)(\log…
Ideles and adeles can be viewed as a generalization of Minkowski theory, in which embedding of a number field to the Cartesian product of its completions at the archimedean valuation is generalized to an embedding of the Cartesian product…
In this study, new master theorems and general formulas of integrals are presented and implemented to solve some complicated applications in different fields of science. The proposed theorems are considered to be generators of new problems,…
We estimate the number of principal ideals $ I $ of norm $ \mathrm{N}(I) \leq x $ in the family of the simplest cubic fields. The advantage of our result is that it provides the correct order of magnitude for arbitrary $ x \geq 1 $, even…
Let $p$ be a prime number, $\Bbbk$ a field of characteristic $p$ and $G$ a finite $p$-group. Let $V$ be a finite-dimensional linear representation of $G$ over $\Bbbk$. Write $S = \mathrm{Sym} V^*$. For a class of $p$-groups which we call…
Matrix Factorization plays an important role in machine learning such as Non-negative Matrix Factorization, Principal Component Analysis, Dictionary Learning, etc. However, most of the studies aim to minimize the loss by measuring the…
The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…
Let $R$ be a commutative Noetherian ring and $D$ be a discrete Hodge algebra over $R$ of dimension $d>\text{dim}(R)$. Then we show that (i) the top Euler class group $E^d(D)$ of $D$ is trivial. (ii) if $d>\text{dim}(R)+1$, then $(d-1)$-st…
Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…
Primal and dual algorithms are developed for solving the $n$-dimensional convex optimization problem of finding the Euclidean ball of minimum radius that covers $m$ given Euclidean balls, each with a given center and radius. Each algorithm…
In this paper we study ideals generated by quite general sets of 2-minors of an $m \times n$-matrix of indeterminates. The sets of 2-minors are defined by collections of cells and include 2-sided ladders. For convex collections of cells it…