Four equivalent equivalences of reductions

Four equivalent equivalences of reductions

Two co-initial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a different order. We present four characterisations of such a notion of equivalence, based on permutation, standardisation, labelling and projection, respectively. We prove that the characterisations all yield the same notion of equivalence, for the class of first-orde...

Operators of Equivalent Sorting Power and Related Wilf-equivalences

We study sorting operators A on permutations that are obtained composing Knuth’s stack sorting operator S and the reversal operator R, as many times as desired. For any such operator A, we provide a size-preserving bijection between the set of permutations sorted by S ◦ A and the set of those sorted by S ◦ R ◦ A, proving that these sets are enumerated by the same sequence, but also that many cl...

Four equivalent lot-sizing models

We study the following lot-sizing models that recently appeared in the literature: a lotsizing model with a remanufacturing option, a lot-sizing model with production time windows, and a lot-sizing model with cumulative capacities. We show the equivalence of these models with a classical model: the lot-sizing model with inventory bounds.

Equivalent Sequential and Parallel Reductions in Arbitrary Binary Pictures

Deletion Rules for Equivalent Sequential and Parallel Reductions

Beküldte Németh Gábor 2. p, 2014-07-18 15:40 Palágyi K [1]. Deletion Rules for Equivalent Sequential and Parallel Reductions [2]. In: Ruiz-Shulcloper J [3], Sanniti di Baja G [4], editors. Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Berlin; Heidelberg: Springer; 2013. 1. p. 17-24p. (LNCS).Doktori iskola elfogadás: igen Válogatott publikáció: igen Tanszék:...