English
Related papers

Related papers: Circular Free Spectrahedra

200 papers

In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…

Combinatorics · Mathematics 2007-05-23 V. I. Danilov , G. A. Koshevoy

The independence number of a square matrix $A$, denoted by $\alpha(A)$, is the maximum order of its principal zero submatrices. Let $S_n^{+}$ be the set of $n\times n$ nonnegative symmetric matrices with zero trace. Denote by $J_n$ the…

Combinatorics · Mathematics 2022-05-11 Yanan Hu , Zejun Huang

A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M.…

Group Theory · Mathematics 2011-05-23 Scott Brown , Cheryl E. Praeger , Michael Giudici

Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…

Algebraic Geometry · Mathematics 2018-05-03 Lynn Chua , Daniel Plaumann , Rainer Sinn , Cynthia Vinzant

This article concerns the question: which subsets of ${\mathbb R}^m$ can be represented with Linear Matrix Inequalities, LMIs? This gives some perspective on the scope and limitations of one of the most powerful techniques commonly used in…

Optimization and Control · Mathematics 2007-05-23 J. William Helton , Victor Vinnikov

Spectrahedra are affine-linear sections of the cone $\mathcal{P}_n$ of positive semidefinite symmetric $n\times n$-matrices. We consider random spectrahedra that are obtained by intersecting~$\mathcal{P}_n$ with the affine-linear space…

Algebraic Geometry · Mathematics 2019-09-18 Paul Breiding , Khazhgali Kozhasov , Antonio Lerario

We study the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$ on $m$-tuples of $n \times n$ matrices with entries in an infinite field $K$. We show that invariants of degree $n^2- n$ define the null cone. Consequently,…

Representation Theory · Mathematics 2015-12-11 Harm Derksen , Visu Makam

We define a monodromy, directly from the spectrum of small non-selfadjoint perturbations of a selfadjoint semiclassical operator with two degrees of freedom, which is classically integrable. It is a combinatorial invariant that obstructs…

Analysis of PDEs · Mathematics 2017-01-10 Quang Sang Phan

Let $p$ be a real zero polynomial in $n$ variables. Then $p$ defines a rigidly convex set $C(p)$. We construct a linear matrix inequality of size $n+1$ in the same $n$ variables that depends only on the cubic part of $p$ and defines a…

Optimization and Control · Mathematics 2023-07-26 Markus Schweighofer

A binary Steinhaus triangle is a triangle of zeroes and ones that points down and with the same local rule as the Pascal triangle modulo 2. A binary Steinhaus triangle is said to be rotationally symmetric, horizontally symmetric or…

Discrete Mathematics · Computer Science 2022-04-20 Jonathan Chappelon

Consider the ensembles of real symmetric Toeplitz matrices and real symmetric Hankel matrices whose entries are i.i.d. random variables chosen from a fixed probability distribution p of mean 0, variance 1, and finite higher moments.…

Probability · Mathematics 2014-11-14 Kirk Swanson , Steven J. Miller , Kimsy Tor , Karl Winsor

A subspace of an algebra with involution is called a Lie skew-ideal if it is closed under Lie products with skew-symmetric elements. Lie skew-ideals are classified in central simple algebras with involution (there are eight of them for…

Rings and Algebras · Mathematics 2018-04-27 Matej Bresar , Igor Klep

Symmetry arises often when learning from high dimensional data. For example, data sets consisting of point clouds, graphs, and unordered sets appear routinely in contemporary applications, and exhibit rich underlying symmetries.…

Optimization and Control · Mathematics 2025-02-06 Mateo Díaz , Dmitriy Drusvyatskiy , Jack Kendrick , Rekha R. Thomas

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Optimization and Control · Mathematics 2010-04-08 Didier Henrion

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Optimization and Control · Mathematics 2008-12-10 Didier Henrion

We study the asymptotics of sums of matricially free random variables called random pseudomatrices, and we compare it with that of random matrices with block-identical variances. For objects of both types we find the limit joint…

Operator Algebras · Mathematics 2014-07-25 Romuald Lenczewski

The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…

Condensed Matter · Physics 2009-10-22 T. Temesvari , C De Dominicis , I. Kondor

In this paper, we analyze the question of replica symmetry in the bulk for multi-partite entanglement measures in the vacuum state of two dimensional holographic CFTs. We first define a class of multi-partite local unitary invariants,…

High Energy Physics - Theory · Physics 2025-06-02 Abhijit Gadde , Jonathan Harper , Vineeth Krishna

Motivated by questions in inverse scattering theory, we develop free boundary methods in obstacle problems where both the solution and the right hand side of the equation may have varying sign. The key condition that prevents the appearance…

Analysis of PDEs · Mathematics 2025-06-30 Mikko Salo , Henrik Shahgholian

A binary matrix can be scanned by moving a fixed rectangular window (submatrix) across it, rather like examining it closely under a microscope. With each viewing, a convenient measurement is the number of 1s visible in the window, which…

Combinatorics · Mathematics 2007-05-23 A. Frosini , M. Nivat
‹ Prev 1 3 4 5 6 7 10 Next ›