75 citations · 114 across the 41 of their papers we have counts for
23 papers · 1 filter
Generalizations of Pólya's theorem on random walks obtained via an extension of the symbolic method in enumerative combinatorics. I
M. Klazar, R. Horský
We use our extension of a fragment of the symbolic method in enumerative combinatorics when we allow finite sums defining the coefficients of generating functions to become infinit…
Polynomials as terms and the Boolean Independence Theorem
M. Klazar
We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded…
Are the Catalan Numbers a Linear Recurrence Sequence?
Martin Klazar, Richard Horský
We answer the question in the title in the negative by providing four proofs.
On growth functions of ordered hypergraphs
Jaroslav Hančl, Martin Klazar
For we consider ideals of edge -colored complete -uniform hypergraphs with vertex sets for . An ideal is a set of su…
Effective formulas for linear recurrence sequences of integers
Martin Klazar
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has…
What is an answer? - remarks, results and problems on PIO formulas in combinatorial enumeration, part I
Martin Klazar
For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of step…