Related papers: Mathematical Modeling of the Weaving Structure Des…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
We propose a multivariate probability distribution that models a linear correlation between binary and continuous variables. The proposed distribution is a natural extension of the previously developed multivariate binary distribution. As…
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…
We consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition. We formulate the similar elements problem as an optimization and…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
Efficient vectors are the natural set from which to choose a cardinal ranking vector for a pairwise comparison matrix. Such vectors are the key to certain business project selection models. Many ways to construct specific efficient vectors…
Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…
Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…
The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
We consider the canonical Wiener-Hopf factorisation of $2 \times 2$ symmetric matrices $\mathcal M$ with respect to a contour $\Gamma$. For the case that the quotient $q$ of the two diagonal elements of $\mathcal M$ is a rational function,…
Generally, combinatorial design concerns with the arrangement of a finite set of elements into patterns (subsets, words, arrays) according to specified rules. The usefulness of this design method is that the number of input combination can…
The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we…
A set of valuable universal similarity factorization equalities is established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…
We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…
When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…
In most of the network coding problems with $k$ messages, the existence of binary network coding solution over $\mathbb{F}_2$ depends on the existence of adequate sets of $k$-dimensional binary vectors such that each set comprises of…
In this paper, we construct Pell matrices, analogous to Fibonacci matrices, to study algebraic properties of Pell numbers via linear algebra. This framework yields identities involving the trace, inverse, and determinant, as well as matrix…
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an efficient algorithm exploiting the invariance of the…