Related papers: Semi-canonical binary matrices
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive…
We investigate the fine-grained and the parameterized complexity of several generalizations of binary constraint satisfaction problems (BINARY-CSPs), that subsume variants of graph colouring problems. Our starting point is the observation…
Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the…
We produce a short and elementary algorithm to compute an upper bound for the canonical dimension of a spit semisimple linear algebraic group. Using this algorithm we confirm previously known bounds by Karpenko and Devyatov as well as we…
In this paper, we propose to decompose the canonical parameter of a multinomial model into a set of participant scores and category scores. External information about the participants or the categories can be used to restrict these scores.…
This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…
A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…
The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem in computer science, since binary data are omnipresent in…
A practical version of the polynomial canonical formalism is developed for normal mesoscopic systems consisting of N independent electrons. Drastic simplification of calculations is attained by means of proper ordering excited states of the…
In this paper, we introduce and study two new classes of commutative rings, namely semi transitional rings and transitional rings, which extend several classical ideas arising from rings of continuous functions and their variants. A general…
M. Lin defined a binary operation for two positive semi-definite matrices in studying certain determinantal inequalities that arise from diffusion tensor imaging. This operation enjoys some interesting properties similar to the operator…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
Incomplete pairwise comparison matrices offer a natural way of expressing preferences in decision making processes. Although ordinal information is crucial, there is a bias in the literature: cardinal models dominate. Ordinal models usually…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
To study electronic transport through chaotic quantum dots, there are two main theoretical approachs. One involves substituting the quantum system with a random scattering matrix and performing appropriate ensemble averaging. The other…
We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
The concept of S-permutation matrix is considered. A general formula for counting all disjoint pairs of $n^2 \times n^2$ S-permutation matrices as a function of the positive integer $n$ is formulated and proven in this paper. To do that,…
We consider chance-constrained binary programs, where each row of the inequalities that involve uncertainty needs to be satisfied probabilistically. Only the information of the mean and covariance matrix is available, and we solve…
We define and study the canonical complex of a finite semidistributive lattice $L$. It is the simplicial complex on the join or meet irreducible elements of $L$ which encodes each interval of $L$ by recording the canonical join…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…