Related papers: Logarithmic limit sets of real semi-algebraic sets

This paper is concerned with the limit cycles for planar semi-quasi-homogeneous polynomial systems. We give some explicit criteria for the nonexistence and existence of periodic orbits. Let $N=N(p,q,m,n)$ be the maximum number of limit…

We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…

We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…

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…

Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…

Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…

A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…

Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…

Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

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…

In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or…

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

Linear forms in logarithms over connected commutative algebraic groups over the algebraic numbers field have been studied widely. However, the theory of linear forms in logarithms over noncommutative algebraic groups have not been developed…

A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…

Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…

We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…