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

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

Potential theory on the complement of a subset of the real axis attracts a lot of attention both in function theory and applied sciences. The paper discusses one aspect of the theory - the logarithmic capacity of closed subsets of the real…

We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…

We define the generalized logarithmic Gauss map for algebraic varieties of the complex algebraic torus of any codimension. Moreover, we describe the set of critical points of the logarithmic mapping restricted to our variety, and we show an…

We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…

In this paper we prove that for any definable subset $X\subset \mathbb{R}^{n}$ in a polynomially bounded o-minimal structure, with $dim(X)<n$, there is a finite set of regular projections (in the sense of Mostowski ). We give also a weak…

Hyperfields and systems are two algebraic frameworks which have been developed to provide a unified approach to classical and tropical structures. All hyperfields, and more generally hyperrings, can be represented by systems. Conversely, we…

A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…

This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…

We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially…

We define sets of orthogonal polynomials satisfying the additional constraint of a vanishing average. These are of interest, for example, for the study of the Hohenberg-Kohn functional for electronic or nucleonic densities and for the study…

In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the…

For the first time, we have introduced the concept of N-groups, N-semigroups, N-loops, and N-groupoids. We also define a mixed N-algebraic structure. The main aim of this book is to attract young mathematicians to this interesting field. It…

In this paper we consider the structure of $\omega$-limit sets in subshifts of Baire space. We consider both subshifts of finite type and subshifts of bounded type and we demonstrate that many classical structure theorems for $\omega$-limit…

In [5] I solved the Thom's conjecture that a proper Thom map is triangulable. In this paper I drop the properness condition in the semialgebraic case and, moreover, in the definable case in an o-minimal structure.

In a former paper the first and third authors introduced the notion of direction set for a subset of R^n, and showed that the dimension of the common direction set of two subanalytic subsets, called directional dimension, is preserved by a…

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

We give an effective estimation from above for the local {\L}ojasiewicz exponent for separation of semialgebraic sets and for a semialgebraic mapping on a closed semialgebraic set. We also give an effective estimation from below of the…

In the problem of semialgebraic range searching, we are to preprocess a set of points in $\mathbb{R}^D$ such that the subset of points inside a semialgebraic region described by $O(1)$ polynomial inequalities of degree $\Delta$ can be found…

We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…