Coset relation algebras

A measurable relation algebra is a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the “size” of each such atom can be defined in an intuitive and reasonable way (within the framework of the first-order theory of relation algebras). A large class of examples of such algebras, using systems of groups and coordinated systems of isomorphisms between quotients of the groups, has been constructed. This class of group relation algebras is not large enough to exhaust the class of all measurable relation algebras. In the present article, the class of examples of measurable relation algebras is considerably extended by adding one more ingredient to the mix: systems of cosets that are used to “shift” the operation of relative multiplication. It is shown that, under certain additional hypotheses on the system of cosets, each such coset relation algebra with a shifted operation of relative multiplication is an example of a measurable relation algebra. We also show that the class of coset relation algebras does contain examples that are not representable as set relation algebras. In later articles, it is shown that the class of coset relation algebras is adequate to the task of describing all measurable relation algebras in the sense that every atomic measurable relation algebra is essentially isomorphic to a coset relation algebra, and the class of group relation algebras is similarly adequate to the task of representing all measurable relation algebras in which the associated groups are finite and cyclic.     

A new binary relation to compare viability of winning coalitions and its interrelationships to desirability relation and blockability relation

This paper aims to propose a new type of binary relations, called the viability relation, defined on the set of all coalitions in a simple game for a comparison of coalition influence, and to investigate its properties, especially its interrelationships to the desirability relation and the blockability relation. The viability relation is defined to compare coalitions based on their robustness over deviation of their members for complementing the inability of the desirability relation and the blockability relation to make a distinguishable comparison among winning coalitions. It is verified in this paper that the viability relation on a simple game is always transitive and is complete if and only if the simple game is S-unanimous for a coalition S. Examples show that there are no general inclusion relations among the desirability relation, the blockability relation and the viability relation. It is also verified that the viability relation and the blockability relation are complementary to each other. Specifically, the blockability relation between two coalitions is equivalent to the inversed viability relation between the complements of the two coalitions.     

On the duality and the derivation relations for multiple zeta values

We consider the problem of deducing the duality relation from the extended double shuffle relation for multiple zeta values. Especially we prove that the duality relation for double zeta values and that for the sum of multiple zeta values whose first components are 2’s are deduced from the derivation relation, which is known as a subclass of the extended double shuffle relation.     

均值限制相似优势粗糙集及决策分析模型研究

针对不完备信息系统中的偏好多属性决策问题,提出了一种基于均值限制相似优势粗糙集的决策分析模型.首先提出了均值限制相似优势关系的概念;然后在均值限制相似优势关系下得到知识的粗糙近似和属性约简,给出了分类决策规则.与相似优势关系和限制相似优势关系比较研究的结果表明:均值限制优势关系的分类精度和质量介于二者之间,而分类误差率则优于相似优势关系和限制相似优势关系,得到的决策规则可信度更高,决策模型与实际情况更加相符.     

A study on the transitivity of probabilistic and fuzzy relations

Given a set of alternatives we consider a fuzzy relation and a probabilistic relation defined on such a set. We investigate the relation between the T-transitivity of the fuzzy relation and the cycle-transitivity of the associated probabilistic relation. We provide a general result, valid for any t-norm and we later provide explicit expressions for important particular cases. We also apply the results obtained to explore the transitivity satisfied by the probabilistic relation defined on a set of random variables. We focus on uniform continuous random variables.     

Valued preference-based instantiation of argumentation frameworks with varied strength defeats

A Dung-style argumentation framework aims at representing conflicts among elements called arguments. The basic ingredients of this framework is a set of arguments and a Boolean abstract (i.e., its origin is not known) binary defeat relation. Preference-based argumentation frameworks are instantiations of Dung's framework in which the defeat relation is derived from an attack relation and a preference relation over the arguments. Recently, Dung's framework has been extended in order to consider the strength of the defeat relation, i.e., to quantify the degree to which an argument defeats another argument. In this paper, we instantiate this extended framework by a preference-based argumentation framework with a valued preference relation. As particular cases, the latter can be derived from a weight function over the arguments or a Boolean preference relation. We show under some reasonable conditions that there are “less situations” in which a defense between arguments holds with a valued preference relation compared to a Boolean preference relation. Finally, we provide some conditions that the valued preference relation shall satisfy when it is derived from a weight function.     

