scientific article

From MaRDI portal
Revision as of 15:24, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3819622

zbMath0667.52006MaRDI QIDQ3819622

Nicolai E. Mnëv

Publication date: 1988


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (96)

Matroids, motives, and a conjecture of Kontsevich.The moduli space of matroidsAn algorithm for counting arcs in higher-dimensional projective spaceVon Staudt constructions for skew-linear and multilinear matroidsOriented matroids and combinatorial neural codesLifting matroid divisors on tropical curvesHyperfield GrassmanniansThe Complexity of Drawing a Graph in a Polygonal RegionComplete graph drawings up to triangle mutationsCorrelations between the ranks of submatrices and weights of random codesREPRESENTATION VARIETIES OF ALGEBRAS WITH NODESSegment ordersRAC-drawability is \(\exists \mathbb{R} \)-completeAn Optimal Algorithm for Reconstructing Point Set Order Types from Radial OrderingsAlgebraic degrees of 3-dimensional polytopesSmoothing the Gap Between NP and ERKodaira fibrations and beyond: methods for moduli theoryRealization spaces of arrangements of convex bodiesConvex drawings of the complete graph: topology meets geometryHopf algebras for matroids over hyperfieldsBarycentric systems and stretchabilityRealizability and inscribability for simplicial polytopes via nonlinear optimizationDerived subdivisions make every PL sphere polytopalIs the number of subrings of index p e in ℤ n polynomial in p  ?ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPESThe Complexity of Drawing Graphs on Few Lines and Few PlanesUniversal sequences of lines in \(\mathbb{R}^d\)Reducible \(M\)-curves for Le-networks in the totally-nonnegative Grassmannian and KP-II multiline solitonsInitial degenerations of spinor varietiesThe complexity of the Hausdorff distanceOn two notions of total positivity for partial flag varietiesCompleteness for the complexity class \(\forall \exists \mathbb{R}\) and area-universalityComplete enumeration of small realizable oriented matroidsNew examples of oriented matroids with disconnected realization spacesRAC-Drawability is ∃ℝ-complete and Related ResultsPositive Plücker tree certificates for non-realizabilityCombining realization space models of polytopesThe positive Grassmannian, the amplituhedron, and cluster algebrasTopological art in simple galleriesSimple realizability of complete abstract topological graphs in POrder types of convex bodiesBoundary measurement and sign variation in real projective spaceThe hyperbolic plane, three-body problems, and Mnëv's universality theoremRepresentability of matroids by \(c\)-arrangements is undecidableHow to Draw a PlanarizationMinimal representations of order types by geometric graphsSign rank versus Vapnik-Chervonenkis dimensionRepresentation of convex geometries by circles on the planeUnnamed ItemAligned Drawings of Planar GraphsThe complexity of drawing a graph in a polygonal regionAlgebraic varieties characterizing matroids and oriented matroidsThe complexity of point configurationsSome provably hard crossing number problemsComputational algebraic geometry of projective configurationsComplexity of Geometric k-Planarity for Fixed kEnumeration of PLCP-orientations of the 4-cubeOn the distribution of order typesExtension complexity and realization spaces of hypersimplicesRecognition and complexity of point visibility graphsFixed points, Nash equilibria, and the existential theory of the realsCombinatorial models for the finite-dimensional GrassmanniansHow to Draw a PlanarizationCrossing numbers and combinatorial characterization of monotone drawings of \(K_n\)There is no tame triangulation of the infinite real GrassmannianCocircuit graphs and efficient orientation reconstruction in oriented matroidsMany projectively unique polytopesThe complexity of tensor rankArrangements of pseudocircles: on circularizabilityOn powers of Plücker coordinates and representability of arithmetic matroidsIncidence geometry and universality in the tropical planePositive configuration spaceInserting an edge into a geometric embeddingArrangements of pseudocircles: on circularizabilityAligned Drawings of Planar GraphsMinkowski summands of cubesGrassmannians and pseudosphere arrangementsClique-width of point configurationsDrawing graphs as spannersUniversality theorems for linkages in homogeneous surfacesArrangements of pseudocircles and circlesTesting orientability for matroids is NP-completeFinding a simple polytope from its graph in polynomial timeThe slack realization space of a matroidConfiguration spaces of planar mechanical linkages with one degree of freedomExtension Complexity of Polytopes with Few Vertices or FacetsSelf-polar polytopesA counterexample to the extension space conjecture for realizable oriented matroidsRigidity and polynomial invariants of convex polytopesOn the Complexity of Some Geometric Problems With Fixed ParametersMany order types on integer grids of polynomial sizeOn representation varieties of Artin groups, projective arrangements and the fundamental groups of smooth complex algebraic varietiesFlag matroids: algebra and geometryComputational complexity of multi-player evolutionarily stable strategiesArrangements of approaching pseudo-linesGeneralized dissections and Monsky's theorem







This page was built for publication: