Related papers: Some New Results on Binary Relations
Several sets of quaternionic functions are described and studied. Residue current of the right inverse of a quaternionic function is introduced in particular cases.
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain…
The aim of the present paper is to generalize the concept of residuated poset, by replacing the usual partial ordering by a generic binary relation, giving rise to relational systems which are residuated. In particular, we modify the…
When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…
We construct a symmetric invertible binary pairing function $F(m,n)$ on the set of positive integers with a property of $F(m,n)=F(n,m)$. Then we provide a complete proof of its symmetry and bijectivity, from which the construction of…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Given two relations containing multiple measurements - possibly with uncertainties - our objective is to find which sets of attributes from the first have a corresponding set on the second, using exclusively a sample of the data. This…
It is well-known that to every binary relation on a non-void set I there can be assigned its incidence matrix, also in the case when I is infinite. We show that a certain kind of "multiplication" of such incidence matrices corresponds to…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that…
The branching rules between simple Lie algebras and its regular (maximal) simple subalgebras are studied. Two types of recursion relations for anomalous relative multiplicities are obtained. One of them is proved to be the factorized…
A uniformization of a binary relation is a function that is contained in the relation and has the same domain as the relation. The synthesis problem asks for effective uniformization for classes of relations and functions that can be…
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
The objective of this paper is, in the main, twofold: Firstly, to develop an algebraic setting for dealing with Bell polynomials and related extensions. Secondly, based on the author's previous work on multivariate Stirling polynomials…
We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…
Causal inference in completely randomized treatment-control studies with binary outcomes is discussed from Fisherian, Neymanian and Bayesian perspectives, using the potential outcomes framework. A randomization-based justification of…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…
Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…