![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Discrete Mathematics, Volume 225
Volume 225, Number 1-3, October 2000
- Nantel Bergeron, Ian P. Goulden, Frank Sottile:
Preface. 1- - Sergei A. Abramov
:
Eventually rational and m-sparse points of linear ordinary differential operators with polynomial coefficients. 3-13 - Arkady Berenstein
, Anatol N. Kirillov:
Domino tableaux, Schützenberger involution, and the symmetric group action. 15-24 - Mireille Bousquet-Mélou:
Sorted and/or sortable permutations. 25-50 - Mireille Bousquet-Mélou, Marko Petkovsek:
Linear recurrences with constant coefficients: the multivariate case. 51-75 - Peter J. Cameron
:
Some counting problems related to permutation groups. 77-92 - Patrick Dehornoy:
On completeness of word reversing. 93-119 - Philippe Duchon:
On the enumeration and generation of generalized Dyck words. 121-135 - Art M. Duval:
Algebraic shifting increases relative homology. 137-148 - Sergei Evdokimov, Ilia N. Ponomarenko
, Gottfried Tinhofer:
Forestal algebras and algebraic forests (on a new class of weakly compact graphs). 149-172 - Christiane Hespel, Gérard Jacob:
On algebraic identification of causal functionals. 173-191 - Mark S. MacLean:
An inequality involving two eigenvalues of a bipartite distance-regular graph. 193-216 - Vincel Hoang Ngoc Minh, Michel Petitot, Joris van der Hoeven:
Shuffle algebra and polylogarithms. 217-230
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.