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
The complexity of divide-and-conquer algorithms is often described by recurrence relations of the fo...
AbstractWe construct fast algorithms for evaluating transforms associated with families of functions...
Abstract. The kernel method has recently become quite popular. Roughy speak-ing, in certain cases on...
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...
Abstract: This paper looks at the approach of using generating functions to solve linear inhomogeneo...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and...
Algorithms which are recursive have running times which can be described by recurrence equations or ...
In the following chapter we address the techniques for the resolution of some celebrated recurrence ...
<p>This paper introduces some algorithms for solving linear relationships, homogeneous and non-homog...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
We present an algorithm for finding a system of recurrence relations for the number of permutations ...
This article surveys the classical orthogonal polynomial systems of the Hahn class, which are soluti...
The complexity of divide-and-conquer algorithms is often described by recurrence relations of the fo...
AbstractWe construct fast algorithms for evaluating transforms associated with families of functions...
Abstract. The kernel method has recently become quite popular. Roughy speak-ing, in certain cases on...
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...
Abstract: This paper looks at the approach of using generating functions to solve linear inhomogeneo...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and...
Algorithms which are recursive have running times which can be described by recurrence equations or ...
In the following chapter we address the techniques for the resolution of some celebrated recurrence ...
<p>This paper introduces some algorithms for solving linear relationships, homogeneous and non-homog...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
We present an algorithm for finding a system of recurrence relations for the number of permutations ...
This article surveys the classical orthogonal polynomial systems of the Hahn class, which are soluti...
The complexity of divide-and-conquer algorithms is often described by recurrence relations of the fo...
AbstractWe construct fast algorithms for evaluating transforms associated with families of functions...
Abstract. The kernel method has recently become quite popular. Roughy speak-ing, in certain cases on...
DOI
Add to ORKG