Martin’s conjecture and strong ergodicity

In this paper, we explore some of the consequences of Martin’s Conjecture on degree invariant Borel maps. These include the strongest conceivable ergodicity result for the Turing equivalence relation with respect to the filter on the degrees generated by the cones, as well as the statement that the complexity of a weakly universal countable Borel equivalence relation always concentrates on a null set.     

Some Consequences of Schanuel's Conjecture in Exponential Rings

In last years Schanuel's Conjecture has played a fundamental role in Transcendental Number Theory and in decidability issues.

In this article we investigate algebraic relations among the elements of the exponential field (?, e ^x ) modulo Schanuel's Conjecture. We prove that there are no further relations between π and i assuming Schanuel's Conjecture except the known ones, e ^πi  = ?1 and i ² = ?1. Moreover, modulo Schanuel's Conjecture we prove that the E-subring of ? generated by π is isomorphic to the free exponential ring on π.     

Goldbach Conjecture and the least prime number in an arithmetic progression

In this Note, we try to study the relations between the Goldbach Conjecture and the least prime number in an arithmetic progression. We give a new weakened form of the Goldbach Conjecture. We prove that this weakened form and a weakened form of the Chowla Hypothesis imply that every sufficiently large even integer may be written as the sum of two distinct primes.     

Numerical analogues of the Kodaira dimension and the Abundance Conjecture

We add further notions to Lehmann’s list of numerical analogues to the Kodaira dimension of pseudo-effective divisors on smooth complex projective varieties, and show new relations between them. Then we use these notions and relations to fill in a gap in Lehmann’s arguments, thus proving that most of these notions are equal. Finally, we show that the Abundance Conjecture, as formulated in the context of the Minimal Model Program, and the Generalized Abundance Conjecture using these numerical analogues to the Kodaira dimension, are equivalent for non-uniruled complex projective varieties.     

A confinal family of equivalence relations and Borel ideals generating them

An increasing θ₁-sequence of Borel equivalence relations on a Polish space that is cofinal (in the sense of Borel reducibility) in the family of all Borel equivalence relations is defined as a development of Rosendal’s construction. It is proved that equivalence relations from this sequence are generated by explicitly defined Borel ideals.     

Homological equivalence relations on an algebraic curve

We study the collection of homological equivalence relations on a fixed curve. We construct a moduli space for pairs consisting of a curve of genus g and a homological equivalence relation of degree n on the curve, and a classifying set for homological equivalence relations of degree n on a fixed curve, modulo automorphisms of the curve. We identify a special type of homological equivalence relations, and we characterize the special homological equivalence relations in terms of the existence of elliptic curves in the Jacobian of the curve.     

Equivalence relations of AF-algebra extensions

In this paper, we consider equivalence relations of C*-algebra extensions and describe the relationship between the isomorphism equivalence and the unitary equivalence. We also show that a certain group homomorphism is the obstruction for these equivalence relations to be the same.     

模糊粒度空间的性质研究

在文献[16]基础上,进一步将模糊粒度空间推广到更一般地模糊等价关系上,研究了模糊粒度空间的性质,主要获得了3个结论.首先,引入了有序的等价关系集的概念,给出了下列的四个命题是等价的:(1) 给定一个模糊等价关系;(2) 给定一个等腰归一化伪距离;(3) 给定一个有序的粒度空间;(4) 给定一个有序的等价关系集.第二,通过模糊等价关系诱导的等腰归一化伪距离的投影距离和扩展距离,建立了模糊粒度空间上的距离,即是等腰归一化距离,并且给出了模糊粒度空间上距离度量的动态性质研究.最后,给出了模糊粒度空间与模糊等价关系之间的序关系,即它们的序是一致的.这些研究工作进一步完善了模糊粒度空间的理论,为模糊粒度计算提供了更为直观的数学理论和工具.     

The Iterated Aluthge Transform of an Operator

The Aluthge transform (defined below) of an operator T on Hilbert space has been studied extensively, most often in connection with p-hyponormal operators. In [6] the present authors initiated a study of various relations between an arbitrary operator T and its associated , and this study was continued in [7], in which relations between the spectral pictures of T and were obtained. This article is a continuation of [6] and [7]. Here we pursue the study of the sequence of Aluthge iterates { ⁽ⁿ⁾} associated with an arbitrary operator T. In particular, we verify that in certain cases the sequence { ⁽ⁿ⁾} converges to a normal operator, which partially answers Conjecture 1.11 in [6] and its modified version below (Conjecture 5.6). Submitted: December 5, 2000? Revised: August 30, 2001.     

On the GLY Conjecture of upper estimate of positive integral points in real right-angled simplices

