Related papers: Solving binomial Thue equations

In this paper, we prove that a Thue equation F(x,y) = h, where h is an integer and F is a polynomial of degree n with integer coefficients and without repeated roots, has at most 2n^3 - 2n - 3 solutions provided that the Mordell-Weil rank…

Let $\alpha$ be an algebraic number of degree $d\ge 3$ having at most one real conjugate and let $K$ be the algebraic number field ${\mathbf Q}(\alpha)$. For any unit $\epsilon$ of $K$ such that ${\mathbf Q}(\alpha\epsilon)=K$, we consider…

We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…

We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

Let A be an arbitrary integral domain of characteristic 0 which is finitely generated over Z. We consider Thue equations $F(x,y)=b$ with unknowns x,y from A and hyper- and superelliptic equations $f(x)=by^m$ with unknowns from A, where the…

Let $\omega_0,\dots,\omega_M$ be complex numbers. If $H_0,\dots,H_M$ are polynomials of degree at most $\rho_0,\dots,\rho_M$, and $G(z)=\sum_{m=0} ^M H_m(z) (1-z)^{\omega_m}$ has a zero at $z=0$ of maximal order (for the given…

In our recent paper we gave an efficient algorithm to calculate "small" solutions of relative Thue equations (where "small" means an upper bound of type $10^{500}$ for the sizes of solutions). Here we apply this algorithm to calculating…

Let $h$ and $l$ be integers such that $0\le h\le 2$, $0\le l\le 4$. We obtain asymptotic formulas for the numbers of solutions of the equations $n-3m=h$, $n-5m=l$ in positive integers $m$ and $n$ of a special kind, $m\le X$.

We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…

We consider the parametric family of sextic Thue equations \[ x^6-2mx^5y-5(m+3)x^4y^2-20x^3y^3+5mx^2y^4+2(m+3)xy^5+y^6=\lambda \] where $m\in\mathbb{Z}$ is an integer and $\lambda$ is a divisor of $27(m^2+3m+9)$. We show that the only…

In this paper we completely solve a simple quartic family of Thue equations over $\mathbb{C}(T)$. Specifically, we apply the ABC-Theorem to find all solutions $(x,y) \in \mathbb{C}[T] \times \mathbb{C}[T]$ to the set of Thue equations…

By making use of a recently developed method to solve linear differential equations of arbitrary order, we find a wide class of polynomial solutions to the Heun equation. We construct the series solution to the Heun equation before…

The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…

Consider the interval of integers $I_{m,n} = \{m, m+1, m+2,\ldots, m+n-1 \}$. For fixed integers $h,k,m$, and $c$, let $\Phi_{h,k,m}^{(c)}(n)$ denote the number of solutions of the equation $(a_1+\cdots + a_h)- (a_{h+1} + \cdots +…

In this article, we use Pad\'{e} approximations constructed for binomial functions, to give a new upper bound for the number of the solutions of the $S$-unit equation. Combining explicit formulae of these Pad\'{e} approximants with a simple…

Let $F$ be an irreducible binary form attached to a number field $K$ of degree $\geq 3$. Let $\epsilon\not\in \{-1, 1\}$ be a totally real unit of $K$. By twisting $F$ with the powers $\epsilon^a$ of $\epsilon$, ($a\in{\mathbf Z}$), we…

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Let $h(x,y)$ be a non-degenerate binary cubic form with integral coefficients, and let $S$ be an arbitrary finite set of prime numbers. By a classical theorem of Mahler, there are only finitely many pairs of relatively prime integers $x,y$…

This paper presents a finite step method for computing the binary solution to an overdetermined system of linear algebraic equations Ax = b, where A is an m x n real matrix of rank n < m, and b is a real m-vector. The method uses the…