English
Related papers

Related papers: Computation of Darboux polynomials and rational fi…

200 papers

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

Commutative Algebra · Mathematics 2014-01-25 Markus Lange-Hegermann

We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…

Classical Analysis and ODEs · Mathematics 2014-10-15 A. Ferragut , C. Galindo , F. Monserrat

We show how all the quantal systems related to the exceptional Laguerre and Jacobi polynomials can be constructed in a direct and systematic way, without the need of shape invariance and Darboux-Crum transformation. Furthermore, the…

Mathematical Physics · Physics 2011-09-03 C. -L. Ho

In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…

Symbolic Computation · Computer Science 2016-02-01 Bruno Grenet

This work introduces a new concept, the so-called Darboux family, which is employed to determine, to analyse geometrically, and to classify up to Lie algebra automorphisms, in a relatively easy manner, coboundary Liebialgebras on real…

Mathematical Physics · Physics 2023-04-25 J. de Lucas , D. Wysocki

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…

Number Theory · Mathematics 2025-04-08 Victor Beresnevich , Bethany Dixon

We study sparse polynomials with bounded individual degree and their factors, obtaining the following structural and algorithmic results. 1. A deterministic polynomial-time algorithm to find all sparse divisors of a sparse polynomial of…

Computational Complexity · Computer Science 2026-03-10 Aminadav Chuyoon , Amir Shpilka

Let $P(T,X)$ be an irreducible polynomial in two variables with rational coefficients. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $t$ the specialized polynomial $P(t,X)$ is irreducible and has the same…

Number Theory · Mathematics 2016-10-13 David Krumm

The aim of this paper is twofold. The first part is concerned with the associated and the so-called co-polynomials, i.e. new sequences obtained when finite perturbations of the recurrence coefficients are considered. In the second part we…

Classical Analysis and ODEs · Mathematics 2021-01-05 Abdessadek Saib

In this work, we give some criteria that allow us to decide when two sequences of matrix-valued orthogonal polynomials are related via a Darboux transformation and to build explicitly such transformation. In particular, they allow us to see…

Classical Analysis and ODEs · Mathematics 2025-12-09 Ignacio Bono Parisi , Inés Pacharoni , Ignacio Zurrián

We apply the Darboux integrability method to determine first integrals and Hamiltonian formulations of three dimensional polynomial systems; namely the reduced three-wave interaction problem, the Rabinovich system, the Hindmarsh-Rose model,…

Mathematical Physics · Physics 2017-08-02 Oğul Esen , Anindya Ghose Choudhury , Partha Guha

Consider a planar polynomial vector field $X$, and assume it admits a symbolic first integral $\mathcal{F}$, i.e. of the $4$ classes, in growing complexity: Rational, Darbouxian, Liouvillian and Riccati. If $\mathcal{F}$ is not rational, it…

Dynamical Systems · Mathematics 2021-11-23 Thierry Combot

We study discretization of Darboux integrable systems. The discretization is done by using $x$- or $y$-integrals of the considered systems. New examples of semi-discrete Darboux integrable systems are obtained.

Exactly Solvable and Integrable Systems · Physics 2020-07-20 Kostyantyn Zheltukhin , Natalya Zheltukhina

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

Number Theory · Mathematics 2017-07-12 Randell Heyman

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…

Combinatorics · Mathematics 2018-01-11 Viresh Patel , Guus Regts

We study an equivalence class of iterated rational Darboux transformations applied on the harmonic oscillator, showing that many choices of state adding and state deleting transformations lead to the same transformed potential. As a…

Classical Analysis and ODEs · Mathematics 2017-04-04 David Gomez-Ullate , Yves Grandati , Robert Milson

The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ...,…

Algebraic Geometry · Mathematics 2007-05-23 T. Oaku , N. Takayama , H. Tsai

We apply the Darboux theory of integrability to polynomial ODE's of dimension 3. Using this theory and computer algebra, we study the existence of first integrals for the 3-dimensional Lotka-Volterra systems with polynomial invariant…

Exactly Solvable and Integrable Systems · Physics 2017-02-08 Laurent Cairó

We study the discretization of Darboux integrable systems. The discretization is done using $x$-, $y$-integrals of the considered continuous systems. New examples of semi-discrete Darboux integrable systems are obtained.

Exactly Solvable and Integrable Systems · Physics 2020-01-22 Kostyantyn Zheltukhin , Natalya Zheltukhina

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman