中文
相关论文

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

200 篇论文

The Darboux transformations of Krawtchouk polynomials are investigated and all possible exceptional Krawtchouk polynomials obtainable from a single-step Darboux transformation are considered. The properties of these exceptional Krawtchouk…

经典分析与常微分方程 · 数学 2022-02-01 Hiroshi Miki , Satoshi Tsujimoto , Luc Vinet

We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…

计算工程、金融与科学 · 计算机科学 2023-05-09 Mithun Bairagi

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

数据结构与算法 · 计算机科学 2024-02-14 David Gamarnik , Devin Smedira

Designing a deterministic polynomial time algorithm for factoring univariate polynomials over finite fields remains a notorious open problem. In this paper, we present an unconditional deterministic algorithm that takes as input an…

数论 · 数学 2025-09-17 Daniel Altman

An alternative derivation is presented of the infinitely many exceptional Wilson and Askey-Wilson polynomials, which were introduced by the present authors in 2009. Darboux-Crum transformations intertwining the discrete quantum mechanical…

数学物理 · 物理学 2011-03-28 Satoru Odake , Ryu Sasaki

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

数论 · 数学 2007-05-23 Denis Charles , Kristin Lauter

For every constant $d$, we design a subexponential time deterministic algorithm that takes as input a multivariate polynomial $f$ given as a constant depth algebraic circuit over the field of rational numbers, and outputs all irreducible…

计算复杂性 · 计算机科学 2023-09-19 Mrinal Kumar , Varun Ramanathan , Ramprasad Saptharishi

We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm for computing the non-commutative rank together with…

计算复杂性 · 计算机科学 2018-02-06 Gábor Ivanyos , Youming Qiao , K. V. Subrahmanyam

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

数值分析 · 数学 2023-09-18 Bor Plestenjak , Michiel E. Hochstenbach

The classical Darboux system governing rotation coefficients of three-dimensional metrics of diagonal curvature possesses an equivalent formulation as a sixth-order PDE for a scalar potential (related to the corresponding $\tau$-function).…

可精确求解与可积系统 · 物理学 2026-03-06 Lingling Xue , E. V. Ferapontov , M. V. Pavlov

Let $V\in\mathbb{Q}(i)(\a_1,\dots,\a_n)(\q_1,\q_2)$ be a rationally parametrized planar homogeneous potential of homogeneity degree $k\neq -2, 0, 2$. We design an algorithm that computes polynomial \emph{necessary} conditions on the…

符号计算 · 计算机科学 2014-05-22 Alin Bostan , Thierry Combot , Safey El Din Mohab

We study differential-difference equation of the form $t_{x}(n+1)=f(t(n),t(n+1),t_x(n))$ with unknown $t=t(n,x)$ depending on $x$, $n$. The equation is called Darboux integrable, if there exist functions $F$ (called an $x$-integral) and $I$…

可精确求解与可积系统 · 物理学 2009-11-13 Ismagil Habibullin , Natalya Zheltukhina , Aslı Pekcan

Darboux transformation plays a key role in constructing explicit closed-form solutions of completely integrable systems. This paper provides an algebraic construction of generalized Darboux matrices with the same poles for the $2\times2$…

可精确求解与可积系统 · 物理学 2024-11-26 Yu-Yue Li , Deng-Shan Wang

We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…

符号计算 · 计算机科学 2020-04-22 Arkadev Chattopadhyay , Bruno Grenet , Pascal Koiran , Natacha Portier , Yann Strozecki

In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study…

符号计算 · 计算机科学 2014-02-26 Guillaume Chèze

We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…

符号计算 · 计算机科学 2026-05-27 Jérémy Berthomieu , Edern Gillot , Mohab Safey El Din

We give an analog of exceptional polynomials in the matrix valued setting by considering suitable factorizations of a given second order differential operator and performing Darboux transformations. Orthogonality and density of the…

经典分析与常微分方程 · 数学 2023-06-07 Erik Koelink , Lucía Morey , Pablo Román

We represent an algorithm allowing one to construct new classes of partially integrable multidimensional nonlinear partial differential equations (PDEs) starting with the special type of solutions to the (1+1)-dimensional hierarchy of…

可精确求解与可积系统 · 物理学 2015-05-13 A. I. Zenchuk

We present the Darboux transformations for a novel class of two-dimensional discrete integrable systems named as $\mathbb{Z}_\mathcal{N}$ graded discrete integrable systems, which were firstly proposed by Fordy and Xenitidis within the…

可精确求解与可积系统 · 物理学 2020-01-29 Ying Shi

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

数论 · 数学 2023-02-21 Sandro Mattarei , Marco Pizzato