Related papers: Compositions and decompositions of binary relation…

Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and…

Let $R$ be a ring with identity and $I(X,R)$ be the incidence algebra of a locally finite partially ordered set $X$ over $R.$ In this paper, we compute the socle and the singular ideal of the incidence ring for some $X$ in terms of the…

For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…

We derive formulae for Gram matrices arising in the Nyman--Beurling reformulation of the Riemann hypothesis. The development naturally leads upon series of the form $S(x) = \sum_{n\ge 1} R(nx)$ and their reciprocity relations. We give…

We consider all 16 unary operations that, given a homogeneous binary relation R, define a new one by a boolean combination of xRy and yRx. Operations can be composed, and connected by pointwise-defined logical junctors. We consider the…

For any $n\ge 2$ and fixed $k\ge 1$, we give necessary and sufficient conditions for an arbitrary nonzero square matrix in the matrix ring $\mathbb{M}_n(\mathbb{F})$ to be written as a sum of an invertible matrix $U$ and a nilpotent matrix…

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…

Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…

We formalize the general principle of significance with respect to binary relations which is a universal tool for description and analysis of various situations in and apart from mathematics. We derive the basic properties and focus on a…

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

A certain analysis of all possible associative binary operations on N is presented. This is equivalent with an analysis of all possible monoid structures on N. Several results and a conjecture in this regard are given.

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…

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

The concept of S-permutation matrix is considered in this paper. It defines when two binary matrices are disjoint. For an arbitrary $n^2 \times n^2$ S-permutation matrix, a lower band of the number of all disjoint with it S-permutation…

It is well known that if a function from set A to set B has a right inverse then the function is a surjection and the right inverse is an injection. For finite sets, the number of functions, injections, and surjections can also be counted.…

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

The properties of the normal distribution under linear transformation, as well the easy way to compute the covariance matrix of marginals and conditionals, offer a unique opportunity to get an insight about several aspects of uncertainties…

We construct a binary mutation invariant for skew-symmetric integer matrices. The invariant is not an integer congruence invariant for matrices of odd size: we provide examples of congruent such matrices with different values for the…

Let $\mathcal{R}$ be a $2$-torsion free commutative ring with unity, $X$ a locally finite pre-ordered set and $I(X,\mathcal{R})$ the incidence algebra of $X$ over $\mathcal{R}$. If $X$ consists of a finite number of connected components, we…