Techniques for reasoning about extensional properties of functional programs are well understood, but methods for analysing the underlying intensional or operational properties have been much neglected. This paper begins with the development of a simple but useful calculus for time analysis of non-strict functional programs with lazy lists. One limitation of this basic calculus is that the ordi...

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

We consider the equivalence relation ∼ on the symmetric group Sn generated by the interchange of two adjacent elements ai and ai+1 of w = a1 · · · an ∈ Sn such that |ai − ai+1| = 1. We count the number of equivalence classes and the sizes of the equivalence classes. The results are generalized to permutations of multisets. In the original problem, the equivalence class containing the identity p...

By a commutative action on smooth quadric Qn in Pn+1, we mean an effective of connected algebraic group with open orbit. We show that for n?3 all actions are additive described by Sharoiko 2009. So there is unique up to equivalence. For n = 2 three Q2 equivalence, 1 two Q1

Kingston (J Comb Theory (A) 20:357–363, 1976) and Anderson (J Comb Theory (A) 23:363, 1977) show that the probability that a given contestant wins a bestof-2k+1 series of asymmetric, zero-sum, binary-outcome games is, for a large class of assignment rules, independent of which contestant is assigned the advantageous role in each component game. We design a laboratory experiment to test this hyp...

The Borel cardinality of the quotient of the power set of the natural numbers by the ideal Z0 of asymptotically zero-density sets is shown to be the same as that of the equivalence relation induced by the classical Banach space c0. We also show that a large collection of ideals introduced by Louveau and Veličkovič, with pairwise incomparable Borel cardinality, are all Borel reducible to c0. Thi...

A coupled cell network describes interacting (coupled) individual systems (cells). As in networks from real applications, coupled cell networks can represent inhomogeneous networks where different types of cells interact with each other in different ways, which can be represented graphically by different symbols, or abstractly by equivalence relations. Various synchronous behaviors, from full s...

The lattice of ordered compactifications of a topological sum of a finite number of totally ordered spaces is investigated. This investigation proceeds by decomposing the lattice into equivalence classes determined by the identification of essential pairs of singularities. This lattice of equivalence classes is isomorphic to a power set lattice. Each of these equivalence classes is further deco...