English
Related papers

Related papers: Viskovatov algorithm for Hermite-Pad\'e polynomial…

200 papers

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…

Combinatorics · Mathematics 2011-09-16 Dan Drake

The q-Hermite I-Sobolev type polynomials of higher order are consider for their study. Their hypergeometric representation is provided together with further useful properties such as several structure relations which give rise to a…

Classical Analysis and ODEs · Mathematics 2021-06-28 Carlos Hermoso , Edmundo J. Huertas , Alberto Lastra , Anier Soria-Lorente

In this article we apply a formula for the $n$-th power of a $3\times 3$ matrix (found previously by the authors) to investigate a procedure of Khovanskii's for finding the cube root of a positive integer. We show, for each positive integer…

Number Theory · Mathematics 2019-01-04 James Mc Laughlin , B. Sury

In this paper, we are concerned with a worst-case complexity analysis of a-posteriori algorithms for unconstrained multiobjective optimization. Specifically, we propose an algorithmic framework that generates sets of points by means of…

Optimization and Control · Mathematics 2025-06-16 Andrea Cristofari , Marianna De Santis , Stefano Lucidi , Giampaolo Liuzzi

We prove ratio asymptotic for sequences of multiple orthogonal polynomials with respect to a Nikishin system of measures ${\mathcal{N}}(\sigma_1,...,\sigma_m)$ such that for each $k$, the support of $\sigma_k$ consists of an interval…

Complex Variables · Mathematics 2019-10-22 Abey López García , Guillermo López Lagomasino

We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width $w$, we give an $n^{\mathcal{O}(w)}$-time…

Data Structures and Algorithms · Computer Science 2018-01-12 Lars Jaffke , O-joung Kwon , Jan Arne Telle

We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…

Combinatorics · Mathematics 2025-07-02 Xavier Coulter , Norman Do , Ellena Moskovsky

In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix…

Symbolic Computation · Computer Science 2019-04-09 Claude-Pierre Jeannerod , Vincent Neiger , Gilles Villard

We develop two "Nesterov's accelerated" variants of the well-known extragradient method to approximate a solution of a co-hypomonotone inclusion constituted by the sum of two operators, where one is Lipschitz continuous and the other is…

Optimization and Control · Mathematics 2023-10-17 Quoc Tran-Dinh

The aim of this paper is to study the approximation of functions using a higher order Hermite-Fejer interpolation process on the unit circle. The system of nodes is composed of vertically projected zeros of Jacobi polynomials onto the unit…

Numerical Analysis · Mathematics 2022-03-01 Swarnima Bahadur , Varun

We construct special solutions of the quantum Knizhnik-Zamolodchikov equation on the tensor product of the vector representation of the quantum algebra of type A_{N-1}. They are constructed from non-symmetric Macdonald polynomials through…

Quantum Algebra · Mathematics 2007-05-23 M. Kasatani , Y. Takeyama

Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…

Numerical Analysis · Mathematics 2007-05-23 Anton Leykin , Jan Verschelde , Ailing Zhao

Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.

Discrete Mathematics · Computer Science 2007-05-23 Alex Vinokur

We generalize two-point interpolatory Hermite quadrature to functions with available values and the first (n-1) derivatives at both end points. Armed with integration by parts in the reverse form we provide an elementary derivation of an…

Numerical Analysis · Mathematics 2026-02-24 Tan Bui-Thanh , Giancarlo Villatoro , C. G. Krishnanunni

We revisit the problem of finding optimal strategies for deterministic Markov Decision Processes (DMDPs), and a closely related problem of testing feasibility of systems of $m$ linear inequalities on $n$ real variables with at most two…

Data Structures and Algorithms · Computer Science 2021-10-29 Adam Karczmarz

We give two widest Mehler's formulas for the univariate complex Hermite polynomials $H_{m,n}^\nu$, by performing double summations involving the products $u^m H_{m,n}^\nu (z,\overline{z}) \overline{H_{m,n}^\nu (w,\overline{w})}$ and $u^m…

Classical Analysis and ODEs · Mathematics 2018-02-14 Allal Ghanmi

A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…

Algebraic Geometry · Mathematics 2025-10-30 Alessandro Oneto , Nick Vannieuwenhoven

We study the interpolation analogue of the Hermite-Pad\'e type I approximation problem. We provide its determinant solution and we write down the corresponding integrable discrete system as an admissible reduction of Hirota's discrete…

Exactly Solvable and Integrable Systems · Physics 2023-01-06 Adam Doliwa

The aim of this paper is to construct generating functions for new families of special polynomials including the Appel polynomials, the Hermite-Kamp\`e de F\`eriet polynomials, the Milne-Thomson type polynomials, parametric kinds of Apostol…

Classical Analysis and ODEs · Mathematics 2021-04-19 Neslihan Kilar , Yilmaz Simsek

This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space $\mathbb R^3$ (where they are equivalent to the PN surfaces) and in the…

Graphics · Computer Science 2016-09-20 Michal Bizzarri , Miroslav Lávička , Zbyňek Šír , Jan Vršek