
doi: 10.46298/dmtcs.250
This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects according to non algebraic parameters.
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], uniform random generation, \(q\)-equations, object grammars, QA1-939, Grammars and rewriting systems, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Uniform random generation, q-equations, Mathematics
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], uniform random generation, \(q\)-equations, object grammars, QA1-939, Grammars and rewriting systems, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Uniform random generation, q-equations, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
