Related papers: A Survey on Fixed Divisors

In this paper, in the first we give definitions of some classes of division rings which strictly contain the class of centrally finite division rings. One of our main purpose is to construct non-trivial examples of rings of new defined…

This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

We estimate the number of zeros of a polynomial in $\mathbb{C}[z]$ within any small circular disc centered on the unit circle, which improves and comprehensively extends a result established by Borwein, Erd{\'e}lyi, and Littmann~\cite{BE1}…

Let $ \mathbb{F}_q[T]$\, be the ring of polynomials over a finite field $ \mathbb{F}_q $. Let $ g: \mathbb{F}_q[T] \rightarrow \mathbb{R} $ be a multiplicative function such that for any irreducible polynomial $ P $ over $ \mathbb{F}_q $…

We investigate equidecomposability in the ring of polygons with sides restricted to given directions and using only translations. Extending classical results of Dehn and Hadwiger, we prove that equidecomposability in these rings is…

We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…

We study questions around the existence of bounds and the dependence on parameters for linear-algebraic problems in polynomial rings over rings of an arithmetic flavor.In particular, we show that the module of syzygies of polynomials…

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…

The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].

We establish new explicit zero-free regions for the Dedekind zeta-function. Two key elements of our proof are a non-negative, even, trigonometric polynomial and explicit upper bounds for the explicit formula of the so-called differenced…

Using the functional interpretation from proof theory, we analyze nonconstructive proofs of several central theorems about polynomial and differential polynomial rings. We extract effective bounds, some of which are new to the literature,…

We investigate the average order of the divisor function at values of totally reducible binary cubic forms and discuss some applications.

The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is…

We give asymptotic estimates for the mean number of divisors of integers without small prime factors, integers with bounded ratios of consecutive divisors, and for practical numbers. In the last case, this confirms a conjecture of…

The paper systematically classifies rings based on the dominant metric dimensions (Ddim) of their associated CZDG, establishing consequential bounds for the Ddim of these compressed zero-divisor graphs. The authors investigate the interplay…

Let $[a,b]\subset\mathbb{R}$ be a non empty and non singleton closed interval and $P=\{a=x_0<\cdots<x_n=b\}$ is a partition of it. Then $f:I\to\mathbb{R}$ is said to be a function of $r$-bounded variation, if the expression…

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…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…