Abstract. We devise a theoretical model for dichotomic search algorithms for constrained optimization. We show that, within our model, a certain way of choosing the breaking point ...
We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon&...
We generalize AGM belief revision theory to the multi-agent case. To do so, we first generalize the semantics of the singleagent case, based on the notion of interpretation, to th...
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Ad
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...