Picture of sea vessel plough through rough maritime conditions

Innovations in marine technology, pioneered through Open Access research...

Strathprints makes available scholarly Open Access content by researchers in the Department of Naval Architecture, Ocean & Marine Engineering based within the Faculty of Engineering.

Research here explores the potential of marine renewables, such as offshore wind, current and wave energy devices to promote the delivery of diverse energy sources. Expertise in offshore hydrodynamics in offshore structures also informs innovations within the oil and gas industries. But as a world-leading centre of marine technology, the Department is recognised as the leading authority in all areas related to maritime safety, such as resilience engineering, collision avoidance and risk-based ship design. Techniques to support sustainability vessel life cycle management is a key research focus.

Explore the Open Access research of the Department of Naval Architecture, Ocean & Marine Engineering. Or explore all of Strathclyde's Open Access research...

Rationality, irrationality, and Wilf equivalence in generalized factor order

Kitaev, Sergey and Liese, Jeff and Remmel, Jeffrey and Sagan, Bruce (2009) Rationality, irrationality, and Wilf equivalence in generalized factor order. In: 21st International Conference on Formal Power Series & Algebraic Combinatorics, 2009-07-20 - 2009-07-24.

Full text not available in this repository. Request a copy from the Strathclyde author

Abstract

Let P be a partially ordered set and consider the free monoid P* of all words over P. If w,w'∈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≤w if there is a factor w' of w having the same length as u such that u≤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∈P*, we prove that the language F(u)={w : w≥u} is accepted by a finite state automaton. If P is finite then it follows that the generating function F(u)=Σw≥u w is rational. This is an analogue of a theorem of Björner and Sagan for generalized subword order. We also consider P=ℙ, the positive integers with the usual total order, so that ℙ* is the set of compositions. In this case one obtains a weight generating function F(u;t,x) by substituting txn each time n∈ℙ 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 can 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 µ(u,w)=0,±1. Using the Pumping Lemma we show that the generating function M(u)=Σw≥u |µ(u,w)| w can be irrational.