Related papers: An Algorithmic Proof of Suslin's Stability Theorem…

One of the equivalent formulations of the Kadison-Singer problem which was resolved in 2013 by Marcus, Spielman and Srivastava, is the "paving conjecture". Roughly speaking, the paving conjecture states that every positive semi-definite…

The basic result of this note is a statement about the existence of families of partitions of the set of natural numbers with some favourable properties, the n-optimal matrices of partitions. We use this to improve a decomposition result…

In this note, we define a Gaussian probability distribution over matrices. We prove some useful properties of this distribution, namely, the fact that marginalization, conditioning, and affine transformations preserve the matrix Gaussian…

In this paper, we attempt to develop the Quillen Suslin theory for the algebraic fundamental group of a ring. We give a surjective group homomorphism from the algebraic fundamental group of the field of the real numbers to the group of…

We prove that standard Gaussian random multipliers are expected to numerically stabilize both Gaussian elimination with no pivoting and block Gaussian elimination. Moreover we prove that such a multiplier (even without the customary…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

Rosenbrock's theorem on polynomial system matrices is a classical result in linear systems theory that relates the Smith-McMillan form of a rational matrix $G$ with the Smith forms of an irreducible polynomial system matrix $P$ giving rise…

We develop methods for systematic construction of superintegrable polynomials in matrix/eigenvalue models. Our consideration is based on a tight connection of superintegrable property of Gaussian Hermitian model and $W_{1 + \infty}$ algebra…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

Nowadays, many strategies to solve polynomial systems use the computation of a Gr{\"o}bner basis for the graded reverse lexicographical ordering, followed by a change of ordering algorithm to obtain a Gr{\"o}bner basis for the…

We prove that stably isomorphic vector bundles of rank d-1 on a smooth affine d-fold X over an algebraically closed field k are indeed isomorphic, provided d! is invertible in k. This answers an old conjecture of Suslin.

In this short note we present an elementary matrix-constructive proof of Quillen-Suslin theorem for Ore extensions: If $K$ is a division ring and $A:=K[x;\sigma,\delta]$ is an Ore extension, with $\sigma$ bijective, then every finitely…

We consider homogeneous multiaffine polynomials whose coefficients are the Pl\"ucker coordinates of a point $V$ of the Grassmannian. We show that such a polynomial is stable (with respect to the upper half plane) if and only if $V$ is in…

We prove that the most common filtering procedure for nodal discontinuous Galerkin (DG) methods is stable. The proof exploits that the DG approximation is constructed from polynomial basis functions and that integrals are approximated with…

Let $R_n=K[x_1,\dots,x_n]$ be the $n$-variable polynomial ring over a field $K$. Let $S_n$ denote the set of monomials in $R_n$. A monomial $u \in S_n$ is a \textit{Gotzmann monomial} if the Borel-stable monomial ideal $\langle u \rangle$…

We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…

Traditional linear stability analysis based on matrix diagonalization is a computationally intensive $O(n^3)$ process for $n$-dimensional systems of differential equations, posing substantial limitations for the exploration of Turing…

This article studies how to form CUR decompositions of low-rank matrices via primarily random sampling, though deterministic methods due to previous works are illustrated as well. The primary problem is to determine when a column submatrix…

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

Recently, Haglund and Visontai established the stability of the multivariate Eulerian polynomials as the generating polynomials of the Stirling permutations, which serves as a unification of some results of B\'{o}na, Brenti, Janson, Kuba,…