Related papers: Some New Results on Binary Relations

We argue that traditional formulations of the reduction thesis that tie it to privileged relational operations do not suffice for Peirce's justification of the categories, and invite the charge of gerrymandering to make it come out as true.…

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Graduated locally finitely presentable categories are introduced, examples include categories of sets, vector spaces, posets, presheaves and Boolean algebras. A finitary functor between graduated locally finitely presentable categories is…

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

In this paper, we initiate a study of a new problem termed function computation on the reconciled data, which generalizes a set reconciliation problem in the literature. Assume a distributed data storage system with two users $A$ and $B$.…

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…

Two elements $a,b$ in a ring $R$ form a right coprime pair, written $\langle a,b\rangle$, if $aR+bR=R$. Right coprime pairs have shown to be quite useful in the study of left cotorsion or exchange rings. In this paper, we define the class…

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

It is conjectured that the regularized double shuffle relations give all algebraic relations among the multiple zeta values, and hence all other algebraic relations should be deduced from the regularized double shuffle relations. In this…

In this note, we introduce a new kind of pair of finite range sets in $\mathbb{C}$ for meromorphic functions corresponding to their uniqueness, i.e., how two meromorphic functions are uniquely determined by their two finite shared sets.

We introduce a new class of problems lying halfway between questions about graph capacity and intersection. We say that two binary sequences x and y of the same length have a skewincidence if there is a coordinate i for which x_i=y_{i+1}=1…

In this paper, we define finitely additive, probability and modular functions over semiring-like structures. We investigate finitely additive functions with the help of complemented elements of a semiring. We also generalize some classical…

This paper deals with (finite or infinite) sequences of arbitrary independent events in some probability space. We find sharp lower bounds for the probability of a union of such events when the sum of their probabilities is given. The…

For the hypergeometric function of unit argument 3F2(1) we prove the existence and uniqueness of three-term relations with arbitrary integer shifts. We show that not only the original 3F2(1) function but also other five functions related to…

In this article, we generalize some frequently used metrical notions such as: completeness, closedness, continuity, g-continuity and compatibility to relation-theoretic setting and utilize these relatively weaker notions to prove results on…

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

In this paper we present a method to pass from a recurrence relation having constant coefficients (in short, a C-recurrence) to a finite succession rule defining the same number sequence. We recall that succession rules are a recently…

We introduce a new type of Bernstein operators, which can be used to approximate the functions with inner singularities. The direct and inverse results of the weighted approximation of this new type of combinations are given.

We investigate purities determined by classes of finitely presented modules including the correspondence between purities for left and right modules. We show some cases where purities determined by matrices of given sizes are different.…