A generalization of Ohnoʼs relation for multiple zeta values

In this paper, we prove that certain parametrized multiple series satisfy the same relation as Ohno?s relation for multiple zeta values. This result gives us a generalization of Ohno?s relation for multiple zeta values. By virtue of this generalization, we obtain a certain equivalence between the above relation among the parametrized multiple series and a subfamily of the relation. As applications of the above results, we obtain some results on multiple zeta values.     

On α-Relation and Transitivity Conditions of α

The main tools in the theory of hyperstructurs are the fundamental relations. The fundamental relation on hyperring was introduced by Vougiouklis at the fourth AHA congress (1990). The fundamental relation on a hyperring is defined as the smallest equivalence relation so that the quotient would be the ring. Note that, generally, the commutativity in the ring are not assumed. In this article, we introduce a new strongly regular equivalence relation on hyperring so that the quotient is a commutative ring. Also we state the condition that is equivalent with the transitivity of this relation and finally we characterize the complete hyperring (with the fundamental relation as commutative).     

Spectral Theory for Riemannian Manifolds with Cusps and a Related Trace Formula

A new orthogonality relation for normed linear spaces is introduced using a concept of area of a parallelogram given by E. Silverman. Comparisons are drawn between this relation and an earlier relation used by G. Birkhoff. In addition, this new relation is utilized to obtain new characterizations of inner-product spaces.     

THE PROXIMAL RELATION,REGIONALLY PROXIMAL RELATION AND BANACH PROXIMAL RELATION FOR AMENABLE GROUP ACTIONS

In this paper,we study the proximal relation,regionally proximal relation and Banach proximal relation of a topological dynamical system for amenable group acti...     

相似关系粗集理论与相似关系信息系统

粗集理论认为知识表现为人们对对象的分类能力 ,从而用等价关系定义上 (下 )逼近并用于信息系统中知识的简约和归纳学习的研究。本文针对现实中数据局限导致等价关系弱化为相似关系 ,用相似关系代替等价关系建立粗集理论并以它为基础建立相似关系信息系统 ,进而在此类系统中研究知识简约与静态学习。文中还作为特例来讨论属性相似关系信息系统 ,作为推广而研究模糊相似关系信息系统及其近似系统     

Eigenvector method,consistency test and inconsistency repairing for an incomplete fuzzy preference relation

In this paper, we extend the eigenvector method (EM) to priority for an incomplete fuzzy preference relation. We give a reasonable definition of multiplicative consistency for an incomplete fuzzy preference relation. We also give an approach to judge whether an incomplete fuzzy relation is acceptable or not. We develop the acceptable consistency ratio for an incomplete multiplicative fuzzy preference relation, which is simple and similar to Saaty’s consistency ratio (CR) for the multiplicative preference relation. If the incomplete fuzzy preference relation is not of acceptable consistency, we define a criterion to find the unusual and false element (UFE) in the preference relation, and present an algorithm to repair an inconsistent fuzzy preference relation until its consistency is satisfied with the consistency ratio. As a result, our improvement method cannot only satisfy the consistency requirement, but also preserve the initial preference information as much as possible. Finally, an example is illustrated to show that our method is simple, efficiency, and can be performed on computer easily.     

一种具有综合评价功能的模糊聚类方法

证明模糊关系R为A∈F(X)上模糊等价关系的一个充要条件。定义A∈F(X)上的模糊相似关系，同时讨论上述模糊等价关系及相似关系的性质，给出一种具有综合评价功能的模糊聚类方法，该方法对解决具有某种模糊前提条件的聚类问题非常有效。     

