相关论文: Solving binomial Thue equations

A system of U(N)-matrix difference equations is solved by means of a nested version of a generalized Bethe Ansatz. The highest weight property of the solutions is proved and some examples of solutions are calculated explicitly. (Part II of…

Partial Differential Equations (PDEs) are fundamental tools for modeling physical phenomena, yet most PDEs of practical interest cannot be solved analytically and require numerical approximations. The feasibility of such numerical methods,…

Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…

We consider algebraic ordinary differential equations (AODEs) and study their polynomial and rational solutions. A sufficient condition for an AODE to have a degree bound for its polynomial solutions is presented. An AODE satisfying this…

In this paper we present a unified method for solving general polynomial equations of degree less than five.

We study the Diophantine equation of type $U_n(x)=V_m(y)$, where $(U_n)_{n\geq 0}$ and $(V_m)_{m\geq 0}$ are polynomial power sums defined over a number field $K$. By applying the finiteness criterion of Bilu and Tichy, we show under…

We propose a method combining boundary integral equations and neural networks (BINet) to solve partial differential equations (PDEs) in both bounded and unbounded domains. Unlike existing solutions that directly operate over original PDEs,…

The two-matrix model can be solved by introducing bi-orthogonal polynomials. In the case the potentials in the measure are polynomials, finite sequences of bi-orthogonal polynomials (called "windows") satisfy polynomial ODEs as well as…

We present a new approach to determine the rational solutions of the higher order Painleve equations associated to periodic dressing chain systems. We obtain new sets of solutions, giving determinantal representations indexed by specific…

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

We classify all solutions (p,q) to the equation p(u)q(u)=p(u+b)q(u+a) where p and q are complex polynomials in one indeterminate u, and a and b are fixed but arbitrary complex numbers. This equation is a special case of a system of…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

Some interesting (periodic!) solutions of certain systems of $4$ nonlinear Ordinary Differential Equations $dx_{n}\left( t\right) /dt=P_{2}^{\left( n\right) }\left[ x_{m}\left( t\right) \right] /\left[ x_{1}\left( t\right) +x_{2}\left(…

In this paper, we study the growth of transcendental entire solutions of linear difference equations \begin{equation} P_m(z)\Delta^mf(z)+\cdots+P_1(z)\Delta f(z)+P_0(z)f(z)=0,\tag{+} \end{equation} where $P_j(z)$ are polynomials for…

Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense and most commercially available solvers do not verify the…

Consider the probability that a binomial random variable Bi$(n,m/n)$ with integer expectation $m$ is at most its expectation. Chv\'atal conjectured that for any given $n$, this probability is smallest when $m$ is the integer closest to…

This paper is concerned with the problem of counting solutions of stationary nonlinear Partial Differential Equations (PDEs) when the PDE is known to admit more than one solution. We suggest tackling the problem via a sampling-based…

We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…

The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful theory. However, from the practical perspective, this…

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…