Related papers: On Supmodular Matrices

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

We give the maximal distance between a copula and itself when the argument is permuted for arbitrary dimension, generalizing a result for dimension two by Nelsen (2007), Klement and Mesiar (2006). Furthermore, we establish a subset of…

It is known that singular values of idempotent matrices are either zero or larger or equal to one \cite{HouC63}. We state exactly how many singular values greater than one, equal to one, and equal to zero there are. Moreover, we derive a…

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

This paper is concentrated on the classification of permutation matrix with the permutation similarity relation, mainly about the canonical form of a permutational similar equivalence class, the cycle matrix decomposition of a permutation…

The paper presents the classification of matrix valued superpotentials corresponding to shape invariant systems of Schr\"odinger equations. All inequivalent irreducible matrix superpotentials realized by matrices of arbitrary dimension with…

This paper introduces the notion of mesh patterns in multidimensional permutations and initiates a systematic study of singleton mesh patterns (SMPs), which are multidimensional mesh patterns of length 1. A pattern is avoidable if there…

We study permutability properties of matrix semigroups over commutative bipotent semirings (of which the best-known example is the tropical semiring). We prove that every such semigroup is weakly permutable (a result previous stated in the…

We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…

There are several notions of the 'dual' of a word/tile substitution. We show that the most common ones are equivalent for substitutions in dimension one, where we restrict ourselves to the case of two letters/tiles. Furthermore, we obtain…

A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…

For a permutation $\pi$, and the corresponding permutation matrix, we introduce the notion of {\em discrete derivative}, obtained by taking differences of successive entries in $\pi$. We characterize the possible derivatives of…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

Let $\mathbb{F}$ be a field, and $n \geq r>0$ be integers, with $r$ even. Denote by $\mathrm{A}_n(\mathbb{F})$ the space of all $n$-by-$n$ alternating matrices with entries in $\mathbb{F}$. We consider the problem of determining the…

An integer matrix $\mathbf{A}$ is $\Delta$-modular if the determinant of each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix of $\mathbf{A}$ has absolute value at most $\Delta$. The study of $\Delta$-modular matrices…

We prove that, up to adding a complement, every modular representation of a finite group admits a finite resolution by permutation modules.

Testing the unimodular equivalence of two full-dimensional integral simplices can be reduced to testing unimodular permutation (UP) equivalence of two nonsingular matrices. We conduct a systematic study of UP-equivalence, which leads to the…

We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

For finite permutation groups, simplicity of the augmentation submodule is equivalent to $2$-transitivity over the field of complex numbers. We note that this is not the case for transformation monoids. We characterize the finite…