English
Related papers

Related papers: Equations for lower bounds on border rank

200 papers

We use wavelets of tensor product type to obtain the boundedness of bilinear multiplier operators on $\mathbb R^n\times \mathbb R^n$ associated with H\"ormander multipliers on $\mathbb R^{2n}$ with minimal smoothness. We focus on the local…

Classical Analysis and ODEs · Mathematics 2016-07-12 Loukas Grafakos , Danqing He , Petr Honzík

We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer…

Symbolic Computation · Computer Science 2007-05-23 Claude-Pierre Jeannerod , Gilles Villard

Let $A$ be an $(m \times n)$ integral matrix, and let $P=\{ x : A x \leq b\}$ be an $n$-dimensional polytope. The width of $P$ is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus\{0\} :\: max_{x \in P} x^\top u - min_{x \in P} x^\top v…

Computational Geometry · Computer Science 2022-11-30 Dmitry Gribanov , Sergey Veselov

For odd n, I write down tensors in C^n\otimes C^n\otimes C^n of border rank 2n-1, showing the non-triviality of the Young-flattening equations of Landsberg-Ottaviani. I also study the border rank of the tensors of Alexeev et. al., showing…

Computational Complexity · Computer Science 2013-08-08 J. M. Landsberg

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Commutative Algebra · Mathematics 2023-09-18 Ada Boralevi , Jasper van Doornmalen , Jan Draisma , Michiel E. Hochstenbach , Bor Plestenjak

In their 2008 paper Gau and Wu conjectured that the numerical range of a 4-by-4 nilpotent matrix has at most two flat portions on its boundary. We prove this conjecture, establishing along the way some additional facts of independent…

Functional Analysis · Mathematics 2015-12-01 Erin Militzer , Linda J. Patton , Ilya M. Spitkovsky , Ming-Cheng Tsai

We consider a generic family of polynomial maps $f:=(f_1,f_2):\mathbb{C}^2\rightarrow\mathbb{C}^2$ with given supports of polynomials, and degree $ d(f):=\max (deg f_1, deg f_2)$. We show that the (non-) properness of maps $f$ in this…

Algebraic Geometry · Mathematics 2021-03-19 Boulos El Hilany

This paper studies Symmetric Determinantal Representations (SDR) in characteristic 2, that is the representation of a multivariate polynomial P by a symmetric matrix M such that P=det(M), and where each entry of M is either a constant or a…

Computational Complexity · Computer Science 2013-06-06 Bruno Grenet , Thierry Monteil , Stéphan Thomassé

In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…

Numerical Analysis · Computer Science 2017-09-08 Przemysław Gospodarczyk , Paweł Woźny

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela

This paper considers overdetermined boundary problems. Firstly, we give a proof to the Payne-Schaefer conjecture about an overdetermined problem of sixth order in the two dimensional case and under an additional condition for the case of…

Analysis of PDEs · Mathematics 2021-10-06 Changyu Xia

This work is devoted to studying the boundedness on Lebesgue spaces of bilinear multipliers on $\R$ whose symbol is narrowly supported around a curve (in the frequency plane). We are looking for the optimal decay rate (depending on the…

Classical Analysis and ODEs · Mathematics 2011-02-09 Frederic Bernicot , Pierre Germain

A new necessary and sufficient condition for the existence of minor left prime factorizations of multivariate polynomial matrices without full row rank is presented. The key idea is to establish a relationship between a matrix and its full…

Symbolic Computation · Computer Science 2020-10-15 Dong Lu , Dingkang Wang , Fanghui Xiao

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Symbolic Computation · Computer Science 2011-11-10 Jean-Guillaume Dumas

This paper investigates the geometric properties of a special case of the two-sided system given by $2 \times 2$ tropical commuting constraints. Given a finite matrix $A \in \mathbb{R}^{2\times 2}$, the paper studies the extremals of the…

Combinatorics · Mathematics 2021-03-15 Yangxinyu Xie

In this paper, we investigate the arithmetical rank of a binomial ideal $J$. We provide lower bounds for the binomial arithmetical rank and the $J$-complete arithmetical rank of $J$. Special attention is paid to the case where $J$ is the…

Commutative Algebra · Mathematics 2017-09-19 Anargyros Katsabekis

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

Commutative Algebra · Mathematics 2007-05-23 Matthias Aschenbrenner

Formanek made the conjecture that the minimal degree of the central polynomials for the $n\times n$ matrix algebra over a field of characteristic 0 is $(n^2+3n-2)/2$ and this is true for $n\leq 3$. For $n=4$ there are examples of central…

Rings and Algebras · Mathematics 2026-01-13 Vesselin Drensky , Boyan Kostadinov

We prove that the border rank of the Kronecker square of the little Coppersmith-Winograd tensor $T_{cw,q}$ is the square of its border rank for $q > 2$ and that the border rank of its Kronecker cube is the cube of its border rank for $q >…

Computational Complexity · Computer Science 2021-12-28 Austin Conner , Fulvio Gesmundo , Joseph M. Landsberg , Emanuele Ventura

We study border varieties of sums of powers ($\underline{\mathrm{VSP}}$'s for short), recently introduced by Buczy\'nska and Buczy\'nski, parameterizing border rank decompositions of a point (e.g. of a tensor or a homogeneous polynomial)…

Algebraic Geometry · Mathematics 2024-02-15 Tomasz Mańdziuk , Emanuele Ventura