Related papers: A formula for the algebraic degree in semidefinite…

There is presented an algorithm for computing the topological degree for a large class of polynomial mappings. As an application there is given an effective algebraic formula for the intersection number of a polynomial immersion M --> R^2m,…

This is a survey article on real algebra and geometry, and in particular on its recent applications in optimization and convexity. We first introduce basic notions and results from the classical theory. We then explain how these relate to…

We consider the cotriple resolution of algebras over operads in differential graded modules. We focus, to be more precise, on the example of algebras over the differential graded Barratt-Eccles operad and on the example of commutative…

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.

The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate…

For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…

We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…

For Lie algebras whose Poisson semi-center is a polynomial ring we give a bound for the sum of the degrees of the generating semi-invariants. This bound was previously known in many special cases.

This paper is a review of concepts from graded commutative algebra with specific attention given to length and multiplicity. The author's motivation for this paper comes from the study of equivariant cohomology in algebraic topology where…

We are interested in formulas for the number of elements in certain classes of numerical semigroups

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

The residual finite-dimensionality of a $\mathrm{C}^*$-algebra is known to be encoded in a topological property of its space of representations, stating that finite-dimensional representations should be dense therein. We extend this…

Our goal is to define an algebraic language for reasoning about non-deterministic computations. Towards this goal, we introduce an algebra of string-to-string transductions. Specifically, it is an algebra of partial functions on words over…

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

We compute the generic degrees of the Ariki--Koike algebras by first constructing a basis of matrix units in the semisimple case. As a consequence, we also obtain an explicit isomorphism from any semisimple Ariki--Koike algebra to the group…

The purpose of this article is to show how one might compute the \'etale cohomology groups $H^p_{\acute{e}t}(X,G_m)$ in degrees $p=0$, $1$ and $2$ of a toric variety $X$ with coefficients in the sheaf of units. The method is to reduce the…