English
Related papers

Related papers: Factoring Pseudoidentity Matrix Pairs

200 papers

We introduce the strong recursive skeletonization factorization (RS-S), a new approximate matrix factorization based on recursive skeletonization for solving discretizations of linear integral equations associated with elliptic partial…

Numerical Analysis · Mathematics 2018-02-13 Victor Minden , Kenneth L. Ho , Anil Damle , Lexing Ying

A question of Bergman asks whether the adjoint of the generic square matrix over a field can be factored nontrivially as a product of square matrices. We show that such factorizations indeed exist over any coefficient ring when the matrix…

Commutative Algebra · Mathematics 2007-05-23 Ragnar-Olaf Buchweitz , Graham J. Leuschke

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

Combinatorics · Mathematics 2007-05-23 Ki Hang Kim , Fred W. Roush

We prove a generalization of the Shapiro-Shapiro conjecture on Wronskians of polynomials, allowing the Wronskian to have complex conjugate roots. We decompose the real Schubert cell according to the number of real roots of the Wronski map,…

Algebraic Geometry · Mathematics 2021-07-12 Jake Levinson , Kevin Purbhoo

This paper presents a deterministic, strongly polynomial time algorithm for computing the matrix rank for a class of symbolic matrices (whose entries are polynomials over a field). This class was introduced, in a different language, by…

Computational Complexity · Computer Science 2019-01-29 Orit E. Raz , Avi Wigderson

We prove universal (case-free) formulas for the weighted enumeration of factorizations of Coxeter elements into products of reflections valid in any well-generated reflection group $W$, in terms of the spectrum of an associated operator,…

Combinatorics · Mathematics 2023-06-14 Guillaume Chapuy , Theo Douvropoulos

We propose an algorithm for solving nonlinear convex programs defined in terms of a symmetric positive semidefinite matrix variable $X$. This algorithm rests on the factorization $X=Y Y^T$, where the number of columns of Y fixes the rank of…

Optimization and Control · Mathematics 2010-08-25 M. Journée , F. Bach , P. -A. Absil , R. Sepulchre

We consider the smallest subring $D$ of $\mathbb{R}(X)$ containing every element of the form $1/(1+x^2)$, with $x\in \mathbb{R}(X)$. $D$ is a Pr\"ufer domain called the minimal Dress ring of $\mathbb{R}(X)$. In this paper, addressing a…

Commutative Algebra · Mathematics 2023-12-14 Laura Cossu

We show that a minimal counter example to the Cherlin-Zilber Algebraicity Conjecture for simple groups of finite Morley rank has Prufer 2-rank at most two. This article covers the signalizer functor theory and identifies the groups of Lie…

Logic · Mathematics 2008-11-28 Jeffrey Burdges

We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…

Data Structures and Algorithms · Computer Science 2014-07-11 Gábor Ivanyos , Marek Karpinski , Nitin Saxena

We prove Lusztig's conjectures ${\bf P1}$-${\bf P15}$ for the affine Weyl group of type $\tilde{C}_2$ for all choices of positive weight function. Our approach to computing Lusztig's $\mathbf{a}$-function is based on the notion of a…

Representation Theory · Mathematics 2018-11-19 J. Guilhot , J. Parkinson

The Sylvester-Gallai Theorem states that every rank-$3$ real-representable matroid has a two-point line. We prove that, for each $k\ge 2$, every complex-representable matroid with rank at least $4^{k-1}$ has a rank-$k$ flat with exactly $k$…

Combinatorics · Mathematics 2024-04-30 Jim Geelen , Matthew E. Kroeker

Multiresolution Matrix Factorization (MMF) is unusual amongst fast matrix factorization algorithms in that it does not make a low rank assumption. This makes MMF especially well suited to modeling certain types of graphs with complex…

Machine Learning · Computer Science 2021-11-04 Truong Son Hy , Risi Kondor

We investigate tensor products of matrix factorisations. This is most naturally done by formulating matrix factorisations in terms of bimodules instead of modules. If the underlying ring is C[x_1,...,x_N] we show that bimodule matrix…

Mathematical Physics · Physics 2014-11-20 Nils Carqueville , Ingo Runkel

We study the problem of low-rank tensor factorization in the presence of missing data. We ask the following question: how many sampled entries do we need, to efficiently and exactly reconstruct a tensor with a low-rank orthogonal…

Machine Learning · Statistics 2014-06-12 Prateek Jain , Sewoong Oh

In this paper we show the existence of approximate completely positive semidefinite (cpsd) factorizations with a cpsd-rank bounded above (almost) independently from the cpsd-rank of the initial matrix. This is particularly relevant since…

Algebraic Geometry · Mathematics 2023-09-07 Paria Abbasi , Andreas Klingler , Tim Netzer

This paper is a continuation of [5]. Using the root categories, we define the compact real forms of the complex semisimple Lie algebras, and maximal compact subgroups of the Chevalley groups over $\mathbb{C}$. In [7], Lusztig used the…

Representation Theory · Mathematics 2026-02-26 Buyan Li , Jie Xiao

In 2020, Cossu and Zanardo raised a conjecture on the idempotent factorization on singular matrices in the form $\begin{pmatrix} p&z\\ \bar{z}&\sfrac{\lVert z\rVert}{p} \end{pmatrix},$ where $p$ is a prime integer which is irreducible but…

Rings and Algebras · Mathematics 2023-06-02 Peeraphat Gatephan , Kijti Rodtes

In this article we give an overview of the problem of finding sharp constants in matrix weighted norm inequalities for singular integrals, the so-called matrix A2 conjecture. We begin by reviewing the history of the problem in the scalar…

Classical Analysis and ODEs · Mathematics 2024-03-25 David Cruz-Uribe

Variational minimization of the ground-state energy as a function of the two-electron reduced density matrix (2-RDM), constrained by necessary $N$-representability conditions, provides a polynomial-scaling approach to studying strongly…

Quantum Physics · Physics 2011-11-09 Kasra Naftchi-Ardebili , Nathania W. Hau , David A. Mazziotti