Searcharxiv⌕ Search

arXiv subjects

Saugata Basu

Publications and source records attributed to Saugata Basu.

At least 37 records · Page 2Linked to original sources

Persistent homology of semi-algebraic sets

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 algorithm is the first algorithm for this problem with singly exponential complexity, and generalizes the corresponding results for computing the Betti numbers up to dimension $\ell$ of semi-algebraic sets with no filtration present.

math.AT↗

Inferring COVID-19 Biological Pathways from Clinical Phenotypes via Topological Analysis

COVID-19 has caused thousands of deaths around the world and also resulted in a large international economic disruption. Identifying the pathways associated with this illness can help medical researchers to better understand the properties of the condition. This process can be carried out by analyzing the medical records. It is crucial to develop tools and models that can aid researchers with this process in a timely manner. However, medical records are often unstructured clinical notes, and this poses significant challenges to developing the automated systems. In this article, we propose a pipeline to aid practitioners in analyzing clinical notes and revealing the pathways associated with this disease. Our pipeline relies on topological properties and consists of three steps: 1) pre-processing the clinical notes to extract the salient concepts, 2) constructing a feature space of the patients to characterize the extracted concepts, and finally, 3) leveraging the topological properties to distill the available knowledge and visualize the result. Our experiments on a publicly available dataset of COVID-19 clinical notes testify that our pipeline can indeed extract meaningful pathways.

cs.CL↗

Topology of real multi-affine hypersurfaces and a homological stability property

Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is sharp and is independent of $n$ (as opposed to the classical bound of $d(2d -1)^{n-1}$ on the Betti numbers of hypersurfaces defined by arbitrary polynomials of degree $d$ in $\mathrm{R}^n$ due to Petrovski{\uı} and Ole{\uı}nik, Thom and Milnor). Moreover, we show there exists $c > 1$, such that given a sequence $(B_n)_{n >0}$ where $B_n$ is a closed ball in $\mathrm{R}^n$ of positive radious, there exist hypersurfaces $(V_n)_{n_>0}$ defined by symmetric multi-affine polynomials of degree $4$, such that $\sum_{i \leq 5} b_i(V_n \cap B_n) > c^n$, where $b_i(\cdot)$ denotes the $i$-th Betti number with rational coeffcients. Finally, as an application of the main result of the paper we verify a representational stability conjecture due to Basu and Riener on the cohomology modules of symmetric real algebraic sets for a new and much larger class of symmetric real algebraic sets than known before.

math.AG↗

On the central path of semidefinite optimization: Degree and worst-case convergence rate

In this paper, we investigate the complexity of the central path of semidefinite optimization through the lens of real algebraic geometry. To that end, we propose an algorithm to compute real univariate representations describing the central path and its limit point, where the limit point is described by taking the limit of central solutions, as bounded points in the field of algebraic Puiseux series. As a result, we derive an upper bound $2^{O(m+n^2)}$ on the degree of the Zariski closure of the central path, when $μ$ is sufficiently small, and for the complexity of describing the limit point, where $m$ and $n$ denote the number of affine constraints and size of the symmetric matrix, respectively. Furthermore, by the application of the quantifier elimination to the real univariate representations, we provide a lower bound $1/γ$, with $γ=2^{O(m+n^2)}$, on the convergence rate of the central path.

math.AG↗

A stationary set method for estimating oscillatory integrals

We propose a new method of estimating oscillatory integrals, which we call a stationary set method. We use it to obtain the sharp convergence exponents of Tarry's problems in dimension two for every degree $k\ge 2$. As a consequence, we obtain sharp Fourier extension estimates for a family of monomial surfaces.

math.CA↗

Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets

