Related papers: A scalar matching factor on the Birkhoff polytope …
Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…
Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…
The Jacobi system on a full-line lattice is considered when it contains additional weight factors. A factorization formula is derived expressing the scattering from such a generalized Jacobi system in terms of the scattering from its…
In any symmetric monoidal category, the $n$-th (co)equalizer symmetric power of an object $A$ is the (co)equalizer of all the permutations from $A^{\otimes n}$ to itself. If the symmetric monoidal category is $\mathbb{Q}_{\ge 0}$-linear,…
Given $n$ symmetric Bernoulli variables, what can be said about their correlation matrix viewed as a vector? We show that the set of those vectors $R(\mathcal{B}_n)$ is a polytope and identify its vertices. Those extreme points correspond…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
In this paper, we provide three different ways to partition the polytope of doubly substochastic matrices into subpolytopes via the prescribed row and column sums, the sum of all elements and the sub-defect respectively. Then we…
Permutation invariant polynomial functions of matrices have previously been studied as the observables in matrix models invariant under $S_N$, the symmetric group of all permutations of $N$ objects. In this paper, the permutation invariant…
This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…
The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…
One might argue that solving a trajectory optimization problem over a million grid points is preposterous. How about solving such a problem at an incredibly fast computational time? On a small form-factor processor? Algorithmic details that…
Matrix factorization is a key tool in data analysis; its applications include recommender systems, correlation analysis, signal processing, among others. Binary matrices are a particular case which has received significant attention for…
We study entrywise scalar quantization of two matrices prior to multiplication. Given $A\in R^{m\times k}$ and $B\in R^{k\times n}$, we quantize entries of $A$ and $B$ independently using scalar quantizers with $K_X$ and $K_Y$ levels per…
We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
We show how to achieve a statistical description of the hierarchical structure of a multivariate data set. Specifically we show that the similarity matrix resulting from a hierarchical clustering procedure is the correlation matrix of a…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
The article describes a purely topological counterpart of the $\epsilon$-factorization of constants in the functional equations (which is a key ingredient in the interplay between L-functions and classical automorphic forms). We consider…
Multiple orthogonality is considered in the realm of a Gauss--Borel factorization problem for a semi-infinite moment matrix. Perfect combinations of weights and a finite Borel measure are constructed in terms of M-Nikishin systems. These…
Two scaling functions $\varphi_A$ and $\varphi_B$ for Parseval frame wavelets are algebraically isomorphic, $\varphi_A \simeq \varphi_B$, if they have matching solutions to their (reduced) isomorphic systems of equations. Let $A$ and $B$ be…