English
Related papers

Related papers: On the equivalence problem of Smith forms for mult…

200 papers

The Rank Minimization Problem asks to find a matrix of lowest rank inside a linear variety of the space of n x n matrices. The Low Rank Matrix Completion problem asks to complete a partially filled matrix such that the resulting matrix has…

Numerical Analysis · Computer Science 2015-01-13 Harm Derksen

In the Nonnegative Matrix Factorization (NMF) problem we are given an $n \times m$ nonnegative matrix $M$ and an integer $r > 0$. Our goal is to express $M$ as $A W$ where $A$ and $W$ are nonnegative matrices of size $n \times r$ and $r…

Data Structures and Algorithms · Computer Science 2011-11-04 Sanjeev Arora , Rong Ge , Ravi Kannan , Ankur Moitra

In this paper two related simplification problems for systems of linear inequalities describing precedence relation systems are considered. Given a precedence relation system, the first problem seeks a minimum subset of the precedence…

Data Structures and Algorithms · Computer Science 2015-03-17 Kin Cheong Sou

A P-matrix is a square matrix $X$ such that all principal submatrices of $X$ have positive determinant. Such matrices appear naturally in instances of the linear complementarity problem, where these are precisely the matrices for which the…

Discrete Mathematics · Computer Science 2021-10-13 Spencer Gordon , Kevin Shu

V.I. Arnold [Russian Math. Surveys 26 (2) (1971) 29-43] constructed a miniversal deformation of matrices under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it can be reduced…

Representation Theory · Mathematics 2012-12-14 Andrii R. Dmytryshyn , Vyacheslav Futorny , Vladimir V. Sergeichuk

If f(x_1, x_2, ..., x_n) is a polynomial dependent on a large number of independent Bernoulli random variables, what can be said about the maximum concentration of f on any single value? For linear polynomials, this reduces to one version…

Probability · Mathematics 2015-07-03 Kevin P. Costello

Let K be an arbitrary (commutative) field with at least three elements. It was recently proven that an affine subspace of M_n(K) consisting only of non-singular matrices must have a dimension lesser than or equal to n(n-1)/2. Here, we…

Rings and Algebras · Mathematics 2013-02-25 Clément de Seguins Pazzis

The notion of type of a differential 2-form in four variables is introduced and for 2-forms of type < 4, local normal models are given. If the type of a 2-form $\Omega$ is 4, then the equivalence under diffeomorphisms of $\Omega$ is reduced…

Differential Geometry · Mathematics 2018-02-12 Jaime Muñoz Masqué , Luis Miguel Pozo Coronado

Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…

Combinatorics · Mathematics 2021-05-17 Lisa Sauermann

We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…

Combinatorics · Mathematics 2025-02-06 Antongiulio Fornasiero , Elliot Kaplan

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Number Theory · Mathematics 2007-05-23 H. A. Helfgott

Integral linear systems $Ax=b$ with matrices $A$, $b$ and solutions $x$ are also required to be in integers, can be solved using invariant factors of $A$ (by computing the Smith Canonical Form of $A$). This paper explores a new problem…

Number Theory · Mathematics 2025-09-09 Virendra Sule

In this paper we prove three differenttypes of the so-called many-particle Hardy inequalities. One of them is a "classical type" which is valid in any dimesnion $d\neq 2$. The second type deals with two-dimensional magnetic Dirichlet forms…

Analysis of PDEs · Mathematics 2014-02-26 M. Hoffmann-Ostenhof , T. Hoffmann-Ostenhof , A. Laptev , J. Tidblom

A frame is an overcomplete set that can represent vectors(signals) faithfully and stably. Two frames are equivalent if signals can be essentially represented in the same way, which means two frames differ by a permutation, sign change or…

Information Theory · Computer Science 2019-11-19 Xuemei Chen , Yang Chu , Min Zheng

Let A= (a_{ij}) be a symmetric non-negative integer 2k x 2k matrix. A is homogeneous if a_{ij} + a_{kl}=a_{il} + a_{kj} for any choice of the four indexes. Let A be a homogeneous matrix and let F be a general form in C[x_1, \dots x_n] with…

Algebraic Geometry · Mathematics 2015-03-17 Luca Chiantini

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Rings and Algebras · Mathematics 2018-10-03 Giulio Peruginelli

Minimum numbers decide e.g. whether a given map f: S^m --> S^n/G from a sphere into a spherical space form can be deformed to a map f' such that f(x) not equal f'(x) for all x in S^m. In this paper we compare minimum numbers to…

Algebraic Topology · Mathematics 2013-06-14 Ulrich Koschorke , Duane Randall

We say that two given polynomials $f, g \in R[X]$, over a ring $R$, are equivalent under shifts if there exists a vector $a \in R^n$ such that $f(X+a) = g(X)$. Grigoriev and Karpinski (FOCS 1990), Lakshman and Saunders (SICOMP, 1995), and…

Computational Complexity · Computer Science 2022-07-22 Suryajith Chillara , Coral Grichener , Amir Shpilka

Given an arbitrary (commutative) field K, let V be a linear subspace of M_n(K) consisting of matrices of rank lesser than or equal to some r<n. A theorem of Atkinson and Lloyd states that, if dim V>nr-r+1 and #K>r, then either all the…

Rings and Algebras · Mathematics 2013-03-05 Clément de Seguins Pazzis

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of even grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with certain, explicitly…

Representation Theory · Mathematics 2023-12-29 Fernando De Terán , Andrii Dmytryshyn , Froilán M. Dopico