English
Related papers

Related papers: Effective bounds on $S$-integral preperiodic point…

200 papers

For a finite set of natural numbers $D$ consider a complex polynomial of the form $f(z) = \sum_{d \in D} c_d z^d$. Let $\rho_+(f)$ and $\rho_-(f)$ be the fractions of the unit circle that $f$ sends to the right($\operatorname{Re} f(z) > 0$)…

Classical Analysis and ODEs · Mathematics 2024-08-22 Abdulamin Ismailov

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Algebraic Geometry · Mathematics 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

Let $P\in\mathbb{P}_1(\mathbb{Q})$ be a periodic point for a monic polynomial with coefficients in $\mathbb{Z}$. With elementary techniques one sees that the minimal periodicity of $P$ is at most $2$. Recently we proved a generalization of…

Number Theory · Mathematics 2016-01-28 Jung Kyu Canci , Laura Paladino

We construct explicit non-isotrivial families of polynomials over $\mathbb{Q}$ satisfying uniform boundedness for their rational preperiodic points.

Number Theory · Mathematics 2024-08-27 Hector Pasten

Let $F$ be a number field, $O_F$ the integral closure of $\mathbb{Z}$ in $F$ and $P(T) \in O_F[T]$ a monic separable polynomial such that $P(0) \not=0$ and $P(1) \not=0$. We give precise sufficient conditions on a given positive integer $k$…

Number Theory · Mathematics 2017-08-11 François Legrand

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

We show that the number of bifurcation points at infinity of a polynomial function f : C2 -> C is at most the number of branches at infinity of a generic fiber of f and that this upper bound can be diminished by one in certain cases.

Algebraic Geometry · Mathematics 2015-03-24 Zbigniew Jelonek , Mihai Tibar

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

Number Theory · Mathematics 2025-03-04 Nicolae Ciprian Bonciocat , Rishu Garg , Jitender Singh

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

Number Theory · Mathematics 2019-05-07 Pablo Sáez , Xavier Vidaux , Maxim Vsemirnov

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

Algebraic Geometry · Mathematics 2017-05-01 Saugata Basu , Cordian Riener

We prove that if f is a self-map of an algebraic variety over a field K, then under certain conditions on X, f and K the set of possible periods of K-valued periodic points of f is finite.

Number Theory · Mathematics 2007-05-23 Najmuddin Fakhruddin

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

We study the extent of independence needed to approximate the product of bounded random variables in expectation, a natural question that has applications in pseudorandomness and min-wise independent hashing. For random variables whose…

Computational Complexity · Computer Science 2015-08-12 Parikshit Gopalan , Amir Yehudayoff

Let $F$ be a non-zero polynomial with integer coefficients in $N$ variables of degree $M$. We prove the existence of an integral point of small height at which $F$ does not vanish. Our basic bound depends on $N$ and $M$ only. We separately…

Number Theory · Mathematics 2007-06-26 Lenny Fukshansky

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

We consider the notions of (i) critical points, (ii) second-order points, (iii) local minima, and (iv) strict local minima for multivariate polynomials. For each type of point, and as a function of the degree of the polynomial, we study the…

Optimization and Control · Mathematics 2021-06-17 Amir Ali Ahmadi , Jeffrey Zhang

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

Combinatorics · Mathematics 2018-12-05 David Kazhdan , Tamar Ziegler

Let $F \in \R[X_1,\ldots,X_n]$ and the zero set $V=\zero(\mathcal{P},\R^n)$, where $\mathcal{P}:=\{P_1,\ldots,P_s\} \subset \R[X_1,\ldots,X_n]$ is a finite set of polynomials. We investigate existence of critical points of $F$ on an…

Algebraic Geometry · Mathematics 2025-07-31 Saugata Basu , Ali Mohammad-Nezhad

We show that if $K$ is a monogenic, primitive, totally real number field, that contains units of every signature, then there exists a lower bound for the rank of integer universal quadratic forms defined over $K$. In particular, we extend…

Number Theory · Mathematics 2018-08-07 Pavlo Yatsyna

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

Symbolic Computation · Computer Science 2020-09-03 Jean-Charles Faugère , George Labahn , Mohab Safey El Din , Éric Schost , Thi Xuan Vu
‹ Prev 1 4 5 6 7 8 10 Next ›