English
Related papers

Related papers: Generic matrix polynomials with fixed rank and fix…

200 papers

To determine whether an $n\times n$-matrix has rank at most $r$ it suffices to check that the $(r+1)\times (r+1)$-minors have rank at most $r$. In other words, to describe the set of $n\times n$-matrices with the property of having rank at…

Algebraic Geometry · Mathematics 2024-06-14 Andreas Blatter

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

Rings and Algebras · Mathematics 2026-03-02 Louis H. Rowen , Uzi Vishne

Let $D$ be a domain with fraction field $K$, and let $M_n(D)$ be the ring of $n \times n$ matrices with entries in $D$. The ring of integer-valued polynomials on the matrix ring $M_n(D)$, denoted ${\rm Int}_K(M_n(D))$, consists of those…

Rings and Algebras · Mathematics 2018-09-26 Giulio Peruginelli , Nicholas J. Werner

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Dynamical Systems · Mathematics 2007-05-23 Laura DeMarco

In this text we study the regularity of matrices with special polynomial entries. Barring some mild conditions we show that these matrices are regular if a natural limit size is not exceeded. The proof draws connections to generalized…

Representation Theory · Mathematics 2020-01-15 Frank Klinker , Christoph Reineke

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

Classical Analysis and ODEs · Mathematics 2019-09-24 Tamás Erdélyi

We prove that strength and slice rank of homogeneous polynomials of degree $d \geq 5$ over an algebraically closed field of characteristic zero coincide generically. To show this, we establish a conjecture of Catalisano, Geramita,…

Algebraic Geometry · Mathematics 2021-02-24 Edoardo Ballico , Arthur Bik , Alessandro Oneto , Emanuele Ventura

We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…

Number Theory · Mathematics 2011-02-15 Patrick Ingram

We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…

Symbolic Computation · Computer Science 2019-07-19 Didier Henrion , Simone Naldi , Mohab Safey El Din

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

Complex Variables · Mathematics 2022-10-14 Golam Mostafa Mondal

We obtain the generic real Jordan canonical forms for $n\times n$ matrices with real entries. More precisely, we prove that the set of $n\times n$ real matrices is the union of the closures of $\lfloor n/2\rfloor+1$ sets, which are called…

Spectral Theory · Mathematics 2026-01-22 Fernando De Terán , Froilán M. Dopico

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

In order to understand the parameter space of monic and centered complex polynomial vector fields of degree d in the complex plane, decomposed by the combinatorial classes of the vector fields, it is interesting to know the number of loci…

Complex Variables · Mathematics 2011-10-18 Kealey Dias

Given a set $\Gamma$ of low-degree k-dimensional varieties in $\mathbb{R}^n$, we prove that for any $D \ge 1$, there is a non-zero polynomial $P$ of degree at most $D$ so that each component of $\mathbb{R}^n \setminus Z(P)$ intersects…

Algebraic Geometry · Mathematics 2015-10-28 Larry Guth

Over fields of characteristic zero, we show that for $n=1,d\geq4$ or $n=2,d\geq5$ or $n\geq3, d\geq 2n$, the generic $m$-marked degree-$d$ hypersurface in $\mathbb{P}^{n+1}$ admits the $m$ marked points as all the rational points. Over…

Algebraic Geometry · Mathematics 2023-09-22 Qixiao Ma

Let $D$ be an integrally closed domain with quotient field $K$. Let $A$ be a torsion-free $D$-algebra that is finitely generated as a $D$-module. For every $a$ in $A$ we consider its minimal polynomial $\mu_a(X)\in D[X]$, i.e. the monic…

Commutative Algebra · Mathematics 2018-10-03 Giulio Peruginelli , Nicholas J. Werner

Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…

Algebraic Geometry · Mathematics 2024-04-12 Daniel Bath , Uli Walther

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

Symbolic Computation · Computer Science 2017-12-13 Mark Giesbrecht , Joseph Haraldson , George Labahn