scientific article; zbMATH DE number 4092241
From MaRDI portal
Publication:3819622
Recommendations
- scientific article; zbMATH DE number 1241847
- A universality theorem for projectively unique polytopes and a conjecture of Shephard
- Characterizations of the Dimension for Classes of Concordant Polytopes
- Classification of finite metric spaces and combinatorics of convex polytopes
- On the number of universal algebraic geometries
- Universal polynomial majorants on convex bodies
- Universality theorems for inscribed polytopes and Delaunay triangulations
- The universality theorem for neighborly polytopes
- SOME RESULTS AND PROBLEMS RELATED TO UNIVERSAL ALGEBRAIC GEOMETRY
- Generalized toric varieties for simple nonrational convex polytopes
Cited in
(only showing first 100 items - show all)- Finding a simple polytope from its graph in polynomial time
- Configuration spaces of planar mechanical linkages with one degree of freedom
- Algebraic varieties characterizing matroids and oriented matroids
- The complexity of point configurations
- Some provably hard crossing number problems
- Computational algebraic geometry of projective configurations
- On the distribution of order types
- On representation varieties of Artin groups, projective arrangements and the fundamental groups of smooth complex algebraic varieties
- Hyperfield Grassmannians
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- The hyperbolic plane, three-body problems, and Mnëv's universality theorem
- Representation of convex geometries by circles on the plane
- The complexity of drawing a graph in a polygonal region
- Extension complexity and realization spaces of hypersimplices
- Testing orientability for matroids is NP-complete
- Matroids, motives, and a conjecture of Kontsevich.
- Complete enumeration of small realizable oriented matroids
- New examples of oriented matroids with disconnected realization spaces
- Many projectively unique polytopes
- Positive configuration space
- Grassmannians and pseudosphere arrangements
- Many order types on integer grids of polynomial size
- Flag matroids: algebra and geometry
- Computational complexity of multi-player evolutionarily stable strategies
- Arrangements of approaching pseudo-lines
- Generalized dissections and Monsky's theorem
- An algorithm for counting arcs in higher-dimensional projective space
- Complete graph drawings up to triangle mutations
- RAC-drawability is \(\exists \mathbb{R} \)-complete
- Algebraic degrees of 3-dimensional polytopes
- Hopf algebras for matroids over hyperfields
- Minimal representations of order types by geometric graphs
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- On powers of Plücker coordinates and representability of arithmetic matroids
- The slack realization space of a matroid
- Segment orders
- Kodaira fibrations and beyond: methods for moduli theory
- Realization spaces of arrangements of convex bodies
- Reducible \(M\)-curves for Le-networks in the totally-nonnegative Grassmannian and KP-II multiline solitons
- Universality theorems for linkages in homogeneous surfaces
- Rigidity and polynomial invariants of convex polytopes
- On two notions of total positivity for partial flag varieties
- Combining realization space models of polytopes
- Boundary measurement and sign variation in real projective space
- Representability of matroids by c-arrangements is undecidable
- Extension complexity of polytopes with few vertices or facets
- Lifting matroid divisors on tropical curves
- How to draw a planarization
- scientific article; zbMATH DE number 4180218 (Why is no real title available?)
- scientific article; zbMATH DE number 3951434 (Why is no real title available?)
- scientific article; zbMATH DE number 4060217 (Why is no real title available?)
- scientific article; zbMATH DE number 16121 (Why is no real title available?)
- scientific article; zbMATH DE number 578742 (Why is no real title available?)
- Sign rank versus Vapnik-Chervonenkis dimension
- Aligned drawings of planar graphs
- Enumeration of PLCP-orientations of the 4-cube
- Aligned drawings of planar graphs
- Self-polar polytopes
- The complexity of drawing a graph in a polygonal region
- REPRESENTATION VARIETIES OF ALGEBRAS WITH NODES
- Smoothing the Gap Between NP and ER
- Convex drawings of the complete graph: topology meets geometry
- Microthesis: Triangulations of cyclic polytopes in representation theory
- A counterexample to the extension space conjecture for realizable oriented matroids
- Recognition and complexity of point visibility graphs
- Complexity of geometric \(k\)-planarity for fixed \(k\)
- Fixed points, Nash equilibria, and the existential theory of the reals
- How to draw a planarization
- An optimal algorithm for reconstructing point set order types from radial orderings
- On the complexity of some geometric problems with fixed parameters
- Von Staudt constructions for skew-linear and multilinear matroids
- Oriented matroids and combinatorial neural codes
- Arrangements of pseudocircles: on circularizability
- Inserting an edge into a geometric embedding
- Clique-width of point configurations
- Drawing graphs as spanners
- Arrangements of pseudocircles: on circularizability
- There is no tame triangulation of the infinite real Grassmannian
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids
- Is the number of subrings of index p e in ℤ n polynomial in p ?
- ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPES
- The Complexity of Drawing Graphs on Few Lines and Few Planes
- Universal sequences of lines in \(\mathbb{R}^d\)
- On the complexity of recognizing nerves of convex sets
- Minkowski summands of cubes
- Initial degenerations of spinor varieties
- The complexity of the Hausdorff distance
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
- RAC-Drawability is ∃ℝ-complete and Related Results
- Positive Plücker tree certificates for non-realizability
- Combinatorial point configurations and polytopes
- The positive Grassmannian, the amplituhedron, and cluster algebras
- Topological art in simple galleries
- Simple realizability of complete abstract topological graphs in P
- Order types of convex bodies
- Semi-Pappus configurations; combinatorial generalizations of the Pappus configuration
- Beyond the Existential Theory of the Reals
- The complexity of recognizing geometric hypergraphs
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations
- A practical algorithm with performance guarantees for the art gallery problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3819622)
