Related papers: A Real Nullstellensatz for Matrices of Non-Commuta…

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…

A variant of the Archimedean Positivstellensatz is proved which is based on Archimedean semirings or quadratic modules of generating subalgebras. It allows one to obtain representations of strictly positive polynomials on compact…

In this expository note we show how combinatorial Nullstellensatz by N. Alon naturally appears in solutions of elementary problems. Simple ideas gradually and naturally appear in such solutions, thus bringing a reader to generalizations.…

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

We study the completion of approximately low rank matrices with entries missing not at random (MNAR). In the context of typical large-dimensional statistical settings, we establish a framework for the performance analysis of the nuclear…

We prove a version of a Nullstellensatz for partial exponential fields $(K,E)$, even though the ring of exponential polynomials $K[X_1,\ldots,X_n]^E$ is not a Hilbert ring. We show that under certain natural conditions one can embed an…

In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…

The main result of this paper is a coefficient formula that sharpens and generalizes Alon and Tarsi's Combinatorial Nullstellensatz, which provides some information about the polynomial map $P|_{\X_1\times...\times\X_n}$ when only…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

We study the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$ on $m$-tuples of $n \times n$ matrices with entries in an infinite field $K$. We show that invariants of degree $n^2- n$ define the null cone. Consequently,…

The complete eigenstructure, or structural data, of a rational matrix $R(s)$ is comprised by its invariant rational functions, both finite and at infinity, which in turn determine its finite and infinite pole and zero structures,…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Consider the polynomial ring in any finite number of variables over the complex numbers, endowed with the $\ell_1$-norm on the system of coefficients. Its completion is the Banach algebra of power series that converge absolutely on the…

Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is…

We present different techniques for applying Combinatorial Nullstellensatz to polynomials over finite fields. For examples, we generalize theorems from Noga Alon's paper on the subject, and present a few of our own.

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…