Let $\mathrm{R}$ be a real closed field. We prove that for each fixed $\ell, d \geq 0$, there exists an algorithm that takes as input a quantifier-free first order formula $Φ$ with atoms $P=0, P > 0, P < 0 \text{ with } P \in \mathcal{P} \subset \mathrm{D}[X_1,\ldots,X_k]^{\mathfrak{S}_k}_{\leq d}$, where $\mathrm{D}$ is an ordered domain contained in $\mathrm{R}$, and computes the ranks of the first $(\ell+1)$ cohomology groups, of the symmetric semi-algebraic set defined by $Φ$. The complexity of this algorithm (measured by the number of arithmetic operations in $\mathrm{D}$) is bounded by a \emph{polynomial} in $k$ and $\mathrm{card}(\mathcal{P})$ (for fixed $d$ and $\ell$). This result contrasts with the $\mathbf{PSPACE}$-hardness of the problem of computing just the zero-th Betti number (i.e. the number of semi-algebraically connected components) in the general case for $d \geq 2$ (taking the ordered domain $\mathrm{D}$ to be equal to $\mathbb{Z}$). The above algorithmic result is built on new representation theoretic results on the cohomology of symmetric semi-algebraic sets. We prove that the Specht modules corresponding to partitions having long lengths cannot occur with positive multiplicity in the isotypic decompositions of low dimensional cohomology modules of closed semi-algebraic sets defined by symmetric polynomials having small degrees. This result generalizes prior results obtained by the authors giving restrictions on such partitions in terms of their ranks, and is the key technical tool in the design of the algorithm mentioned in the previous paragraph.

math.AG↗

Quantitative Curve Selection Lemma

We prove a quantitative version of the curve selection lemma. Denoting by $s,d,k$ a bound on the number, the degree and the number of variables of the polynomials describing a semi-algebraic set $S$ and a point $x$ in $\bar S$, we find a semi-algebraic path starting at $x$ and entering in $S$ with a description of degree $(O(d)^{3k+3},O(d)^{k})$ (using a precise definition of the description of a semi-algebraic path and its degree given in the paper). As a consequence, we prove that there exists a semi-algebraic path starting at $x$ and entering in $S$, such that the degree of the Zariski closure of the image of this path is bounded by $O(d)^{4k+3}$, improving a result of Jelonek and Kurdyka. We also give an algorithm for describing the real isolated points of $S$ whose complexity is bounded by $s^{2 k+1}d^{O(k)}$ improving a result of Le, Safey el Din, and de Wolff.

math.AG↗

Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set

Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a field $\mathbb{F}$, of any given semi-algebraic set $S \subset \mathrm{R}^k$ defined by a closed formula. The complexity of the algorithm is bounded singly exponentially. It is not known how to compute such a basis for the higher homology groups with singly exponential complexity. As an intermediate step in our algorithm we construct a semi-algebraic subset $Γ$ of the given semi-algebraic set $S$, such that $\mathrm{H}_q(S,Γ) = 0$ for $q=0,1$. We relate this construction to a basic theorem in complex algebraic geometry stating that for any affine variety $X$ of dimension $n$, there exists Zariski closed subsets \[ Z^{(n-1)} \supset \cdots \supset Z^{(1)} \supset Z^{(0)} \] with $\dim_{\mathrm{C}} Z^{(i)} \leq i$, and $\mathrm{H}_q(X,Z^{(i)}) = 0$ for $0 \leq q \leq i$. We conjecture a quantitative version of this result in the semi-algebraic category, with $X$ and $Z^{(i)}$ replaced by closed semi-algebraic sets. We make initial progress on this conjecture by proving the existence of $Z^{(0)}$ and $Z^{(1)}$ with complexity bounded singly exponentially (previously, such an algorithm was known only for constructing $Z_0$).

math.AG↗

Hausdorff approximations and volume of tubes of singular algebraic sets

We prove bounds for the volume of neighborhoods of algebraic sets, in the euclidean space or the sphere, in terms of the degree of the defining polynomials, the number of variables and the dimension of the algebraic set, without any smoothness assumption. This generalizes previous work of Lotz on smooth complete intersections in the euclidean space and of Bürgisser, Cucker and Lotz on hypersurfaces in the sphere, and gives a complete solution to Problem 17 in the book titled "Condition" by Bürgisser and Cucker.

math.AG↗

Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem

