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

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…

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 give general criteria under which the limit of a system of tropicalizations of a scheme over a nonarchimedean field is homeomorphic to the analytification of the scheme. As an application, we show that the analytification of an arbitrary…

We determine the additional structure which arises on the classical limit of a DQ-algebroid.

In this paper, we are interested in solvable complete Lie algebras, over the field $\K=\R$ or $\mathbb{C}$, which admit a symplectic structure. Specifically, important classes are studied, and a description of complete Lie Algebra with the…

We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by…

We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…

In this paper we study a $k$-dimensional analytic subvariety of the complex algebraic torus. We show that if its logarithmic limit set is a finite rational $(k-1)$-dimensional spherical polyhedron, then each irreducible component of the…

The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…

In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical…

We give lower bounds in terms of~$n,$ for the number of limit cycles of polynomial vector fields of degree~$n,$ having any prescribed invariant algebraic curve. By applying them when the ovals of this curve are also algebraic limit cycles…

We establish that the sequences formed by logarithms and by "fractional" powers of integers, as well as the sequence of prime numbers, are non-holonomic, thereby answering three open problems of Gerhold [Electronic Journal of Combinatorics…

We prove that every automorphism of the restricted root system of a real semisimple Lie algebra -- when defined properly -- can be lifted to an automorphism of that Lie algebra. In particular, this can be applied to automorphisms of the…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

The growth of tropical geometry has generated significant interest in the tropical semiring in the past decade. However, there are other semirings in tropical algebra that provide more information, such as the symmetrized (max, +),…

We prove a lower bound of $\Omega(n^2/\log^2 n)$ on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial $f(x_1, \ldots, x_n)$. Our approach expands and improves upon a result of Raz,…

For a finite set of homogeneous locally nilpotent derivations of the algebra of polynomials in several variables, a finite dimensionality criterion for the Lie algebra generated by these derivations is known. Also the structure of the…

We introduce the Boolean algebra of d-semialgebraic (more generally, d-definable) sets and prove that its Stone space is naturally isomorphic to the Ellis enveloping semigroup of the Stone space of the Boolean algebra of semialgebraic…

We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…