‎‎for any group $g$‎, ‎we define an equivalence relation $thicksim$ as below‎: ‎[forall g‎, ‎h in g gthicksim h longleftrightarrow |g|=|h|]‎ ‎the set of sizes of equivalence classes with respect to this relation is called the same-order type of $g$ and denote by $alpha{(g)}$‎. ‎in this paper‎, ‎we give a partial answer to a conjecture raised by shen‎. ‎in fact‎, ‎we show that if $g$ is a nilpot...

Secure computation of equivalence has fundamental application in many different areas, including healthcare. We study this problem in the context of matching an individual’s identity to link medical records across systems. We develop an efficient solution for equivalence based on existing work that can evaluate the “greater than” relation. We implement the approach and demonstrate its effective...

Weak orders, i.e. reflexive, transitive, and complete binary relations, are among the most fundamental concepts in preference modeling. It is wellknown that weak orders are nothing else but linear orders of equivalence classes, where the corresponding equivalence relation is the symmetric kernel of the weak order. If the underlying set of alternatives X is finite, a weak order can be represente...

A long standing open problem in the theory of hyperfinite equivalence relations asks if the orbit equivalence relation generated by a Borel action of a countable amenable group is hyperfinite. In this paper we show that this question has a positive answer when the acting group is locally nilpotent. This extends previous results obtained by Gao–Jackson for abelian groups and by Jackson–Kechris–L...

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of a factorization for compositions: equivalent compositions have factorizations that differ only by reversing some of the terms. As an application, we can deri...

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of a factorization for compositions: equivalent compositions have factorizations that differ only by reversing some of the terms. As an application, we can deri...

A review of the relationships between matrix models and noncommutative gauge theory is presented. A lattice version of noncommutative Yang-Mills theory is constructed and used to examine some generic properties of noncommutative quantum field theory, such as UV/IR mixing and the appearence of gauge-invariant open Wilson line operators. Morita equivalence in this class of models is derived and u...

This paper is devoted to a class of fuzzy or derings which play a fundamental role in de cision analysis and fuzzy control strongly linear fuzzy weak orderings First we see that any relation of that kind can be decom posed into a crisp linear ordering and a fuzzy equivalence relation As a consequence a general representation theorem follows Fi nally a method for constructing strongly lin ear fu...

The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence depends on an underlying equational theory. The choice of an inappropriate equational theory can lead to overly pessimistic or overly optimistic notions of indistinguishability, and in turn to security criteria that requ...

3 Logical Relation Proofs 15 3.1 Basic Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.1.1 Properties of Step-Indexed Construction . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.1.2 Approximation Yields Valid Semantic Objects . . . . . . . . . . . . . . . . . . . . . . 17 3.1.3 World Extension and Store Satisfaction Properties . . ...