Related papers: Algorithm for computing the factor ring of an idea…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In…
We obtain several results on the computation of different and discriminant ideals of finite extensions of local fields. As an application, we deduce routines to compute the $\p$-adic valuation of the discriminant $\dsc(f)$, and the…
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 study universal quadratic forms over totally real number fields using Dedekind zeta functions. In particular, we prove an explicit upper bound for the rank of universal quadratic forms over a given number field $K$, under the assumption…
We study almost Dedekind domains with respect to the failure of ideals to have radical factorization, that is, we study how to measure how far an almost Dedekind domain is from being an SP-domain. To do so, we consider the maximal space…
The methods of nonstandard analysis are applied to algebra and number theory. We study nonstandard Dedekind rings, for example an ultraproduct of the ring of integers of a number field. Such rings possess a rich structure and have…
Gr\"obner bases are a fundamental tool when studying ideals in multivariate polynomial rings. More recently there has been a growing interest in transferring techniques from the field case to other coefficient rings, most notably Euclidean…
We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
Designing a deterministic polynomial time algorithm for factoring univariate polynomials over finite fields remains a notorious open problem. In this paper, we present an unconditional deterministic algorithm that takes as input an…
Let $R$ be an infinite Dedekind domain with at most finitely many units, and let $K$ denote its field of fractions. We prove the following statement. If $L/K$ is a finite Galois extension of fields and $\mathcal{O}$ is the integral closure…
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 consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…
Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…
$\DeclareMathOperator{\Int}{Int}\DeclareMathOperator{\IntR}{Int{}^\text{R}}$For a domain $D$, the ring $\Int(D)$ of integer-valued polynomials over $D$ is atomic if $D$ satisfies the ascending chain condition on principal ideals. However,…
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…
We address the noncommutative version of the Edmonds' problem, which asks to determine the inner rank of a matrix in noncommuting variables. We provide an algorithm for the calculation of this inner rank by relating the problem with the…