On the Betti Numbers of Real Varieties

From MaRDI portal
Publication:5736681

DOI10.2307/2034050zbMath0123.38302OpenAlexW4232452168MaRDI QIDQ5736681

John W. Milnor

Publication date: 1964

Full work available at URL: https://doi.org/10.2307/2034050



Related Items

Estimates of real roots of a system of algebraic equations, Upper bounds on Betti numbers of tropical prevarieties, Pseudo-Riemannian almost quaternionic homogeneous spaces with irreducible isotropy, Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\), Computing the Betti numbers of arrangements via spectral sequences, On the polynomial Wolff axioms, On the total curvature and Betti numbers of complex projective manifolds, Planar normal sections on the natural imbedding of a flag manifold, Remainder estimates in spectral asymptotic formulas for linear operator pencils, A variant of Ben-Or's lower bound for algebraic decision trees, Geometric properties of the ridge function manifold, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, \(L^2\) bounds for a maximal directional Hilbert transform, Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic, Estimations du nombre d'applications rationnelles d'une variété fixe aux variétés de type général. (Estimates of the number of rational mappings from a fixed variety to varieties of general type.), Polar varieties, real equation solving, and data structures: the hypersurface case, Nearly sharp complexity bounds for multiprocessor algebraic computations, Bounding the equivariant Betti numbers of symmetric semi-algebraic sets, Complexity lower bounds for computation trees with elementary transcendental function gates, Lower bounds for arithmetic networks. II: Sum of Betti numbers, Solving systems of polynomial inequalities in subexponential time, On the distortion required for embedding finite metric spaces into normed spaces, Lines in space: Combinatorics and algorithms, On the Reeb spaces of definable maps, Weak (1,1) bounds for oscillatory singular integrals, Semi-algebraic decision complexity, the real spectrum, and degree, VC dimensions of principal component analysis, On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\)., Betti numbers of polynomial hierarchical models for experimental designs, The Vapnik-Chervonenkis dimension of graph and recursive neural networks, Counting types of rigid frameworks, Growth of critical points in 1-dimensional lattice systems, Polynomial bound on the local Betti numbers of a real analytic germ, Semi-algebraic Ramsey numbers, Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases, Refined bounds on the number of connected components of sign conditions on a variety, On the marked length spectrum of generic strictly convex billiard tables, On triple intersections of three families of unit circles, On the spectral theory of trees with finite cone type, Bezout theorem for Nash functions, An incidence theorem in higher dimensions, Divide and conquer roadmap for algebraic sets, Complexity of computations in Commutative Division of the USSR Academy of Sciences, Bounding the number of connected components of a real algebraic set, The complexity of point configurations, A lower bound for the integer element distinctness problem, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time, Computing the first Betti number of a semi-algebraic set, A sharper estimate on the Betti numbers of sets defined by quadratic inequalities, Bounds of Hausdorff measures of tame sets, On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals, Upper bounds for Steklov eigenvalues of submanifolds in Euclidean space via the intersection index, Lines in Euclidean Ramsey theory, How to find Steiner minimal trees in Euclidean \(d\)-space, A size-depth trade-off for the analog computation of Boolean functions, Algebraic decision trees and Euler characteristics, Pleijel's theorem for Schrödinger operators with radial potentials, Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks, A weak version of the Blum, Shub, and Smale model, On the computation of Boolean functions by analog circuits of bounded fan-in, The complexity of deciding consistency of systems of polynomials in exponent inequalities, Lower bound on testing membership to a polyhedron by algebraic decision and computation trees, Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications, Polynomials with dense zero sets and discrete models of the Kakeya conjecture and the Furstenberg set problem, A formula related to CMV matrices and Szegő cocycles, Deciding consistency of systems of exponential-polynomial inequalities in subexponential time, Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs, An opportunistic global path planner, Spectral geometry of semi-algebraic sets, Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem, Edge intersection graphs of systems of paths on a grid with a bounded number of bends, Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials, On the zone of a surface in a hyperplane arrangement, Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique, An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions, Probabilistic communication complexity, Some aspects of complexity in real algebraic geometry, Zarankiewicz's problem for semi-algebraic hypergraphs, On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms, The complexity of economic decision rules, Lower bounds for arithmetic networks, An average John theorem, On the spectrum of lattice Schrödinger operators with deterministic potential, Complexity of deciding Tarski algebra, Topologically Noetherian analytic algebras. Khovanskij's theory, Homology of semi-pfaffian sets, Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials, Notes on the complexity of exact view graph algorithms for piecewise smooth algebraic surfaces, Bounded \(VC\)-dimension implies the Schur-Erdős conjecture, Betti numbers of semi-Pfaffian sets, On best approximation by ridge functions, Many order types on integer grids of polynomial size, Some speed-ups and speed limits for real algebraic geometry, Construction of roadmaps in semi-algebraic sets, Solving systems of polynomial inequalities over a real closed field in subexponential time, Cartan-Chern-Moser theory on algebraic hypersurfaces and an application to the study of automorphism groups of algebraic domains, On best approximation of classes by radial functions, Systems of rational polynomial equations have polynomial size approximate zeros on the average, On the Betti numbers of level sets of solutions to elliptic equations, On the Betti numbers of sign conditions, Weaving patterns of lines and line segments in space, There are asymptotically far fewer polytopes than we thought, A semi-algebraic version of Zarankiewicz's problem, Rigidity, Graphs and Hausdorff Dimension, The number of polytopes, configurations and real matroids, On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations, An algorithm for generalized point location and its applications, Ramsey-type results for semi-algebraic relations, Classification of complete projective special real surfaces, On covering numbers of sublevel sets of analytic functions, Non‐recursive functions, knots “with thick ropes,” and self‐clenching “thick” hyperspheres, The VC-dimension of K-vertex D-polytopes, Relative equilibria of the four-body problem, A restriction estimate in \(\mathbb{R}^3\) using brooms, On genuinely time bounded computations, Strichartz estimates for mixed homogeneous surfaces in three dimensions, Improved bounds for the expected number of \(k\)-sets, Kac’s random walk on the special orthogonal group mixes in polynomial time, Universal sequences of lines in \(\mathbb{R}^d\), Upper bounds for the number of isolated critical points via the Thom-Milnor theorem, Persistent Homology of Semialgebraic Sets, Distance geometry and data science, Concentration estimates for algebraic intersections, Counting dope matrices, Polynomial partitioning for a set of varieties, Face numbers: the upper bound side of the story, Improved Bounds for Incidences Between Points and Circles, Bounding Helly Numbers via Betti Numbers, Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations, Low-degree approximation of random polynomials, Lectures on Klein Surfaces and Their Fundamental Group, Topology of real multi-affine hypersurfaces and a homological stability property, The polynomial method over varieties, New equations for central configurations and generic finiteness, On the number of zero-patterns of a sequence of polynomials, On the speed of algebraically defined graph classes, New Kakeya estimates using Gromov's algebraic lemma, Computing the first few Betti numbers of semi-algebraic sets in single exponential time, On the number of cells defined by a family of polynomials on a variety, Generic Finiteness for Dziobek Configurations, Which are the simplest algebraic varieties?, Distinct distances on curves via rigidity, Sums of Betti numbers in arbitrary characteristic., The probability that a slightly perturbed numerical analysis problem is difficult, Finding connected components of a semialgebraic set in subexponential time, Nonrecursive functions in real algebraic geometry, Effective base point freeness, Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets, Decision tree complexity and Betti numbers, On the volume of tubular neighborhoods of real algebraic varieties, General formulas for the smoothed analysis of condition numbers, Complexity of deciding the first-order theory of real closed fields, Crossing patterns of segments, A restriction estimate using polynomial partitioning, Decoupling for moment manifolds associated to Arkhipov-Chubarikov-Karatsuba systems, Pseudo-dimension and entropy of manifolds formed by affine-invariant dictionary, The number of disk graphs, Asymptotic variance of the number of real roots of random polynomial systems, Horizontal gradient of polynomial functions for the standard Engel structure on \(\mathbb R^4\), Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions, Pseudo-Riemannian almost hypercomplex homogeneous spaces with irreducible isotropy, Betti numbers in the three‐dimensional minimal model program, Effective de Rham cohomology — The general case, Betti number bounds for fewnomial hypersurfaces via stratified Morse theory, On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines, Restriction for homogeneous polynomial surfaces in $\mathbb {R}^3$, Representation Complexities of SemiAlgebraic Graphs, On integer solutions of Parsell-Vinogradov systems, A discretized Severi-type theorem with applications to harmonic analysis, Planar tropical cubic curves of any genus, and higher dimensional generalisations, Unnamed Item, Book Review: Real solutions to equations from geometry, Subquadratic Encodings for Point Configurations, Monotone maps, sphericity and bounded second eigenvalue, Distinct distance estimates and low degree polynomial partitioning, A complexity theory of constructible functions and sheaves, Unnamed Item, Bounding the length of gradient trajectories



Cites Work