Rationality, irrationality, and Wilf equivalence in generalized factor order (Q2380324)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rationality, irrationality, and Wilf equivalence in generalized factor order |
scientific article |
Statements
Rationality, irrationality, and Wilf equivalence in generalized factor order (English)
0 references
26 March 2010
0 references
Summary: Let \(P\) be a partially ordered set and consider the free monoid \(P^*\) of all words over \(P\). If \(w,w'\in P^*\) then \(w'\) is a factor of \(w\) if there are words \(u, v\) with \(w=uw'v\). Define generalized factor order on \(P^*\) by letting \(u\leq w\) if there is a factor \(w'\) of \(w\) having the same length as \(u\) such that \(u\leq w'\), where the comparison of \(u\) and \(w'\) is done componentwise using the partial order in \(P\). One obtains ordinary factor order by insisting that \(u=w'\) or, equivalently, by taking \(P\) to be an antichain. Given \(u\in P^*\), we prove that the language \({\mathcal F}(u)= \{w:w\geq u\}\) is accepted by a finite state automaton. If \(P\) is finite then it follows that the generating function \(F(u)= \sum_{w\geq u}\) is rational. This is an analogue of a theorem of \textit{A. Björner} and \textit{B. E. Sagan} [Theor. Comput. Sci. 359, No.~1--3, 282--298 (2006; Zbl 1097.68106)] for generalized subword order. We also consider \(P=\mathbb P\), the positive integers with the usual total order, so that \(P^*\) is the set of compositions. In this case one obtains a weight generating function \(F(u;t,x)\) by substituting \(tx^n\) each time \(n\in\mathbb P\) appears in \(F(u)\). We show that this generating function is also rational by using the transfer-matrix method. Words \(u,v\) are said to be Wilf equivalent if \(F(u;t,x)= F(v;t,x)\) and we prove various Wilf equivalences combinatorially. Björner found a recursive formula for the Möbius function of ordinary factor order on \(P^*\). It follows that one always has \(\mu(u,w)= 0,\pm1\). Using the pumping lemma we show that the generating function \(M(u)= \sum_{w\geq u} |\mu(u,w)|w\) can be irrational.
0 references
composition
0 references
factor order
0 references
finite state automaton
0 references
generating function
0 references
partially ordered set
0 references
rationality
0 references
transfer matrix
0 references
Wilf equivalence
0 references