Related papers: Algebraic approximation preserving dimension
Two subanalytic subsets of R^n are called s-equivalent at a common point P if the Hausdorff distance between their intersections with the sphere centered at P of radius r vanishes of order greater than s when r tends to 0. In this paper we…
Let $X$ be an analytic subset of $U\times C^n$ of pure dimension $k$ such that the projection of $X$ onto $U$ is a proper mapping, where $U$ is a Runge domain in $C^k$. We show that $X$ can be approximated by algebraic sets.
We show that semiprojectivity of a C*-algebra is preserved when passing to C*-subalgebras of finite codimension. In particular, any pullback of two semiprojective C*-algebras over a finite-dimensional C*-algebra is again semiprojective.
We introduce the notion of radical preservation and prove that a radical-preserving homomorphism of left artinian rings of finite projective dimension with superfluous kernel reflects the finiteness of the little finitistic, big finitistic…
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.
It was already known that a p-adic, locally Lipschitz continuous semi-algebraic function is piecewise Lipschitz continuous, where the pieces can be taken semi-algebraic. We prove that if the function has locally Lipschitz constant 1, then…
We prove that every local derivation on a complex semisimple finite-dimensional Leibniz algebra is a derivation.
We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global…
We prove that the subdifferential of any semi-algebraic extended-real-valued function on $\R^n$ has $n$-dimensional graph. We discuss consequences for generic semi-algebraic optimization problems.
We show that the dimension of the Cuntz semigroup of a C*-algebra is determined by the dimensions of the Cuntz semigroups of its separable sub-C*-algebras. This allows us to remove separability assumptions from previous results on the…
We prove that the Cuntz-Pimsner algebra associated to any surjective aperiodic one-sided subshift with finitely many left special elements has finite nuclear dimension, which is especially the case for every surjective aperiodic subshift…
Over the function field of a complex algebraic curve, strong approximation off a non-empty finite set of places holds for the complement of a codimension $2$ closed subset in a homogeneous space under a semisimple algebraic group, and for…
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…
In this paper we deal with a best approximation of a vector with respect to a closed semi-algebraic set $C$ in the space $\mathbb{R}^n$ endowed with a semi-algebraic norm $\nu$. Under additional assumptions on $\nu$ we prove…
The residual finite-dimensionality of a $\mathrm{C}^*$-algebra is known to be encoded in a topological property of its space of representations, stating that finite-dimensional representations should be dense therein. We extend this…
Examples exist of extended-real-valued closed functions on ${\bf R}^n$ whose subdifferentials (in the standard, limiting sense) have large graphs. By contrast, if such a function is semi-algebraic, then its subdifferential graph must have…
We prove the following instance of a conjecture stated in arXiv:1103.4770. Let $G$ be an abelian semialgebraic group over a real closed field $R$ and let $X$ be a semialgebraic subset of $G$. Then the group generated by $X$ contains a…
We show that a subset of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ is well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$ (denoting the complexities of the linear and quadratic part,…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our…