Related papers: A scalar matching factor on the Birkhoff polytope …
What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and…
Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…
We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…
We present a new algorithm which detects the maximal possible number of matched disjoint pairs satisfying a given caliper when a bipartite matching is done with respect to a scalar index (e.g., propensity score), and constructs a…
With the goal of providing the foundations for a rigorous study of modules of bicomplex holomorphic functions, we develop a general theory of functional analysis with bicomplex scalars. Even though the basic properties of bicomplex number…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…
Birkhoff's variety theorem from universal algebra characterises equational subcategories of varieties. We give an analogue of Birkhoff's theorem in the setting of enrichment in categories. For a suitable notion of an equational subcategory…
Quantum measurements can be interpreted as a generalisation of probability vectors, in which non-negative real numbers are replaced by positive semi-definite operators. We extrapolate this analogy to define a generalisation of doubly…
We consider models of Bayesian inference of signals with vectorial components of finite dimensionality. We show that, under a proper perturbation, these models are replica symmetric in the sense that the overlap matrix concentrates. The…
We consider the problem of finding the Perron-Frobenius eigenvector of a primitive matrix. Dividing each of the rows of the matrix by the sum of the elements in the row, the resulting new matrix is stochastic. We give a formula for the…
The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…
This paper investigates the issue of determining the dimensions of row and column factor spaces in matrix-valued data. Exploiting the eigen-gap in the spectrum of sample second moment matrices of the data, we propose a family of randomised…
In the present paper we introduce a concept of doubly stochastic quadratic operator. We prove necessary and sufficient conditions for doubly stochasticity of operator. Besides, we prove that the set of all doubly stochastic operators forms…
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…
Given a nonnegative matrix $A$, can you find diagonal matrices $D_1,~D_2$ such that $D_1AD_2$ is doubly stochastic? The answer to this question is known as Sinkhorn's theorem. It has been proved with a wide variety of methods, each…
In this paper, we consider the nonstationary matrix-valued time series with common stochastic trends. Unlike the traditional factor analysis which flattens matrix observations into vectors, we adopt a matrix factor model in order to fully…
We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…
We consider a linear meromorphic system in the Birkhoff standard form. The construction of the isomonodromic deformation of it proposed by Bolibruch is discussed. This construction has some special characteristics because of resonant…
Boolean matrix factorization (BMF) has many applications in data mining, bioinformatics, and network analysis. The goal of BMF is to decompose a given binary matrix as the Boolean product of two smaller binary matrices, revealing underlying…