English
Related papers

Related papers: Determinantal Representations and the Hermite Matr…

200 papers

In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…

Number Theory · Mathematics 2021-08-12 Dae san Kim , Taekyun Kim

The relationship between nonnegative polynomials and sums of squares is one of the central questions in real algebraic geometry. A modern approach is to look at nonnegative polynomials and sums of squares on a real variety. We survey the…

Algebraic Geometry · Mathematics 2021-04-16 Grigoriy Blekherman , Rainer Sinn , Gregory G. Smith , Mauricio Velasco

We give a bound on the number of isolated, essential singularities of determinantal quartic surfaces in 3-space. We also provide examples of different configurations of real singularities on quartic surfaces with a definite Hermitian…

Algebraic Geometry · Mathematics 2020-07-03 Martin Helsø

We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…

Algebraic Geometry · Mathematics 2020-02-12 Justin Chen , Papri Dey

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é

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…

Combinatorics · Mathematics 2007-05-23 J. M. Brunat , C. Krattenthaler , A. Lascoux , A. Montes

We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…

Combinatorics · Mathematics 2012-08-30 Arvind Ayyer

Can a smooth plane cubic be defined by the determinant of a square matrix with entries in linear forms in three variables? If we can, we say that it admits a linear determinantal representation. In this paper, we investigate linear…

Number Theory · Mathematics 2017-02-28 Yasuhiro Ishitsuka

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

Discrete Mathematics · Computer Science 2018-01-08 Ranveer Singh , R. B. Bapat

In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…

Algebraic Geometry · Mathematics 2026-02-17 Vladislav Pokidkin

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

Probability · Mathematics 2022-05-23 Patryk Pagacz , Michał Wojtylak

In this chapter we present the sums of Hermitian squares approach to noncommutative polynomial optimization problems. This is an extension of the sums of squares approach for polynomial optimization arising from real algebraic geometry. We…

Optimization and Control · Mathematics 2021-09-03 Abhishek Bhardwaj , Igor Klep , Victor Magron

A smooth curve in the real projective plane is hyperbolic if its ovals are maximally nested. By the Helton-Vinnikov Theorem, any such curve admits a definite symmetric determinantal representation. We use polynomial homotopy continuation to…

Algebraic Geometry · Mathematics 2016-07-05 Anton Leykin , Daniel Plaumann

A form in a polynomial ring over a field is said to be homaloidal if its polar map is a Cremona map, i.e., if the rational map defined by the partial derivatives of the form has an inverse rational map. The object of this work is the search…

Commutative Algebra · Mathematics 2014-09-16 Maral Mostafazadehfard , Aron Simis

In this article we study determinantal representations of adjoint hypersurfaces of polytopes. We prove that adjoint polynomials of all polygons can be represented as determinants of tridiagonal symmetric matrices of linear forms with the…

Algebraic Geometry · Mathematics 2026-01-30 Clemens Brüser , Mario Kummer , Dmitrii Pavlov

An arbitrary Mueller matrix can be decomposed into a sum of up to four deterministic Mueller-Jones matrices, with strengths given by the eigenvalues of an associated Hermitian matrix. A geometrical representation of the eigenvalues in terms…

Optics · Physics 2015-10-06 Colin J. R. Sheppard

The continuous big $q$-Hermite polynomials are shown to realize a basis for a representation space of an extended $q$-oscillator algebra. An expansion formula is algebraically derived using this model.

Classical Analysis and ODEs · Mathematics 2016-09-06 Roberto Floreanini , Jean LeTourneux , Luc Vinet

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

Numerical Analysis · Mathematics 2015-10-06 Jiawang Nie

Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…

Optimization and Control · Mathematics 2011-03-30 Jiawang Nie