Related papers: Minimal limit key polynomials

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

Define a subset of the complex plane to be a Rolle's domain if it contains (at least) one critical point of every complex polynomial P such that P(-1)=P(1). Define a Rolle's domain to be minimal if no proper subset is a Rolle's domain. In…

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

We investigate the boundedness of oscillating singular integrals on Lie groups of polynomial growth in order to extend the classical oscillating conditions due to Fefferman and Stein for the boundedness of oscillating convolution operators.…

Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Using the KKM technique, we establish some existence results for variational-hemivariational inequalities involving monotone set valued mappings on bounded, closed and convex subsets in reflexive Banach spaces. We also derive several…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

Let $(K,\nu)$ be an arbitrary-rank valued field, $R_\nu$ its valuation ring, $K(\alpha)/K$ a separable finite field extension generated over $K$ by a root of a monic irreducible polynomial $f\in R_\nu[X]$. We give necessary and sufficient…

In this paper, we establish bounds for the eigenvalues of matrix polynomials. Specifically, we find different generalizations of the Enestrom-Kakeya Theorem for matrix polynomials.

We develop an extension of valuations theorem for suitable extensions of idempotent semirings. As an application, we give a new proof for the classical case of fields. Along the way, we develop characteristic one analogues of some central…

Let $V$ be a valuation ring of a global field $K$. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $V$, that is, an element of $\text{Int}(V) = \{ f \in K[X] \mid…

We provide upper bounds for the size of subsets of finite fields lacking the polynomial progression $$ x, x+y, ..., x+(m-1)y, x+y^m, ..., x+y^{m+k-1}.$$ These are the first known upper bounds in the polynomial Szemer\'{e}di theorem for the…

It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this paper we investigate this problem in graph classes defined by forbidding an induced subgraph. In…

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…

The problem of low-rank matrix estimation recently received a lot of attention due to challenging applications. A lot of work has been done on rank-penalized methods and convex relaxation, both on the theoretical and applied sides. However,…