English
Related papers

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

200 papers

We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…

Representation Theory · Mathematics 2010-09-06 Raul A. Ferraz , Edgar G. Goodaire , Cesar Polcino Milies

We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density.

Number Theory · Mathematics 2023-01-09 Sarah Peluse , Sean Prendiville

We introduce the notion of quasi-log complex analytic spaces and establish various fundamental properties. Moreover, we prove that a semi-log canonical pair naturally has a quasi-log complex analytic space structure. This paper is part of…

Algebraic Geometry · Mathematics 2025-02-04 Osamu Fujino

A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…

Algebraic Geometry · Mathematics 2020-11-16 Hoon Hong , James Rohal , Mohab Safey El Din , Eric Schost

This thesis studies arithmetic of linear algebraic groups. It involves studying the properties of linear algebraic groups defined over global fields, local fields and finite fields, or more generally the study of the linear algebraic groups…

Group Theory · Mathematics 2007-05-23 Shripad M. Garge

We study a reduct L\ast of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the L\ast-definable subsets of K coincide with the semi-algebraic…

Logic · Mathematics 2012-05-21 Eva Leenknegt

We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…

Commutative Algebra · Mathematics 2020-02-21 Fuensanta Aroca , Julie Decaup , Guillaume Rond

In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…

General Mathematics · Mathematics 2007-05-23 Frank Swenton

In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…

Computational Complexity · Computer Science 2015-11-10 V. Arvind , S. Raja

We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…

Number Theory · Mathematics 2007-05-23 Vinay Deolalikar

We prove that each semialgebraic subset of $\R^n$ of positive codimension can be locally approximated of any order by means of an algebraic set of the same dimension. As a consequence of previous results, algebraic approximation preserving…

Algebraic Geometry · Mathematics 2014-09-24 Massimo Ferrarotti , Elisabetta Fortuna , Leslie Wilson

We construct examples of complex algebraic surfaces not admitting normal embeddings (in the sense of semialgebraic or subanalytic sets) with image a complex algebraic surface.

Algebraic Geometry · Mathematics 2011-07-29 Lev Birbrair , Alexandre Fernandes , Walter D Neumann

Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…

Logic · Mathematics 2023-03-07 Mariana Floricica Calin , Cristina Flaut , Dana Piciu

Cluckers and Lipshitz have shown that real closed fields equipped with real analytic structure are o-minimal. This generalizes the well-known subanalytic structure $\mathbb{R}_{\mathrm{an}}$ on the real numbers. We extend this line of…

Logic · Mathematics 2024-04-17 Kien Huu Nguyen , Mathias Stout , Floris Vermeulen

We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…

Rings and Algebras · Mathematics 2013-10-02 Paolo Faccin , Willem A. de Graaf

We consider the expansion of the real field by the group of rational points of an elliptic curve over the rational numbers. We prove a completeness result, followed by a quantifier elimination result. Moreover we show that open sets…

Logic · Mathematics 2010-12-01 Ayhan Gunaydin , Philipp Hieronymi

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

Optimization and Control · Mathematics 2017-08-01 Jiawang Nie , Jinling Zhao

We complete the details of a theory outlined by Kontsevich and Soibelman that associates to a semi-algebraic set a certain graded commutative differential algebra of "semi-algebraic differential forms" in a functorial way. This algebra…

Algebraic Topology · Mathematics 2014-10-01 Robert Hardt , Pascal Lambrechts , Victor Tourtchine , Ismar Volic

We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.

Logic · Mathematics 2026-05-12 Leonardo N. Coregliano , Maryanthe Malliaris

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

Symbolic Computation · Computer Science 2018-06-22 Cordian Riener , Mohab Safey El Din