中文
相关论文

相关论文: Computation of Darboux polynomials and rational fi…

200 篇论文

In this paper, we develop a polynomial time algorithm to compute a Dulmage-Mendelsohn-type decomposition of a matrix partitioned into submatrices of rank at most $1$.

组合数学 · 数学 2018-02-20 Hiroshi Hirai

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

数论 · 数学 2019-05-21 Daniel Panario , Lucas Reis , Qiang Wang

In this paper, we report on an implementation in the free software Mathemagix of lacunary factorization algorithms, distributed as a library called Lacunaryx. These algorithms take as input a polynomial in sparse representation, that is as…

数学软件 · 计算机科学 2016-02-19 Bruno Grenet

In this paper, we study the algebraic, rational and formal Puiseux series solutions of certain type of systems of autonomous ordinary differential equations. More precisely, we deal with systems which associated algebraic set is of…

代数几何 · 数学 2020-01-30 Jose Cano , Sebastian Falkensteiner , J. Rafael Sendra

We extend to the $n$-dimensional ellipsoid contained in $\R^{n+1},$ the Darboux theory of integrability for polynomial vector fields in the $n$-dimensional sphere (Llibre et al., 2018). New results on the maximum number of invariant…

动力系统 · 数学 2024-10-30 J. Llibre , Adrian C. Murza

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…

数论 · 数学 2008-11-03 Jordi Guardia , Jesus Montes , Enric Nart

We show that some hard to detect properties of quadratic ODEs (eg certain preserved integrals and measures) can be deduced more or less algorithmically from their Kahan discretization, using Darboux Polynomials (DPs). Somewhat similar…

经典分析与常微分方程 · 数学 2021-04-14 G. R. W. Quispel , D. I. McLaren , C. Evripidou

Darboux Transformation, well known in second order differential operator theory, is applied here to the difference equation satisfied by the discrete hypergeometric polynomials(Charlier, Meixner-Krawchuk, Hahn).

经典分析与常微分方程 · 数学 2009-10-31 Gaspard Bangerezako

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

This is a survey on the Darboux theory of integrability for polynomial vector fields, first in $\R^n$ and second in the $n$-dimensional sphere $\sss^n$. We also provide new results about the maximum number of parallels and meridians that a…

动力系统 · 数学 2017-02-21 Jaume Llibre , Adrian C. Murza

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

计算复杂性 · 计算机科学 2015-04-02 Akihiro Yabe

Darboux developed an ingenious algebraic mechanism to construct infinite chains of ''integrable'' second-order differential equations as well as their solutions. After a surprisingly long time, Darboux's results were rediscovered and…

经典分析与常微分方程 · 数学 2023-04-03 Primitivo Acosta-Humánez , Moulay Barkatou , Raquel Sánchez-Cauce , Jacques-Arthur Weil

We answer the following long-standing question of Kolchin: given a system of algebraic-differential equations $\Sigma(x_1,\dots,x_n)=0$ in $m$ derivatives over a differential field of characteristic zero, is there a computable bound, that…

交换代数 · 数学 2018-01-23 Omar Leon Sanchez

Let $P \in \mathbb{Z} [X, Y]$ be a given square-free polynomial of total degree $d$ with integer coefficients of bitsize less than $\tau$, and let $V_{\mathbb{R}} (P) := \{ (x,y) \in \mathbb{R}^2, P (x,y) = 0 \}$ be the real planar…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

交换代数 · 数学 2021-08-31 Wei Li , Alexey Ovchinnikov , Gleb Pogudin , Thomas Scanlon

We study algebraic integrability of complex planar polynomial vector fields $X=A (x,y)(\partial/\partial x) + B(x,y) (\partial/\partial y) $ through extensions to Hirzebruch surfaces. Using these extensions, each vector field $X$ determines…

代数几何 · 数学 2024-05-01 Carlos Galindo , Francisco Monserrat , Elvira Pérez-Callejo

The article continues the work on the description of integrable nonlinear chains with three independent variables of the following form $u^j_{n+1,x}=u^j_{n,x}+f(u^{j+1}_{n}, u^{j}_n,u^j_{n+1 },u^{j-1}_{n+1})$ by the presence of a hierarchy…

可精确求解与可积系统 · 物理学 2023-06-27 I T Habibullin , A R Khakimova

Simple derivation is presented of the four families of infinitely many shape invariant Hamiltonians corresponding to the exceptional Laguerre and Jacobi polynomials. Darboux-Crum transformations are applied to connect the well-known shape…

数学物理 · 物理学 2015-05-18 Ryu Sasaki , Satoshi Tsujimoto , Alexei Zhedanov

We study the integrability in the Liouville sense of natural Hamiltonian systems with a homogeneous rational potential $V(\vq)$. Strong necessary conditions for the integrability of such systems were obtained by an analysis of differential…

可精确求解与可积系统 · 物理学 2015-06-05 Michał Studziński , Maria Przybylska

In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) $y^{\prime}=p(y)$ over \emph{unbounded time domains}, where $p$ is a vector of polynomials. Contrarily to the bounded (compact) time…

计算复杂性 · 计算机科学 2017-01-18 Amaury Pouly , Daniel S. Graça