Related papers: A Short Note on Kronecker Square Roots
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
In this paper, we will fully describe the representations of the crystallographic rank two affine Hecke algebras using elementary methods, for all possible values of q. The focus is on the case when q is a root of unity of small order.
As a follow-up to a paper of D. Petz and J. Zem\'anek [4], a number of equivalent conditions which characterize the trace among linear functionals on matrix algebras, finite rank operators and the socle elements of semisimple Banach…
In this paper we classify, up to isomorphism, the superinvolutions on algebras of upper block-triangular matrices over an algebraically closed field of characteristic different from $2$.
In this short note, we reformulate the task of calculating the pair correlation statistics of a Kronecker sequence as a lattice point counting problem. This can be done analogously to the lattice based approach which was used to (re-)prove…
We study two new families of symmetric functions arising from a species-theoretic construction motivated by cycle structure. For each partition of $n$, we define two combinatorial species that decompose into molecules indexed by the same…
Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…
This paper gives a complete classification of conics in $PE_2(\mathbb{R})$. The classification has been made earlier (Reveruk [5]), but it showed to be incomplete and not possible to cite and use in further studies of properties of conics,…
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…
The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…
We study the spectrum of an asymmetric random matrix with block structured variances. The rows and columns of the random square matrix are divided into $D$ partitions with arbitrary size (linear in $N$). The parameters of the model are the…
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…
We consider the problem of reconstructing a low rank matrix from a subset of its entries and analyze two variants of the so-called Alternating Minimization algorithm, which has been proposed in the past. We establish that when the…
In this paper, our main aim is to determine the multiplicities of a class of roots for Nichols algebra of diagonal type over fields of arbitrary characteristic, which is a generalization of the results on the multiplicities of these roots…
The binary rank of a $0,1$ matrix is the smallest size of a partition of its ones into monochromatic combinatorial rectangles. A matrix $M$ is called $(k_1, \ldots, k_m ; n_1, \ldots, n_m)$ circulant block diagonal if it is a block matrix…
This paper classifies the blocks of the cyclotomic Hecke algebras of type G(r,1,n) over an arbitrary field. Rather than working with the Hecke algebras directly we work instead with the cyclotomic Schur algebras. The advantage of these…
In this paper we discuss the mathematical background and the computational aspects which underly the implementation of a collection of Julia functions in the MatrixPencils package for the determination of structural properties of polynomial…
In this paper, we propose three approaches for the estimation of the Tucker decomposition of multi-way arrays (tensors) from partial observations. All approaches are formulated as convex minimization problems. Therefore, the minimum is…
We introduce a basis of the symmetric functions that evaluates to the (irreducible) characters of the symmetric group, just as the Schur functions evaluate to the irreducible characters of $GL_n$ modules. Our main result gives three…
The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that need to be changed in order to obtain a matrix of rank at most $r$. At MFCS'77, Valiant introduced matrix rigidity as a tool to prove circuit…