Some models for deriving the priority weights from interval fuzzy preference relations

Interval fuzzy preference relation is a useful tool to express decision maker’s uncertain preference information. How to derive the priority weights from an interval fuzzy preference relation is an interesting and important issue in decision making with interval fuzzy preference relation(s). In this paper, some new concepts such as additive consistent interval fuzzy preference relation, multiplicative consistent interval fuzzy preference relation, etc., are defined. Some simple and practical linear programming models for deriving the priority weights from various interval fuzzy preference relations are established, and two numerical examples are provided to illustrate the developed models.     

Methods for comparison of coalition influence on games in characteristic function form and their interrelationships

This paper extends two existent methods, called the blockability relation and the viability relation, for simple games to compare influence of coalitions, to those for games in characteristic function form, and shows that the newly defined relations satisfy transitivity and completeness. It is shown in this paper that for every game in characteristic function form the blockability relation and the viability relation have a complementary interrelationship.     

Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation

An approach to calculate the exact transitive closure of a parameterized and normalized affine integer tuple relation is presented. A relation is normalized when it describes graphs of the chain topology only. The exact transitive closure calculation is based on resolving a system of recurrence equations being formed from the input and output tuples of a normalized relation. The approach permits for calculating an exact transitive closure for a relation when the constraints of this closure are represented by both affine and non-linear forms. An example of calculating the exact transitive closure of normalized affine integer tuple relation is presented.     

Second structure relation for semiclassical orthogonal polynomials

Classical orthogonal polynomials are characterized from their orthogonality and by a first or second structure relation. For the semiclassical orthogonal polynomials (a generalization of the classical ones), we find only the first structure relation in the literature. In this paper, we establish a second structure relation. In particular, we deduce it by means of a general finite-type relation between a semiclassical polynomial sequence and the sequence of its monic derivatives.     

四元数矩阵理论中的几个概念间的关系

本文指出并改正文［１］中的错误，给出弱特征多项式［２］与重特征多项式［３］间的显式关系，同时也给出行列式［２］与重行列式［４］间的显式关系，最后讨论了左特征值、右特征值、特征值和特征根之间的关系及最小多项式与弱特征多项式根之间的关系．     

加型一致性毕达哥拉斯模糊偏好关系

在模糊偏好关系两种等价的加型一致性概念基础上,通过简单的数学证明,分析了区间值模糊偏好关系、直觉模糊偏好关系的相应的两种加型一致性并不是等价的.然后,在加型一致性直觉模糊偏好关系的启发下,构造了可以与毕达哥拉斯模糊偏好关系相互转换的两个区间值模糊偏好关系,并利用它们的加型一致性,定义了加型一致性毕达哥拉斯模糊偏好关系,并分析了其与杨艺等定义的加型一致性毕达哥拉斯模糊偏好关系的关系.其次,研究了加型一致性毕达哥拉斯模糊偏好关系的性质以及毕达哥拉斯模糊偏好关系的满意一致性,并给出满意一致性毕达哥拉斯模糊偏好关系下的方案优劣排序算法.最后,通过两个计算实例说明了排序算法可行有效.     

Alethic Functionalism,Manifestation, and the Nature of Truth

Michael Lynch has recently proposed an updated version of alethic functionalism according to which the relation between truth per se and lower-level truth properties is not the realization relation, as might be expected, and as Lynch himself formerly held, but the manifestation relation. I argue that the manifestation relation is merely a resemblance relation and is inadequate to properly relate truth per se to lower-level truth properties. I also argue that alethic functionalism does not justify the claim that truth per se exists, or that truth per se is a functional property. Finally, I suggest a replacement for the manifestation relation. I argue that the resulting theory is a strict improvement over alethic functionalism on two counts, but that the improved theory does not justify the claim that truth per se exists. Since no further improvements to the theory are apparent, the prospects for alethic functionalism are dim.