English
Related papers

Related papers: Integer-valued Polynomials, Pr\"ufer Domains and t…

200 papers

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…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

Let $D$ be a Dedekind domain with infinitely many maximal ideals, all of finite index, and $K$ its quotient field. Let $\operatorname{Int}(D) = \{f\in K[x] \mid f(D) \subseteq D\}$ be the ring of integer-valued polynomials on $D$. Given any…

Commutative Algebra · Mathematics 2019-03-29 Sophie Frisch , Sarah Nakato , Roswitha Rissner

Let $R=\bigoplus_{\alpha\in\Gamma}R_{\alpha}$ be a graded integral domain and $\star$ be a semistar operation on $R$. For $a\in R$, denote by $C(a)$ the ideal of $R$ generated by homogeneous components of $a$ and…

Commutative Algebra · Mathematics 2017-08-01 Parviz Sahandi

We consider polynomials which take integer values on the integers (IVPs), and satisfy an additional growth condition on the natural numbers. Elkies and Speyer, answering a question by Dimitrov, showed there is a critical exponential growth…

Number Theory · Mathematics 2025-08-26 Avner Kiro , Alon Nishry

An integral domain $D$ is called an irreducible-divisor-finite domain (IDF-domain) if every nonzero element of $D$ has finitely many irreducible divisors up to associates. The study of IDF-domains dates back to the seventies. In this paper,…

Commutative Algebra · Mathematics 2022-10-18 Felix Gotti , Muhammad Zafrullah

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

Number Theory · Mathematics 2015-01-13 Artūras Dubickas , Min Sha

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

Rings and Algebras · Mathematics 2024-03-19 Alina G. Goutor , Sergey V. Tikhonov

Let $F$ be a field, let $D$ be a subring of $F$ and let $Z$ be an irreducible subspace of the space of all valuation rings between $D$ and $F$ that have quotient field $F$. Then $Z$ is a locally ringed space whose ring of global sections is…

Commutative Algebra · Mathematics 2016-01-20 Bruce Olberding

Properties of 2-adic valuation sequences for general quadratic polynomials with integer coefficients are determined directly from the coefficients. These properties include boundedness or unboundedness, periodicity, and valuations at…

Number Theory · Mathematics 2021-09-01 Will Boultinghouse , Jane Long , Olena Kozhushkina , Justin Trulen

In this paper, we study genus $0$ equivariant relative Gromov-Witten invariants of $\mathbb{P}^1$ whose corresponding relative stable maps are totally ramified over one point. For fixed number of marked points, we show that such invariants…

Algebraic Geometry · Mathematics 2017-05-18 Longting Wu

Suppose that $(K,v_0)$ is a valued field, $f(x)\in K[x]$ is a monic and irreducible polynomial and $(L,v)$ is an extension of valued fields, where $L=K[x]/(f(x))$. Let $A$ be a local domain with quotient field $K$ dominated by the valuation…

Commutative Algebra · Mathematics 2023-08-11 Razieh Ahmadian , Steven Dale Cutkosky

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Logic in Computer Science · Computer Science 2026-05-21 Arka Ghosh , Sławomir Lasota

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Classical Analysis and ODEs · Mathematics 2020-08-05 Karl Dilcher , Maciej Ulas

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

Algebraic Geometry · Mathematics 2018-03-23 Enric Nart

We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…

Number Theory · Mathematics 2025-12-09 Ziyang Zhu

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

Computational Complexity · Computer Science 2013-01-18 Arnab Bhattacharyya , Eldar Fischer , Hamed Hatami , Pooya Hatami , Shachar Lovett

Recent proofs of classical theorems in polynomial algebra and functional analysis are discussed, which use tools from the topology of real manifolds. Simpler proofs were discovered in the new century, of the Hilbert Nullstellensatz, and the…

Geometric Topology · Mathematics 2015-02-05 Jon A. Sjogren

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Logic · Mathematics 2014-07-23 Leigh Evron , Joseph R. Mileti , Ethan Ratliff-Crain

This paper investigates prime and co-prime integer matrices and their properties. It characterizes all pairwise co-prime integer matrices that are also prime integer matrices. This provides a simple way to construct families of pairwise…

Signal Processing · Electrical Eng. & Systems 2025-07-25 Xiang-Gen Xia , Guangpu Guo
‹ Prev 1 3 4 5 6 7 10 Next ›