Related papers: A formula for the algebraic degree in semidefinite…
In this note, we use a natural desingularization of the conormal variety of the variety of n x n symmetric matrices of rank at most r to find a general formula for the algebraic degree in semidefinite programming.
In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We calculate the degree of the algebra of covariants $\mathcal{C}_d$ for binary $d$-form. Also, for the degree we obtain its integral representation and asymptotic behavior.
We provide a closed formula for the degree of $\text{SO}(n)$ over an algebraically closed field of characteristic zero. In addition, we describe symbolic and numerical techniques which can also be used to compute the degree of…
We show that semi-infinite cohomology of a finite dimensional graded algebra (satisfying some additional requirements) are a particular case of a general categorical construction. The motivating example is provided by small quantum groups…
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…
In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and…
This paper generalizes a result of Lynn on the "degree" of an equivariant cohomology ring $H^*_G(X)$. The degree of a graded module is a certain coefficient of its Poincar\'{e} series, and is closely related to multiplicity. In the present…
In this paper we present several formulae for computing the partial degrees of the defining polynomial of the offset curve to an irreducible affine plane curve given implicitly, and we see how these formulae particularize to the case of…
We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue. We also extend the equality cases of a primal-dual inequality involving the…
We study some elementary properties of the quantum enveloping algebra associated to a parabolic subalgebra $\mathfrak{p}$ of a semisimple Lie algebra $\mathfrak{g}$. In particular we prove an explicit formula for the degree of this algebra,…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
We describe a general setting for the definition of semi-infinite cohomology of finite dimensional algebras, and provide its categorical interpretation. We apply this interpretation to compute semi-infinite cohomology of some modules over…
We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from…
We describe an explicit semi-algebraic partition for the complement of a real hyperplane arrangement such that each piece is contractible and so that the pieces form a basis of Borel-Moore homology. We also give an explicit correspondence…
These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics. This version is an update June 2010.
We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
We present an algorithm for approximating semidefinite programs with running time that is sublinear in the number of entries in the semidefinite instance. We also present lower bounds that show our algorithm to have a nearly optimal running…