Let $X \subset \mathbb{P}^{n}$ be a non-empty closed subscheme over an algebraically closed field $k$, and $\mathrm{J}^{[p]}(X) = \mathrm{J}(X,\mathrm{J}(X,\cdots,\mathrm{J}(X,X)\cdots)$ denote the $p$-fold iterated join of $X$ with itself. In this article, we prove that the restriction homomorphism on cohomology $\mathrm{H}^{i}(\mathbb{P}^{N}) \rightarrow \mathrm{H}^{i}(\mathrm{J}^{[p]}(X))$, with $N = (p+1)(n+1)-1$, is an isomorphism for $0 \leq i < p$, and injective for $i=p$, for any good cohomology theory. We also prove this result in the more general setting of relative joins for $X$ over a base scheme $S$, where $S$ is of finite type over $k$. We give several applications of these results including a cohomological version of classical quantifier elimination in the first order theory of algebraically closed fields of arbitrary characteristic, as well as an algebraic version of Toda's theorem in complexity theory valid over algebraically closed fields of arbitrary characteristic. We also apply our results to obtain effective bounds on the Betti numbers of image of projective varieties under projection map.

math.AG↗

On the Reeb spaces of definable maps

We prove that the Reeb space of a proper definable map $f:X \rightarrow Y$ in an arbitrary o-minimal expansion of a real closed field is realizable as a proper definable quotient. This result can be seen as an o-minimal analog of Stein factorization of proper morphisms in algebraic geometry. We also show that the Betti numbers of the Reeb space of $f$ can be arbitrarily large compared to those of $X$, unlike in the special case of Reeb graphs of manifolds. Nevertheless, in the special case when $f:X \rightarrow Y$ is a semi-algebraic map and $X$ is closed and bounded, we prove a singly exponential upper bound on the Betti numbers of the Reeb space of $f$ in terms of the number and degrees of the polynomials defining $X,Y$, and $f$.

math.AT↗

Categorical Complexity

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several examples of this new definition in categories of wide common interest, such as finite sets, Boolean functions, topological spaces, vector spaces, semi-linear and semi-algebraic sets, graded algebras, affine and projective varieties and schemes, and modules over polynomial rings. We show that on one hand categorical complexity recovers in several settings classical notions of non-uniform computational complexity (such as circuit complexity), while on the other hand it has features which make it mathematically more natural. We also postulate that studying functor complexity is the categorical analog of classical questions in complexity theory about separating different complexity classes.

math.CT↗

VC density of definable families over valued fields

We prove a tight bound on the number of realized $0/1$ patterns (or equivalently on the Vapnik-Chervonenkis codensity) of definable families in models of the theory of algebraically closed valued fields with a non-archimedean valuation. Our result improves the best known result in this direction proved by Aschenbrenner, Dolich, Haskell, Macpherson and Starchenko, who proved a weaker bound in the restricted case where the characteristics of the field $K$ and its residue field are both assumed to be $0$. The bound obtained here is optimal and without any restriction on the characteristics. We obtain the aforementioned bound as a consequence of another result on bounding the Betti numbers of semi-algebraic subsets of certain Berkovich analytic spaces, mirroring similar results known already in the case of o-minimal structures and for real closed, as well as, algebraically closed fields. The latter result is the first result in this direction and is possibly of independent interest. Its proof relies heavily on recent results of Hrushovski and Loeser on the topology of semi-algebraic subsets of Berkovich analytic spaces.

math.LO↗

Spectral Sequences, Exact Couples and Persistent Homology of filtrations

In this paper we study the relationship between a very classical algebraic object associated to a filtration of spaces, namely a spectral sequence introduced by Leray in the 1940's, and a more recently invented object that has found many applications -- namely, its persistent homology groups. We show the existence of a long exact sequence of groups linking these two objects and using it derive formulas expressing the dimensions of each individual groups of one object in terms of the dimensions of the groups in the other object. The main tool used to mediate between these objects is the notion of exact couples first introduced by Massey in 1952.

math.AT↗

Zeroes of polynomials on definable hypersurfaces: pathologies exist, but they are rare

Given a sequence $\{Z_d\}_{d\in \mathbb{N}}$ of smooth and compact hypersurfaces in $\mathbb{R}^{n-1}$, we prove that (up to extracting subsequences) there exists a regular definable hypersurface $Γ\subset \mathbb{R}\mathrm{P}^n$ such that each manifold $Z_d$ appears as a component of the zero set on $Γ$ of some polynomial of degree $d$. (This is in sharp contrast with the case when $Γ$ is algebraic, where for example the homological complexity of the zero set of a polynomial $p$ on $Γ$ is bounded by a polynomial in $\mathrm{deg}(p)$.) We call these "pathological examples". In particular, we show that for every $0 \leq k \leq n-2$ and every sequence of natural numbers $a=\{a_d\}_{d\in \mathbb{N}}$ there is a regular, compact and definable hypersurface $Γ\subset \mathbb{R}\mathrm{P}^n$, a subsequence $\{a_{d_m}\}_{m\in \mathbb{N}}$ and homogeneous polynomials $\{p_{m}\}_{m\in \mathbb{N}}$ of degree $\mathrm{deg}(p_m)=d_m$ such that: \begin{equation} \label{eq:pathintro} b_k(Γ\cap Z(p_m))\geq a_{d_m}.\end{equation} (Here $b_k$ denotes the $k$-th Betti number.) This generalizes a result of Gwoździewicz, Kurdyka and Parusiński. On the other hand, for a given definable $Γ$ we show that the Fubini-Study measure, in the gaussian space of polynomials of degree $d$, of the set $Σ_{d_m,a, Γ}$ of polynomials verifying $b_k(Γ\cap Z(p_m))\geq a_{d_m}$ is positive, but there exists a contant $c_Γ$ such that this measure can be bounded by: \begin{equation} 0<\mathbb{P}(Σ_{d_m, a, Γ})\leq \frac{c_Γ d_m^{\frac{n-1}{2}}}{a_{d_m}}. \end{equation} This shows that the set of "pathological examples" has "small" measure.

math.AG↗

On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms

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 dimensions $d$ and larger. This vanishing result is tight. Using a new geometric approach we also prove an upper bound of $d^{O(d)} s^d k^{\lfloor d/2 \rfloor-1} $ on the equivariant Betti numbers of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by quantifier-free formulas involving $s$ symmetric polynomials of degrees bounded by $d$, where $1 < d \ll s,k$. This bound is tight up to a factor depending only on $d$. These results significantly improve upon those obtained previously which were proved using different techniques. Our new methods are quite general, and also yield bounds on the equivariant Betti numbers of certain special classes of symmetric definable sets (definable sets symmetrized by pulling back under symmetric polynomial maps of fixed degree) in arbitrary o-minimal structures over $\mathrm{R}$. Finally, we utilize our new approach to obtain an algorithm with polynomially bounded complexity for computing these equivariant Betti numbers. In contrast, the problem of computing the ordinary Betti numbers of (not necessarily symmetric) semi-algebraic sets is considered to be an intractable problem, and all known algorithms for this problem have doubly exponential complexity.

math.AT↗

Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications

We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different types of results under a single framework, such as bounds depending on the total degrees, on multi-degrees, as well as in the case of quadratic and partially quadratic polynomials. The bounds we present in the case of partially quadratic polynomials offer a significant improvement over what was previously known. Finally, we extend a result of Barone and Basu on bounding the number of connected components of real varieties defined by two polynomials of differing degrees to the sum of all Betti numbers, thus making progress on an open problem posed in that paper.

math.AG↗

A complexity theory of constructible functions and sheaves

In this paper we introduce constructible analogs of the discrete complexity classes $\mathbf{VP}$ and $\mathbf{VNP}$ of sequences of functions. The functions in the new definitions are constructible functions on $\mathbb{R}^n$ or $\mathbb{C}^n$. We define a class of sequences of constructible functions that play a role analogous to that of $\mathbf{VP}$ in the more classical theory. The class analogous to $\mathbf{VNP}$ is defined using Euler integration. We discuss several examples, develop a theory of completeness, and pose a conjecture analogous to the $\mathbf{VP}$ vs. $\mathbf{VNP}$ conjecture in the classical case. In the second part of the paper we extend the notions of complexity classes to sequences of constructible sheaves over $\mathbb{R}^n$ (or its one point compactification). We introduce a class of sequences of simple constructible sheaves, that could be seen as the sheaf-theoretic analog of the Blum-Shub-Smale class $\mathbf{P}_{\mathbb{R}}$. We also define a hierarchy of complexity classes of sheaves mirroring the polynomial hierarchy, $\mathbf{PH}_{\mathbb{R}}$, in the B-S-S theory. We prove a singly exponential upper bound on the topological complexity of the sheaves in this hierarchy mirroring a similar result in the B-S-S setting. We obtain as a result an algorithm with singly exponential complexity for a sheaf-theoretic variant of the real quantifier elimination problem. We pose the natural sheaf-theoretic analogs of the classical $\mathbf{P}$ vs. $\mathbf{NP}$ question, and also discuss a connection with Toda's theorem from discrete complexity theory in the context of constructible sheaves. We also discuss possible generalizations of the questions in complexity theory related to separation of complexity classes to more general categories via sequences of adjoint pairs of functors.

math.AG↗