AbstractBased on the kernel method, we present systematic methods to solve equation systems on generating functions of two variables. Using these methods, we get the generating functions for the number of permutations which avoid 1234 and 12k(k-1)…3 and permutations which avoid 1243 and 12…k
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
AbstractIn this article, we present new algorithms for the nonclassic Adomian polynomials, which are...
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-typ...
AbstractBased on the kernel method, we present systematic methods to solve equation systems on gener...
AbstractIntroduced by Knuth and subsequently developed by Banderier et al., Prodinger, and others, t...
Introduced by Knuth and subsequently developed by Banderier et al., Prodinger, and others, the kerne...
A linear recurrence is a linear operator which maps rn into rn-1, where (rn) is a (recursive) sequen...
AbstractWhile in the univariate case solutions of linear recurrences with constant coefficients have...
AbstractThe n coefficients of a fixed linear recurrence can be expressed through its m≤2n terms or, ...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
Abstract: This paper looks at the approach of using generating functions to solve linear inhomogeneo...
summary:A way of generalizing onedimensional root-finding algorithms to the multidimensional case by...
We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and...
<p>This paper introduces some algorithms for solving linear relationships, homogeneous and non-homog...
Abstract. The kernel method has recently become quite popular. Roughy speak-ing, in certain cases on...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
AbstractIn this article, we present new algorithms for the nonclassic Adomian polynomials, which are...
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-typ...
AbstractBased on the kernel method, we present systematic methods to solve equation systems on gener...
AbstractIntroduced by Knuth and subsequently developed by Banderier et al., Prodinger, and others, t...
Introduced by Knuth and subsequently developed by Banderier et al., Prodinger, and others, the kerne...
A linear recurrence is a linear operator which maps rn into rn-1, where (rn) is a (recursive) sequen...
AbstractWhile in the univariate case solutions of linear recurrences with constant coefficients have...
AbstractThe n coefficients of a fixed linear recurrence can be expressed through its m≤2n terms or, ...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
Abstract: This paper looks at the approach of using generating functions to solve linear inhomogeneo...
summary:A way of generalizing onedimensional root-finding algorithms to the multidimensional case by...
We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and...
<p>This paper introduces some algorithms for solving linear relationships, homogeneous and non-homog...
Abstract. The kernel method has recently become quite popular. Roughy speak-ing, in certain cases on...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
AbstractIn this article, we present new algorithms for the nonclassic Adomian polynomials, which are...
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-typ...
DOI
Add to ORKG