English
Related papers

Related papers: Symmetric Determinantal Representation of Formulas…

200 papers

In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…

Representation Theory · Mathematics 2020-05-20 Joakim Arnlind

This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…

Optimization and Control · Mathematics 2008-09-22 Didier Henrion

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

Representation Theory · Mathematics 2024-10-28 Marko Čmrlec

In this paper we explore the noncommutative analogues, $\mathrm{VP}_{nc}$ and $\mathrm{VNP}_{nc}$, of Valiant's algebraic complexity classes and show some striking connections to classical formal language theory. Our main results are the…

Computational Complexity · Computer Science 2015-08-04 V. Arvind , Pushkar S Joglekar , S. Raja

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

Mathematical Physics · Physics 2015-06-26 Saugata Ghosh

We prove that the rank-one convex hull of finitely many $2\times 2$ triangular matrices is a semialgebraic set, defined by linear and quadratic polynomials. We present explicit constructions for five-point configurations and offer evidence…

Metric Geometry · Mathematics 2025-09-10 Chiara Meroni , Bogdan Raita

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

Computational Complexity · Computer Science 2020-11-04 Anna Knezevic , Greg Cohen , Marina Domanskaya

This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…

Representation Theory · Mathematics 2016-01-29 Xiaoping Xu

Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass representation. In this paper, we propose an explicit parametric…

Graphics · Computer Science 2010-08-04 Gang Xu , Guozhao Wang

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon

In this paper, we give some determinantal and permanental representations of Generalized Fibonacci Polynomials by using various Hessenberg matrices. These results are general form of determinantal and permanental representations of k…

Number Theory · Mathematics 2011-11-18 Adem Sahin , Kenan Kaygisiz

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

We study the modular representation theory of rank $3$ association schemes arising from partial geometries with parameters $(s,t,\alpha)$. First, we obtain an explicit closed formula for the Frame number of the point scheme in terms of the…

Combinatorics · Mathematics 2025-12-09 Osamu Shimabukuro

We study finite-dimensional representations of hyper loop algebras over non-algebraically closed fields. The main results concern the classification of the irreducible representations, the construction of the Weyl modules, base change,…

Representation Theory · Mathematics 2012-01-04 Dijana Jakelic , Adriano Moura

We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…

Combinatorics · Mathematics 2010-07-06 Milan Janjic

The compact set of homogeneous quadratic polynomials in $n$ real variables with modulus bounded by 1 on the unit sphere $S^{n-1}$ is trivially semi-definite representable. The compact set of homogeneous ternary quartics with modulus bounded…

Optimization and Control · Mathematics 2021-03-25 Roland Hildebrand

A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper…

Optimization and Control · Mathematics 2008-07-01 Jiawang Nie

We introduce the notion of partial representation of a weak Hopf algebra. We present the universal algebra $H_{par}^w$, which factorizes these partial representations by algebra morphisms. Also, it is shown that $\Hp$ is isomorphic to a…

Quantum Algebra · Mathematics 2024-12-19 Felipe Castro , Glauber Quadros , Thaísa Tamusiunas

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter