Related papers: Solving binomial Thue equations
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
We investigate a method to solve a class of Schr{\"o}dinger equation eigenvalue problems numerically to very high precision $P$ (from thousands to a million of decimals). The memory requirement, and the number of high precision algebraic…
In this note we provide a new and efficient approach to uniform estimates for solutions to complex Monge-Ampere equations, as well as for solutions to geometric PDE's that satisfy a determinantal majorization.
Twisting a binary form $F_0(X,Y)\in{\mathbb{Z}}[X,Y]$ of degree $d\ge 3$ by powers $\upsilon^a$ ($a\in{\mathbb{Z}}$) of an algebraic unit $\upsilon$ gives rise to a binary form $F_a(X,Y)\in{\mathbb{Z}}[X,Y]$. More precisely, when $K$ is a…
This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
We consider and completely solve the parametrized family of Thue equations \begin{eqnarray*}X(X-Y)(X+Y)(X-\lambda Y)+Y^4=\xi,\end{eqnarray*} where the solutions $x,y$ come from the ring $\mathbb{C}[T]$, the parameter…
A random tiling of rectangles and triangles displaying a decagonal phase is solved by Bethe Ansatz. Analogously to the solutions of the dodecagonal square triangle and the octagonal rectangle triangle tiling an exact expression for the…
In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…
We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…
Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the…
Let $F_n$ denote the $n$-th Fibonacci number and $L_n$ the $n$-th Lucas number. We completely solve the family of cubic Thue equations $${(X-F_nY)(X-L_nY)X-Y^3=\pm1}$$ and show that there are no non-trivial solutions for $n\neq 1,3$.
Despite the relevance of the binomial distribution for probability theory and applied statistical inference, its higher-order moments are poorly understood. The existing formulas are either not general enough, or not structured and…
Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.
The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…
For given positive integers $m$ and $n$ with $m<n$, the Prouhet-Tarry-Escott problem asks if there exist two disjoint multisets of integers of size $n$ having identical $k$th moments for $1\leq k\leq m$; in the ideal case one requires…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
For a prime $p$ and an integer $a \in \Z$ we obtain nontrivial upper bounds on the number of solutions to the congruence $x^x \equiv a \pmod p$, $1 \le x \le p-1$. We use these estimates to estimate the number of solutions to the congruence…