Uniqueness theorems are considered for various types of almost periodic objects: functions, measures, distributions, multisets, holomorphic and meromorphic functions.

This Isabelle/HOL formalization introduces a nested multiset datatype and de nes Dershowitz and Manna's nested multiset order. The order is proved well founded and linear. By removing one constructor, we transform the nested multisets into hereditary multisets. These are isomorphic to the syntactic ordinals the ordinals can be recursively expressed in Cantor normal form. Addition, subtraction, ...

A permutation σ of a multiset is called Stirling permutation if σ(s) ≥ σ(i) as soon as σ(i) = σ(j) and i < s < j. In our paper we study Stirling polynomials that arise in the generating function for descent statistics on Stirling permutations of any multiset. We develop generalizations of the classical Stirling numbers and present their combinatorial interpretations. Particularly, we apply the ...

A partiallyordered multiset or pomset is a generalizationof a string in which the total order has been relaxed to a partial order. Strings are often used as a model for sequential computation; pomsets are a natural model for parallel and distributed computation. By viewing pomsets as a generalization of strings, the question is raised whether concepts from language theory can be generalized to ...

A priority queue, a container data structure equipped with the operations insert and delete-minimum, can re-order its input in various ways, depending both on the input and on the sequence of operations used. If a given input σ can produce a particular output τ then (σ, τ) is said to be an allowable pair. It is shown that allowable pairs on a fixed multiset are in one-to-one correspondence with...