Related papers: Connectivity in Symmetric Semi-Algebraic Sets

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

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…

Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…

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…

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

We develop a structure theory of connected solvable spherical subgroups in semisimple algebraic groups. Based on this theory, we obtain an explicit classification of all such subgroups up to conjugation.

We study the connectedness structure of the proper Pareto solution sets, the Pareto solution sets, the weak Pareto solution sets of polynomial vector variational inequalities, as well as the connectedness structure of the efficient solution…

Since its introduction by Symons, the semigroup of maps with restricted range has been studied in the context of transformations on a set, or of linear maps on a vector space. Sets and vector spaces being particular examples of independence…

The question of how to certify the non-negativity of a polynomial function lies at the heart of Real Algebra and it also has important applications to Optimization. In the setting of symmetric polynomials Timofte provided a useful way of…

We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for…

The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…

In this paper, we are concerned with the problem of determining the existence of multiple equilibria in economic models. We propose a general and complete approach for identifying multiplicities of equilibria in semi-algebraic economies,…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…

Consensus halving refers to the problem of dividing a resource into two parts so that every agent values both parts equally. Prior work has shown that when the resource is represented by an interval, a consensus halving with at most $n$…

A standard question in real algebraic geometry is to compute the number of connected components of a real algebraic variety in affine space. By adapting an approach for determining connectivity in complements of real hypersurfaces by Hong,…

A numerical semigroup is a subset of N containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of…