English
Related papers

Related papers: Improved Debordering of Waring Rank

200 papers

The set ${\cal P}^{m\times n}_{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min \{m, n\}-1$, we show that ${\cal…

Numerical Analysis · Mathematics 2016-12-14 Andrii Dmytryshyn , Froilán M. Dopico

We show that if $w$ is a multilinear commutator word and $G$ a finite group in which every metanilpotent subgroup generated by $w$-values is of rank at most $r$, then the rank of the verbal subgroup $w(G)$ is bounded in terms of $r$ and $w$…

Group Theory · Mathematics 2021-07-01 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

Recently Marcus, Spielman and Srivastava proved Weaver's ${\rm{KS}}_r$ conjecture, which gives a positive solution to the Kadison-Singer problem. Cohen and Br\"and\'en independently extended this result to obtain the arbitrary-rank version…

Combinatorics · Mathematics 2021-06-18 Zhiqiang Xu , Zili Xu , Ziheng Zhu

In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…

Symbolic Computation · Computer Science 2016-02-01 Bruno Grenet

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

Number Theory · Mathematics 2021-11-18 Rainer Dietmann , Alina Ostafe , Igor E. Shparlinski

We give several new lower bounds on size of homogeneous non-commutative circuits. We present an explicit homogeneous bivariate polynomial of degree $d$ which requires homogeneous non-commutative circuit of size $\Omega(d/\log d)$. For an…

Computational Complexity · Computer Science 2023-01-05 Prerona Chatterjee , Pavel Hrubeš

Using Green's hyperplane restriction theorem, we prove that the rank of a Hermitian form on the space of holomorphic polynomials is bounded by a constant depending only on the maximum rank of the form restricted to affine manifolds. As an…

Complex Variables · Mathematics 2014-05-08 Dusty Grundmeier , Jiri Lebl , Liz Vivas

In this paper we associate to each multivariate polynomial $f$ that is homogeneous relative to a subset of its variables a series of polynomial families $P_\lambda (f)$ of $m$-tuples of homogeneous polynomials of equal degree such that the…

Computational Complexity · Computer Science 2017-08-03 Hông Vân Lê

Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the…

Optimization and Control · Mathematics 2025-10-03 Ruoning Chen , Defeng Sun , Liping Zhang

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

Combinatorics · Mathematics 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

Commutative Algebra · Mathematics 2024-03-07 Amichai Lampert , Tamar Ziegler

In this paper we prove that if $\Omega\in\mathbb{R}^n$ is a bounded John domain, the following weighted Poincare-type inequality holds: $$ \inf_{a\in \mathbb{R}}\| (f(x)-a) w_1(x) \|_{L^q(\Omega)} \le C \|\nabla f(x) d(x)^\alpha w_2(x)…

Classical Analysis and ODEs · Mathematics 2015-05-13 Irene Drelichman , Ricardo G. Durán

Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…

Numerical Analysis · Mathematics 2025-10-03 Nicole Spillane , Daniel B Szyld

Let $f: \{0,1\}^n \to \{0, 1\}$ be a boolean function, and let $f_\land (x, y) = f(x \land y)$ denote the AND-function of $f$, where $x \land y$ denotes bit-wise AND. We study the deterministic communication complexity of $f_\land$ and show…

Computational Complexity · Computer Science 2020-10-23 Alexander Knop , Shachar Lovett , Sam McGuire , Weiqiang Yuan

Say that A is a Hadamard factorization of the identity I_n of size n if the entrywise product of A and the transpose of A is I_n. It can be easily seen that the rank of any Hadamard factorization of the identity must be at least sqrt{n}.…

Computational Complexity · Computer Science 2013-10-29 Aya Hamed , Troy Lee

We define upper bound and lower bounds for order-preserving homogeneous of degree one maps on a proper closed cone in $\R^n$ in terms of the cone spectral radius. We also define weak upper and lower bounds for these maps. For a proper…

Dynamical Systems · Mathematics 2012-06-01 Philip Chodrow , Cole Franks , Brian Lins

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

Combinatorics · Mathematics 2025-10-30 Christof Beierle , Tim Beyne

We improve the bound of the $g$-invariant of the ring of integers of a totally real number field, where the $g$-invariant $g(r)$ is the smallest number of squares of linear forms in $r$ variables that is required to represent all the…

Number Theory · Mathematics 2024-11-01 Jakub Krásenský , Pavlo Yatsyna

We demonstrate counterexamples to Wilmshurst's conjecture on the valence of harmonic polynomials in the plane, and we conjecture a bound that is linear in the analytic degree for each fixed anti-analytic degree. Then we initiate a…

Complex Variables · Mathematics 2013-08-30 Seung-Yeop Lee , Antonio Lerario , Erik Lundberg

Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected…

Combinatorics · Mathematics 2021-09-28 Uroš Čibej , Aaron Li , István Miklós , Sohaib Nasir , Varun Srikanth