相关论文: Computation of Darboux polynomials and rational fi…
In this paper we present a far-reaching generalization of E. Vessiot's analysis of the Darboux integrable partial differential equations in one dependent and two independent variables. Our approach provides new insights into this classical…
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
The Hamiltonians of finite type discrete quantum mechanics with real shifts are real symmetric matrices of order $N+1$. We discuss the Darboux transformations with higher degree ($>N$) polynomial solutions as seed solutions. They are…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
Multivariate orthogonal polynomials in $D$ real dimensions are considered from the perspective of the Cholesky factorization of a moment matrix. The approach allows for the construction of corresponding multivariate orthogonal polynomials,…
A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…
In this paper, we give an algorithm for finding general rational solutions of a given first-order ODE with parametric coefficients that occur rationally. We present an analysis, complete modulo Hilbert's irreducibility problem, of the…
In this note we revisit one of the first known examples of exceptional orthogonal polynomials that was introduced by Dubov, Eleonskii, and Kulagin in relation to nonharmonic oscillators with equidistant spectra. We dissect the DEK…
Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
In this article we bound the number of remarkable values of a polynomial vector field. The proof is short and based on Jouanolou's theorem about rational first integrals of planar polynomial derivations. Our bound is given in term of the…
We apply the differential Galois theory for difference equations developed by Hardouin and Singer to compute the differential Galois group for a second-order linear $q$-difference equation with rational function coefficients. This Galois…
In this paper we derive new two-component integrable differential difference and partial difference systems by applying a Lax-Darboux scheme to an operator formed from an ${\mathfrak{sl}}_3({\mathbb{C}})$-based automorphic Lie algebra. The…
To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…
We show that for every homogeneous polynomial of degree $d$, if it has determinantal complexity at most $s$, then it can be computed by a homogeneous algebraic branching program (ABP) of size at most $O(d^5s)$. Moreover, we show that for…
Differential-difference equation $\frac{d}{dx}t(n+1,x)=f(x,t(n,x),t(n+1,x),\frac{d}{dx}t(n,x))$ with unknown $t(n,x)$ depending on continuous and discrete variables $x$ and $n$ is studied. We call an equation of such kind Darboux…
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…
We present a series of Darboux integrable discrete equations on the square lattice. Equations of the series are numbered with natural numbers $M$. All the equations have a first integral of the first order in one of directions of the…
We present a general solution-generating result within the bidifferential calculus approach to integrable partial differential and difference equations, based on a binary Darboux-type transformation. This is then applied to the…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…