Add to ORKGDoctoralClassifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra methods have been used to explore and solve a number of difficult questions related to lattice walks. In this course, we will give an overview of recent results on structural properties and explicit formulas for generating functions of walks in the quarter plane, with an emphasis on the algorithmic methodology
Computability theory came into being as a result of Hilbert's attempts to meet Brouwer's challenges,...
In this paper, I discuss design workbooks, collections of design proposals and related materials, bo...
The paper advocates a more extensive use of additive trees in community ecology. When the distance/d...
In the present paper the difference schemes of high order accuracy for two‐dimensional equations of ...
This article presents a methodology to use a powerful arithmetic (redundant arithmetic) in some part...
Recent lattice results on QCD at finite temperatures and densities are reviewed. Two new and indepen...
DNA base-pairing is the central interaction in DNA assembly. However, this simple four-letter (A–T a...
Why we called the class of two-dimensional Shimura varieties, which are not Hilbert modular, "Picard...
In papers [1,2] there were consider different assumptions for averaging methods along the vertical c...
Herein, two translational issues related to the development of cell therapy discoveries into therape...
AbstractIn this survey paper we start with a discussion how functionals of finite type can be used f...
We address graph visualization from the viewpoint of compiler construction. Most data structures in ...
Slides of the three lectures on coagulation-fragmentation models presented at the West Asian Mathema...
Entanglement in the ground state of a many-body quantum system may arise when the local terms in the...
We design new inference systems for total orderings by applying rewrite techniques to chaining calcu...
Computability theory came into being as a result of Hilbert's attempts to meet Brouwer's challenges,...
In this paper, I discuss design workbooks, collections of design proposals and related materials, bo...
The paper advocates a more extensive use of additive trees in community ecology. When the distance/d...
In the present paper the difference schemes of high order accuracy for two‐dimensional equations of ...
This article presents a methodology to use a powerful arithmetic (redundant arithmetic) in some part...
Recent lattice results on QCD at finite temperatures and densities are reviewed. Two new and indepen...
DNA base-pairing is the central interaction in DNA assembly. However, this simple four-letter (A–T a...
Why we called the class of two-dimensional Shimura varieties, which are not Hilbert modular, "Picard...
In papers [1,2] there were consider different assumptions for averaging methods along the vertical c...
Herein, two translational issues related to the development of cell therapy discoveries into therape...
AbstractIn this survey paper we start with a discussion how functionals of finite type can be used f...
We address graph visualization from the viewpoint of compiler construction. Most data structures in ...
Slides of the three lectures on coagulation-fragmentation models presented at the West Asian Mathema...
Entanglement in the ground state of a many-body quantum system may arise when the local terms in the...
We design new inference systems for total orderings by applying rewrite techniques to chaining calcu...
Computability theory came into being as a result of Hilbert's attempts to meet Brouwer's challenges,...
In this paper, I discuss design workbooks, collections of design proposals and related materials, bo...
The paper advocates a more extensive use of additive trees in community ecology. When the distance/d...