English
Related papers

Related papers: Limits of real bivariate rational functions

200 papers

Let $f,g\in\mathbb{Z}[u_1,u_2]$ be binary quadratic forms. We provide upper bounds for the number of rational points $(u,v)\in\mathbb{P}^1(\mathbb{Q})\times\mathbb{P}^1(\mathbb{Q})$ such that the ternary conic \[ X_{(u,v)}: f(u_1,u_2)x^2 +…

Number Theory · Mathematics 2024-09-19 Cameron Wilson

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

Number Theory · Mathematics 2010-11-22 Shabnam Akhtari

Let $f$ be a polynomial with coefficients in the ring $O_S$ of $S$-integers of a number field $K$, $b$ a non-zero $S$-integer, and $m$ an integer $\ge 2$. We consider the equation $( \star )$: $f(x) = b y^m$ in $x,y \in O_S$. Under the…

Number Theory · Mathematics 2023-10-17 Attila Bérczes , Yann Bugeaud , Kálmán Győry , Jorge Mello , Alina Ostafe , Min Sha

We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate…

Symbolic Computation · Computer Science 2010-01-19 Xiaolin Qin , Yong Feng , Jingwei Chen , Jingzhong Zhang

We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound $f_{{\rm gp},M}$ for a multivariate polynomial $f(x) \in \mathbb{R}[x]$ of degree $ \le 2d$ in $n$ variables $x = (x_1,...,x_n)$…

Optimization and Control · Mathematics 2013-12-16 Mehdi Ghasemi , Jean Bernard Lasserre , Murray Marshall

In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc,…

Complex Variables · Mathematics 2018-06-08 David G. L. Wang , Jerry J. R. Zhang

We prove that the bilinear Hilbert transform along two polynomials $B_{P,Q}(f,g)(x)=\int_{\mathbb{R}}f(x-P(t))g(x-Q(t))\frac{dt}{t}$ is bounded from $L^p \times L^q$ to $L^r$ for a large range of $(p,q,r)$, as long as the polynomials $P$…

Classical Analysis and ODEs · Mathematics 2018-12-27 Dong Dong

Let $X, Y$ be smooth algebraic varieties of the same dimension. Let $f, g : X \to Y$ be finite polynomial mappings. We say that $f, g$ are equivalent if there exists a regular automorphism $\Phi \in Aut(X)$ such that $f = g\circ \Phi$. Of…

Algebraic Geometry · Mathematics 2015-03-10 Zbigniew Jelonek

If the denominator of a rational function of several variables is sum of even powers and the numerator is a monomial, then we give a numerical criterion, using the exponents involved in the expression of the rational function, to decide if…

History and Overview · Mathematics 2014-03-31 Ali Sinan Sertoz

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

In this note, we prove that if $A$ is a finite set of real numbers such that $|AA| = K|A|$, then for every polynomial $f \in \mathbb{R}[x,y]$ we have that $|f(A,A)| = \Omega_{K,\operatorname{deg} f}(|A|^2)$, unless $f$ is of the form…

Combinatorics · Mathematics 2019-05-10 Cosmin Pohoata

We study the bifurcation values of real polynomial maps $f: \bR^{2n} \to \bR^2$ which reflect the lack of asymptotic regularity at infinity. We formulate real counterparts of some structure results which have been previously proved in case…

Complex Variables · Mathematics 2019-01-04 Ying Chen , Mihai Tibar

We study an important special case of the differential elimination problem: given a polynomial parametric dynamical system $\mathbf{x}' = \mathbf{g}(\boldsymbol{\mu}, \mathbf{x})$ and a polynomial observation function $y =…

Symbolic Computation · Computer Science 2025-08-12 Yulia Mukhina , Gleb Pogudin

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…

Commutative Algebra · Mathematics 2007-05-23 Matthias Aschenbrenner

Let $f,g \in k[x]$ be nonconstant polynomials over a number field $k$. We count $S$-integer inputs $a$ for which $f(a)$ has a $k$-rational preimage under $g$, after removing the polynomial graph components $Y=h(X)$ with $f=g\circ h$. The…

Number Theory · Mathematics 2026-05-14 Henry Shin

Let P(x,y) be a rational polynomial and k in Q be a generic value. If the curve (P(x,y)=k) is irreducible and admits an infinite number of points whose coordinates are integers then there exist algebraic automorphisms that send P(x,y) to…

Algebraic Geometry · Mathematics 2014-02-26 Arnaud Bodin

Assume that $(\Omega,\mathcal A,P)$ is a probability space, $f\colon[0,1] \times \Omega\to[0,1]$ is a function such that $f(0,\omega)=0$, $f(1,\omega)=1$ for every $\omega\in\Omega$, $g\colon[0,1]\to\mathbb R$ is a bounded function such…

Classical Analysis and ODEs · Mathematics 2019-09-06 Janusz Morawiec

We present exact calculations of reliability polynomials $R(G,p)$ for lattice strips $G$ of fixed widths $L_y \le 4$ and arbitrarily great length $L_x$ with various boundary conditions. We introduce the notion of a reliability per vertex,…

Statistical Mechanics · Physics 2015-06-24 Shu-Chiuan Chang , Robert Shrock

Let g:X -> Y be a smooth (i.e. C^\infty differentiable) map between two smooth manifolds. In analogy with the case of complex polynomial functions, we say that y_0 in Y is a typical value of g if there exists an open neighbourhood U of y_0…

Differential Geometry · Mathematics 2016-09-07 Ta Lê Loi , Alexandru Zaharia

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

Number Theory · Mathematics 2025-12-04 Anders Mah