Related papers: Compositions and decompositions of binary relation…
We study exponential factorization of invertible matrices over unital complex Banach algebras. In particular, we prove that every invertible matrix with entries in the algebra of holomorphic functions on a closed bordered Riemann surface…
Williams and Beer (2010) proposed a nonnegative mutual information decomposition, based on the construction of information gain lattices, which allows separating the information that a set of variables contains about another into components…
We consider the functions in two variables on an arbitrary poset, for which the convolution operation is defined. We obtain the generalization of incidence algebra and describe its properties: invertibility, the Jackobson radical,…
The operation of a system, such as a vehicle, communication network or automatic process, heavily depends on the correct operation of its components. A Stochastic Binary System (SBS) mathematically models the behavior of on-off systems,…
The multiplicities of the decomposition of the product of an arbitrary number $n$ of spin $s$ states into irreducible $SU(2)$ representations are computed. Two complementary methods are presented, one based on random walks in representation…
We consider the problem of extending an acyclic binary relation that is invariant under a given family of transformations into an invariant preference. We show that when a family of transformations is commutative, every acyclic invariant…
In this paper semirings with an idempotent addition are considered. These algebraic structures are endowed with a partial order. This allows to consider residuated maps to solve systems of inequalities $A \otimes X \preceq B$. The purpose…
Motivated by an application in computational biology, we consider low-rank matrix factorization with $\{0,1\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared…
By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
Given a linear ordinary differential equation (ODE) on $\RE$ and a set of interface conditions at a finite set of points $I \subset \RE$, we consider the problem of determining another differential equation whose {\it global} solutions…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
In this paper we consider symmetric powers representation and exterior powers representation of finite groups, which generated by the representation which has finite dimension over the complex field. We calculate the multiplicity of…
The matrix Schr\"odinger equation is considered on the half line with the general selfadjoint boundary condition at the origin described by two boundary matrices satisfying certain appropriate conditions. It is assumed that the matrix…
We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…
Motivated by the study of word problems of monoids, we explore two ways of viewing binary relations on $A^*$ as languages. We exhibit a hierarchy of classes of binary relations on $A^*$, according to the class of languages the relation…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…