English
Related papers

Related papers: Small Matrices with Small Inverses: Unimodular Zer…

200 papers

This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…

Commutative Algebra · Mathematics 2007-05-23 Mordechai Katzman

We extend probability estimates on the smallest singular value of random matrices with independent entries to a class of sparse random matrices. We show that one can relax a previously used condition of uniform boundedness of the variances…

Probability · Mathematics 2012-12-21 Alexander Litvak , Omar Rivasplata

We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…

Rings and Algebras · Mathematics 2007-05-23 Daniel Hershkowitz , Michael Neumann , Hans Schneider

Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…

Dynamical Systems · Mathematics 2019-07-16 Michael Baake , John A. G. Roberts

Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…

Category Theory · Mathematics 2024-04-23 Michael Hoefnagel , Pierre-Alain Jacqmin

If $M$ is a set of nonsingular $k\times k$ matrices then for many pairs of matrices, $A,B\in M,$ the sum is nonsingular, $\det(A+B)\neq 0.$ We prove a more general statement on nonsingular sums with an application.

Combinatorics · Mathematics 2018-02-22 Jozsef Solymosi

In alternating sign matrices the first and last nonzero entry in each row and column is specified to be +1. Such matrices always exist. We investigate a generalization by specifying independently the sign of the first and last nonzero entry…

Combinatorics · Mathematics 2013-09-05 Richard A. Brualdi , Hwa Kyung Kim

In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes),…

Combinatorics · Mathematics 2021-12-21 Flavien Mabilat

This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp

In this article, we study the classification of some natural numbers related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal monomial solutions. These are the…

Combinatorics · Mathematics 2024-12-03 Flavien Mabilat

Across machine learning (ML) sub-disciplines, researchers make explicit mathematical assumptions in order to facilitate proof-writing. We note that, specifically in the area of fairness-accuracy trade-off optimization scholarship, similar…

Computers and Society · Computer Science 2021-09-09 A. Feder Cooper , Ellen Abrams

Chebotarev's theorem on roots of unity states that all minors of a Fourier matrix are non-zero if and only if the order of the matrix is prime. We establish cases in which all principal minors of Fourier matrices of square-free order are…

Functional Analysis · Mathematics 2025-12-09 Andrei Caragea , Dae Gwan Lee , Romanos Malikiosis , Goetz E. Pfander

Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…

Logic · Mathematics 2016-10-06 Darío García , Frank Olaf Wagner

In this paper we find a third order unimodular matrix, none of whose entries is $1$ or $-1$, such that when each entry of the matrix is replaced by its cube, the resulting matrix is also unimodular. Further, we find third order square…

Number Theory · Mathematics 2021-10-26 Ajai Choudhry

In earlier work, we characterized the class of matroids with no $M(C_4)$ as an induced minor and the class of matroids with no member of $\{M(C_4),M(K_4)\}$ as an induced minor. In this paper, for every two matroids in…

Combinatorics · Mathematics 2024-12-10 James Dylan Douthitt , James Oxley

In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…

Discrete Mathematics · Computer Science 2007-05-23 R. N. Mohan

This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…

Optimization and Control · Mathematics 2024-03-08 Marcel Celaya , Stefan Kuhlmann , Robert Weismantel

Data sets in the form of binary matrices are ubiquitous across scientific domains, and researchers are often interested in identifying and quantifying noteworthy structure. One approach is to compare the observed data to that which might be…

Methodology · Statistics 2020-10-30 Alex Fout , Bailey K. Fosdick , Matthew P. Hitt

Let $A$ be an element of the copositive cone ${\cal C}_n$. A zero $u$ of $A$ is a nonzero nonnegative vector such that $u^TAu = 0$. The support of $u$ is the index set $\mbox{supp}u \subset \{1,\dots,n\}$ corresponding to the positive…

Optimization and Control · Mathematics 2014-06-10 Roland Hildebrand

We study matrix identities involving multiplication and unary operations such as transposition or Moore-Penrose inversion. We prove that in many cases such identities admit no finite basis.

Group Theory · Mathematics 2014-03-10 Karl Auinger , Igor Dolinka , Mikhail Volkov