Related papers: Using Symbolic Computation to Explore Generalized …
In this paper, we first describe how to find the generating function for the sum of the areas under generalized Dyck paths (with an arbitrary set of steps) using Motzkin paths as a motivating example. We then focus on Motzkin and Dyck…
The theory of Groebner Bases originated in the work of Buchberger and is now considered to be one of the most important and useful areas of symbolic computation. A great deal of effort has been put into improving Buchberger's algorithm for…
Dyck paths are one of the most important objects in enumerative combinatorics, and there are many papers devoted to counting selected families of Dyck paths. Here we present two approaches for the automatic counting of many such families,…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
The Groebner walk is an algorithm for conversion between Groebner bases for different term orders. It is based on the polyhedral geometry of the Groebner fan and involves tracking a line between cones representing the initial and target…
Using the generalized method of steepest descents for the case of two coalescing saddle points, we derive an asymptotic expression for the bivariate generating function of Dyck paths, weighted according to their length and their area in the…
Generalized Dyck paths (or discrete excursions) are one-dimensional paths that take their steps in a given finite set S, start and end at height 0, and remain at a non-negative height. Bousquet-M\'elou showed that the generating function…
Starting from AJ Bu's recent article that computed explicit expressions for the GENERATING functions of sums of powers of areas under Dyck and Motzkin paths, we deduce from them explicit expressions for the actual sequences. This enables…
We present a symbolic tool that provides robust algebraic methods to handle automatic deduction tasks for a dynamic geometry construction. The main prototype has been developed as two different worksheets for the open source computer…
We use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…
The implementation of discontinuous Galerkin finite element methods (DGFEMs) represents a very challenging computational task, particularly for systems of coupled nonlinear PDEs, including multiphysics problems, whose parameters may consist…
Using Symbolic Dynamic Programming we describe algorithms, fully implemented in Maple, for automatically generating generating functions introduced by Richard Stanley in his study of generalized Stern arrays, generalized even further, to…
In this case study in ``fully automated enumeration'', we illustrate how to take full advantage of symbolic computation by developing (what we call) `symbolic-dynamical-programming' algorithms for computing many terms of `hard to compute…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
In our previous work, we defined a quantum algorithmic technique known as the Generalised Phase Kick-Back, or $GPK$, and analysed its applications in generalising some classical quantum problems, such as the Deutsch-Jozsa problem or the…
We consider a generalised version of Motzkin paths, where horizontal steps have length $\ell$, with $\ell$ being a fixed positive integer. We first give the general functional equation for the area-length generating function of this model.…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
Computing Gr\"obner bases is known to have a very high upper bound on computation time with respect to input length. Due to the connection between polyhedral geometry and Gr\"obner bases through the Gr\"obner fan, one can attempt an…