In this paper we will give a formal description of succession rules in terms of linear operators satisfying certain conditions. This representation allows us to introduce a system of well-de$ned operations into the set of succession rules and then to tackle problems of combinatorial enumeration simply by using operators instead of generating functions. Finally, we will suggest several open problems whose solution should lead to an algebraic characterization of the set of succession rules
Ferrari, L., Pergola, E., Pinzani, R., Rinaldi, S. (2002). An algebraic characterization of the set of succession rules. THEORETICAL COMPUTER SCIENCE, 281(1-2), 351-367 [10.1016/S0304-3975(02)00020-8].
An algebraic characterization of the set of succession rules
RINALDI, SIMONE
2002-01-01
Abstract
In this paper we will give a formal description of succession rules in terms of linear operators satisfying certain conditions. This representation allows us to introduce a system of well-de$ned operations into the set of succession rules and then to tackle problems of combinatorial enumeration simply by using operators instead of generating functions. Finally, we will suggest several open problems whose solution should lead to an algebraic characterization of the set of succession rules
| File | Dimensione | Formato | |
|---|---|---|---|
|
rule.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
158.01 kB
Formato
Adobe PDF
|
158.01 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/18738
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo