English
Related papers

Related papers: Generic symmetric matrix polynomials with bounded …

200 papers

In this note we show that the complete symmetric polynomials are dual generators of compressed artinian Gorenstein algebras satisfying the Strong Lefschetz Property. This is the first example of an explicit dual form with these properties.…

Algebraic Geometry · Mathematics 2022-03-09 M. Boij , J. Migliore , R. M. Miró-Roig , U. Nagel

Motivated by the conjectures formulated in 2003 by Tun\c{c}el et al., we study interlacing properties of the eigenvalues of $A\otimes B + B\otimes A$ for pairs of $n$-by-$n$ matrices $A, B$. We prove that for every pair of symmetric…

Optimization and Control · Mathematics 2020-08-11 Nargiz Kalantarova , Levent Tunçel

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…

Combinatorics · Mathematics 2024-10-04 Wei Wang , Wei Wang , Fuhai Zhu

A notion of open rank, related with generic power sum decompositions of forms, has recently been introduced in the literature. The main result here is that the maximum open rank for plane quartics is eight. In particular, this gives the…

Algebraic Geometry · Mathematics 2018-04-10 Edoardo Ballico , Alessandro De Paris

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Algebraic Geometry · Mathematics 2024-10-24 Antoine Etesse

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

Combinatorics · Mathematics 2021-01-22 Willem H. Haemers , Leila Parsaei Majd

We design two deterministic polynomial time algorithms for variants of a problem introduced by Edmonds in 1967: determine the rank of a matrix M whose entries are homogeneous linear polynomials over the integers. Given a linear subspace B…

Computational Complexity · Computer Science 2014-06-27 Gábor Ivanyos , Marek Karpinski , Youming Qiao , Miklos Santha

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

Statistics Theory · Mathematics 2019-09-24 Daniel Irving Bernstein , Grigoriy Blekherman , Rainer Sinn

This article introduces a finite piecewise Euclidean cell complex homeomorphic to the space of monic centered complex polynomials of degree $d$ whose critical values lie in a fixed closed rectangular region. We call this the branched…

Geometric Topology · Mathematics 2024-10-07 Michael Dougherty , Jon McCammond

In the framework of Polynomial Eigenvalue Problems, most of the matrix polynomials arising in applications are structured polynomials (namely (skew-)symmetric, (skew-)Hermitian, (anti-)palindromic, or alternating). The standard way to solve…

Numerical Analysis · Mathematics 2020-10-14 Fernando De Terán , Carla Hernando , Javier Pérez

We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…

Metric Geometry · Mathematics 2007-05-23 Julian Pfeifle

Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…

Combinatorics · Mathematics 2010-11-01 Charles F. Dunkl

In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…

Rings and Algebras · Mathematics 2011-12-07 Adam Chapman

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

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…

Algebraic Geometry · Mathematics 2025-09-01 Cosimo Flavi , Joachim Jelisiejew , Mateusz Michałek

We study graded symmetric algebras, which are the symmetric monoids in the monoidal category of vector spaces graded by a group. We show that a finite dimensional graded semisimple algebra is graded symmetric. The center of a symmetric…

Rings and Algebras · Mathematics 2017-07-24 Sorin Dascalescu , Constantin Nastasescu , Laura Nastasescu

Let $\operatorname{r_{max}}(n,d)$ be the maximum Waring rank for the set of all homogeneous polynomials of degree $d>0$ in $n$ indeterminates with coefficients in an algebraically closed field of characteristic zero. To our knowledge, when…

Algebraic Geometry · Mathematics 2016-06-10 Alessandro De Paris

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Rings and Algebras · Mathematics 2025-01-07 Alina G. Goutor

Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials, via the definition of convexity, its first order characterization, and its second order…

Optimization and Control · Mathematics 2013-12-31 Amir Ali Ahmadi , Pablo A. Parrilo

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…

Combinatorics · Mathematics 2020-05-13 G. Longobardi , G. Lunardon , R. Trombetti , Y. Zhou