The GLY (Granville-Lin-Yau) Conjecture is a generalization of Lin, Xu and Yau's results. An important application of GLY is its use in characterizing an affine hypersurface in Cn as a cone over a nonsingular projective variety. In addition, the Rough Upper Estimate Conjecture in GLY, recently proved by Yau and Zhang, implies the Durfee Conjecture in singularity theory. This paper develops a unified approach to prove the Sharp Upper Estimate Conjecture for general n. Using this unified approach, we prove that the Sharp Upper Estimate Conjecture is true for n=4,5,6. After giving a counter-example to show that the Sharp Upper Estimate Conjecture is not true for n=7, we propose a Modified GLY Conjecture. For each fixed n, our unified approach can be used to prove this Modified GLY Conjecture.     

Uniquely colorable perfect graphs

This paper defines the concept of sequential coloring. If G or its complement is one of four major types of perfect graphs, G is shown to be uniquely k-colorable it and only if it is sequentially k-colorable. It is conjectured that this equivalence is true for all perfect graphs. A potential role for sequential coloring in verifying the Strong Perfect Graph Conjecture is discussed. This conjecture is shown to be true for strongly sequentially colorable graphs.     

The Gaussian Moments Conjecture and the Jacobian Conjecture

We first propose what we call the Gaussian Moments Conjecture. We then show that the Jacobian Conjecture follows from the Gaussian Moments Conjecture. Note that the the Gaussian Moments Conjecture is a special case of [11, Conjecture 3.2]. The latter conjecture was referred to as the Moment Vanishing Conjecture in [7, Conjecture A] and the Integral Conjecture in [6, Conjecture 3.1] (for the one-dimensional case). We also give a counter-example to show that [11, Conjecture 3.2] fails in general for polynomials in more than two variables.     

Global observer design for nonlinear systems

This paper is a geometric study of the global observer design for nonlinear systems. Using the theory of foliations, we derive necessary and sufficient conditions for global exponential observers for nonlinear systems under some assumptions. Our proof for these necessary and sufficient conditions for global exponential observers if via defining two equivalence relations known as horizontal and vertical equivalence relations, and constructing two foliations known as horizontal and vertical foliations from these equivalence relations. Finally, as a corollary of our global theorem, we derive necessary and sufficient conditions for local exponential observers of critically Lyapunov stable nonlinear systems.     

Bisimulations for fuzzy automata

Bisimulations have been widely used in many areas of computer science to model equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the study of equivalence between fuzzy automata. We prove that a uniform fuzzy relation between fuzzy automata A and B is a forward bisimulation if and only if its kernel and co-kernel are forward bisimulation fuzzy equivalence relations on A and B and there is a special isomorphism between factor fuzzy automata with respect to these fuzzy equivalence relations. As a consequence we get that fuzzy automata A and B are UFB-equivalent, i.e., there is a uniform forward bisimulation between them, if and only if there is a special isomorphism between the factor fuzzy automata of A and B with respect to their greatest forward bisimulation fuzzy equivalence relations. This result reduces the problem of testing UFB-equivalence to the problem of testing isomorphism of fuzzy automata, which is closely related to the well-known graph isomorphism problem. We prove some similar results for backward-forward bisimulations, and we point to fundamental differences. Because of the duality with the studied concepts, backward and forward-backward bisimulations are not considered separately. Finally, we give a comprehensive overview of various concepts on deterministic, nondeterministic, fuzzy, and weighted automata, which are related to bisimulations.     

Endotypes of partial equivalence relations

We classify all partial equivalence relations according to their endotype with respect to endotopisms and compute the cardinalities of endotopism semigroups (strong endotopism monoids, autotopism groups) of partial equivalence relations on a finite set.

     

Generalized isoclinism and characters of finite groups

In this paper, we deal with equivalence relations on groups, inspired by the relation of isoclinism due to P. Hall. Isoclinism is — essentially — defined by the commutator map of groups. We take another map and define related equivalence relations. We shall show that modular character degrees and modular monomiality of finite groups are preserved under such an equivalence relation.     

A transfer algorithm for hierarchical clustering

Transfer algorithms are usually used to optimize an objective function that is defined on the set of partitions of a finite set X. In this paper we define an equivalence relation ? on the set of fuzzy equivalence relations on X and establish a bijection from the set of hierarchies on X to the set of equivalence classes with respect to ?. Thus, hierarchies can be identified with fuzzy equivalence relations and the transfer algorithm can be modified in order to optimize an objective function that is defined on the set of hierarchies on X.     

Indecomposability of treed equivalence relations

We define rigorously a “treed” equivalence relation, which, intuitively, is an equivalence relation together with a measurably varying tree structure on each equivalence class. We show, in the nonamenable, ergodic, measure-preserving case, that a treed equivalence relation cannot be stably isomorphic to a direct product of two ergodic equivalence relations.     

Teaching equivalence relations using collaborative activities

The notion of equivalence relation is a fundamental concept in mathematics and yet mathematics students often are not given formal exposure to it until midway through their college careers. Not only do they need to become adept at working with equivalence relations but they should also understand the wide applicability of this notion. In this paper collaborative exercises are provided for students to gain facility with equivalence relations and their classes, as well as to see their usefulness in various areas of mathematics and computer science.