Algebraic combinatorics and computer science

Repository | Book

Algebraic combinatorics and computer science

a tribute to Gian-Carlo Rota

edited byHenry Crapo Domenico Senato

Details | Table of Contents

Ten abandoned gold mines Henry Crapo

pp.3-22

https://doi.org/10.1007/978-88-470-2107-5_1

Foreword E. Vesentini

pp.25-26

https://doi.org/10.1007/978-88-470-2107-5_2

The adventures of measure theory Gian-Carlo Rota

pp.27-39

https://doi.org/10.1007/978-88-470-2107-5_3

What is invariant theory, really? Gian-Carlo Rota

pp.41-56

https://doi.org/10.1007/978-88-470-2107-5_4

Twelve problems in probability no one likes to bring up Gian-Carlo Rota

pp.57-93

https://doi.org/10.1007/978-88-470-2107-5_5

Resolution of Weyl modules

the Rota touch

D. A. Buchsbaum

pp.97-109

https://doi.org/10.1007/978-88-470-2107-5_6

Circulant recursive matrices M. Barnabei L. B. Montefusco

pp.111-127

https://doi.org/10.1007/978-88-470-2107-5_7

Remarks on invariant geometric calculus

Cayley-Grassmann algebras and geometric Clifford algebras

P. Bravi Andrea Brini

pp.129-150

https://doi.org/10.1007/978-88-470-2107-5_8

Grassmann geometric calculus, invariant theory and superalgebras Andrea Brini F Regonati A G B Teolis

pp.151-196

https://doi.org/10.1007/978-88-470-2107-5_9

Rota-metropolis cubic logic and Ulam-Rényi games F. Cicalese Daniele Mundici U. Vaccaro

pp.197-244

https://doi.org/10.1007/978-88-470-2107-5_10

Umbral nature of the poisson random variables Elvira Di Nardo Domenico Senato

pp.245-266

https://doi.org/10.1007/978-88-470-2107-5_11

A formal theory of resultants (i)

an algorithm in invariant theory

Gian-Carlo Rota J A Stein

pp.267-314

https://doi.org/10.1007/978-88-470-2107-5_12

A formal theory of resultants (ii)

a constructive definition of the resultant

Gian-Carlo Rota J A Stein

pp.315-342

https://doi.org/10.1007/978-88-470-2107-5_13

Foreword to the surveys by Aigner and Perrin M. Bamabei F. Bonetti

pp.345-345

https://doi.org/10.1007/978-88-470-2107-5_14

Catalan and other numbers

a recurrent theme

M. Aigner

pp.347-390

https://doi.org/10.1007/978-88-470-2107-5_15

Enumerative combinatorics on words

pp.391-427

https://doi.org/10.1007/978-88-470-2107-5_16

Alphabet splitting A. Lascoux

pp.431-444

https://doi.org/10.1007/978-88-470-2107-5_17

Some operations on the family of equivalence relations T. Britz M. Mainetti L. Pezzoli

pp.445-459

https://doi.org/10.1007/978-88-470-2107-5_18

Solving linear recurrences using functionals A. Di Bucchianico

pp.461-472

https://doi.org/10.1007/978-88-470-2107-5_19

Polynomiality of the q, t-kostka revisited A. M. Garsia M. Zabrocki

pp.473-491

https://doi.org/10.1007/978-88-470-2107-5_20

A combinatorial approach to the theory of pi-algebras and exponential growth A. Giambruno

pp.493-511

https://doi.org/10.1007/978-88-470-2107-5_21

On the permanent of certain circulant matrices B. Codenotti G. Resta

pp.513-532

https://doi.org/10.1007/978-88-470-2107-5_22

Episturmian words and morphisms (results and conjectures) J. Justin

pp.533-539

https://doi.org/10.1007/978-88-470-2107-5_23

A curious characteristic property of standard sturmian words G. Pirillo

pp.541-546

https://doi.org/10.1007/978-88-470-2107-5_24

Publication details

Publisher: Springer

Place: Dordrecht

Year: 2001

Pages: 546

ISBN (hardback): 978-88-470-2159-4

ISBN (digital): 978-88-470-2107-5

Full citation:

Crapo Henry, Senato Domenico (2001) Algebraic combinatorics and computer science: a tribute to Gian-Carlo Rota. Dordrecht, Springer.