A method for partitioning shapes is described based on a global convexity measure. Its advantages are that its global nature makes it robust to noise, and apart from the number of partitioning cuts no parameters are required. In order to ensure that the method operates correctly on bent or undulating shapes a process is developed that identifies the underlying bending and removes it, straighten...

We highlight a question about binary necklaces, i.e., equivalence classes of binary strings under rotation. Is there a way to choose representatives of the n-bit necklaces so that the subposet of the Boolean lattice induced by those representatives has a symmetric chain decomposition? Alternatively, is the quotient of the Boolean lattice Bn, under the action of the cyclic group Zn, a symmetric ...

People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.

Within a semiparametric framework we propose a test of shape invariance of Engel curves, which is a necessary condition for base independence. Using Canadian family expenditure data for 1996 we reject shape invariance for the fuel and clothing share equations. ∗The first author would like to acknowledge SSHRC of Canada for financial support.

We present a theory of environmental bisimilarity for the delimited-control operators shift and reset. We consider two different notions of contextual equivalence: one that does not require the presence of a top-level control delimiter when executing tested terms, and another one, fully compatible with the original CPS semantics of shift and reset, that does. For each of them, we develop sound ...

We study the process theoretic notion of stuttering equivalence in the setting of parity games. We demonstrate that stuttering equivalent vertices have the same winner in the parity game. This means that solving a parity game can be accelerated by minimising the game graph with respect to stuttering equivalence. While, at the outset, it might not be clear that this strategy should pay off, our ...

Families of Borel equivalence relations and quasiorders that are cofinal with respect to the Borel reducibility ordering, ≤B , are constructed. There is an analytic ideal on ù generating a complete analytic equivalence relation and any Borel equivalence relation reduces to one generated by a Borel ideal. Several Borel equivalence relations, among them Lipschitz isomorphism of compact metric spa...

we study different completeness definitions for two categories of lattice-valued cauchy spaces and the relations between these definitions. we also show the equivalence of a so-called completion axiom and the existence of a completion.

In this paper we define an equivalence relation on the set of positive irrational numbers less than 1. The relation is defined by means of continued fractions. Equivalence classes under this relation are determined by the places of some elements equal to 1 (called essential 1’s) in the continued fraction expansion of numbers. Analysis of suprema of all equivalence classes leads to a solution wh...