English
Related papers

Related papers: Comments on the height reducing property

200 papers

We investigate modules for which vanishing of Tor-modules implies finiteness of homological dimensions (e.g., projective dimension and G-dimension). In particular, we answer a question of O. Celikbas and Sather-Wagstaff about ascent…

Commutative Algebra · Mathematics 2019-11-19 Sean K. Sather-Wagstaff

The purpose of this note is to revisit the results of arXiv:1407.4324 from a slightly different perspective, outlining how, if the integral closures of a finite set of prime ideals abide the expected convexity patterns, then the existence…

Commutative Algebra · Mathematics 2016-07-06 Matteo Varbaro

Under the assumption that a residually finite dimensional Hopf algebra H has an Artinian ring of fractions it is proved that H is a flat module over any right coideal subalgebra satisfying a polynomial identity and is faithfully flat over…

Rings and Algebras · Mathematics 2020-06-16 Serge Skryabin

We consider D-finite power series $f(z)=\sum a_n z^n$ with coefficients in a number field $K$. We show that there is a dichotomy governing the behaviour of $h(a_n)$ as a function of $n$, where $h$ is the absolute logarithmic Weil height. As…

Number Theory · Mathematics 2022-11-22 Jason P. Bell , Khoa D. Nguyen , Umberto Zannier

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Number Theory · Mathematics 2021-09-27 Karl Dilcher , Maciej Ulas

In this paper, we propose a new algebraic winding number and prove that it computes the number of complex roots of a polynomial in a rectangle, including roots on edges or vertices with appropriate counting. The definition makes sense for…

Algebraic Geometry · Mathematics 2024-07-22 Daniel Perrucci , Marie-Françoise Roy

The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…

Symbolic Computation · Computer Science 2020-01-01 Joachim von zur Gathen , Mark Giesbrecht , Konstantin Ziegler

We show that every polynomial overring of the ring ${\rm Int}(\mathbb Z)$ of polynomials which are integer-valued over $\mathbb Z$ may be considered as the ring of polynomials which are integer-valued over some subset of $\hat{\mathbb{Z}}$,…

Commutative Algebra · Mathematics 2018-10-03 Jean-Luc Chabert , Giulio Peruginelli

In an earlier work, the first author and Petsche solved an energy minimization problem for local fields and used the result to obtain lower bounds on the height of algebraic numbers all whose conjugates lie in various local fields, such as…

Number Theory · Mathematics 2015-07-08 Paul Fili , Igor Pritsker

The goal of this paper is to give a numerical criterion for an open question in $p$-adic Fourier theory. Let $F$ be a finite extension of $\mathbf{Q}_p$. Schneider and Teitelbaum defined and studied the character variety $\mathfrak{X}$,…

Number Theory · Mathematics 2025-04-16 Laurent Berger , Johannes Sprang

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper…

Number Theory · Mathematics 2014-07-29 Oliver Roche-Newton , Igor Shparlinski

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Rings and Algebras · Mathematics 2025-07-01 Pim Spelier

Let $K$ be a number field, $\overline{\mathbb Q}$, or the field of rational functions on a smooth projective curve over a perfect field, and let $V$ be a subspace of $K^N$, $N \geq 2$. Let $Z_K$ be a union of varieties defined over $K$ such…

Number Theory · Mathematics 2010-06-08 Lenny Fukshansky

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

Optimization and Control · Mathematics 2017-01-03 Jesús A. De Loera , Raymond Hemmecke , Matthias Köppe , Robert Weismantel

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

Number Theory · Mathematics 2022-08-17 Nicholas Dent , Caleb M. Shor

Let $p$ be a prime number. We define the notion of $F$-finiteness of homomorphisms of $\mathbb F_p$-algebras, and discuss some basic properties. In particular, we prove a sort of descent theorem on $F$-finiteness of homomorphisms of…

Commutative Algebra · Mathematics 2012-03-20 Mitsuyasu Hashimoto

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

Number Theory · Mathematics 2022-10-04 Artūras Dubickas , Min Sha

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

Computational Complexity · Computer Science 2015-08-11 Hing Yin Tsang , Ning Xie , Shengyu Zhang

We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\mathbb{F}=\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\mathbb{F}^{n}\rightarrow\mathbb{F}$ is poorly…

Combinatorics · Mathematics 2019-03-05 Amichai Lampert