scientific article; zbMATH DE number 3804333
From MaRDI portal
Publication:4747150
bipyramidsCaratheodory's theoremscombinatorial identitiescombinatorial theoryconvex polytopescyclicDehn-Sommerville relationsdualityequivalencefacial structuregraphsirreducible external representationisomorphismslatticeslower bound theoremneighbourlyorthogonal projectionpolaritypolyhedral setspyramidsRadon's theoremssimplesimplicialupper bound theoremvertex- figures
Cited in
(only showing first 100 items - show all)- Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems
- The conjugacy problem for Coxeter groups.
- Converting between quadrilateral and standard solution sets in normal surface theory
- Gal's conjecture for nestohedra corresponding to complete bipartite graphs
- Reflected Brownian motion with skew symmetric data in a polyhedral domain
- The number of extreme pairs of finite point-sets in Euclidean spaces
- Satisfiability in many-valued sentential logic is NP-complete
- Completely unimodal numberings of a simple polytope
- Subsemigroups of finitely generated groups with divisor-theory
- A simple way to tell a simple polytope from its graph
- Support functions on ordinal products
- On support points of segmentally closed convex bodies in the rational plane
- Convex hulls of samples from spherically symmetric distributions
- On the diameter of convex polytopes
- A unified approach for the stability robustness of polynomials in a convex set
- Arrangements of hyperplanes with property D
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Eulerian stratification of polyhedra
- Eulerian 2-strata spaces
- A bound on local minima of arrangements that implies the upper bound theorem
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
- Constructive invariant theory for tori
- Efficiency in Euclidean constrained location problems
- Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
- Bruhat intervals, polyhedral cones and Kazhdan-Lusztig-Stanley polynomials
- Robust stability of neutral delay differential systems
- Convexity and finite quantum logics
- Gaps in the numbers of vertices of cubical polytopes. I
- Facial reduction in partially finite convex programming
- McMullen's conditions and some lower bounds for general convex polytopes
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Computation of Betti numbers of monomial ideals associated with stacked polytopes
- Linear conditions on the number of faces of manifolds with boundary
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- On the maximal number of Nash equilibria in an n n bimatrix game
- Majorization, polyhedra, and statistical testing problems
- Canonical modules of certain edge subrings
- Gauge groups and data classification.
- On maximum principles for M-operators.
- On eigenvalues induced by a cone constraint.
- On semi-Eulerian partially ordered sets with boundary.
- Representability of convex sets by analytical linear inequality systems.
- The structure of the efficient frontier of finite-dimensional completely-shaded sets
- Directional end of a convex set: theory and applications.
- A convex semi-nonnegative matrix factorisation approach to fuzzy c-means clustering
- Infinite-dimensional reductive monoids associated to highest weight representations of Kac-Moody groups
- On the reconstruction of polytopes
- On input design for regularized LTI system identification: power-constrained input
- Evenly convex credal sets
- On divisor-closed submonoids and minimal distances in finitely generated monoids
- On Dantzig figures from graded lexicographic orders
- The complement of polyhedral product spaces and the dual simplicial complexes
- Lyapunov-type least-squares problems over symmetric cones
- Characterization of rankings generated by linear discriminant analysis
- On \(Q\) and \(R_0\) properties of a quadratic representation in linear complementarity problems over the second-order cone
- Unimodular rows over monoid rings
- The Santalo point of a planar convex set
- Some problems on polyhedra
- The associahedron and triangulations of the \(n\)-gon
- Random convex hulls in a product of balls
- Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
- Facet-reducing cuts of a convex polytope
- Hamiltonian simple polytopes
- An infinite family of nearly neighborly centrally symmetric 3-spheres
- The classification of transversal multiplicity-free group actions
- Minimal and reduced pairs of convex bodies
- A combinatorial result on Gröbner fans with an application to universal Gröbner bases
- Valuations and asymptotic invariants for sequences of ideals
- An Euler relation for valuations on polytopes
- Cyclic polytopes and oriented matroids
- A geometric approach to revealed preference via Hamiltonian cycles
- A new proof of Balinski's theorem on the connectivity of polytopes
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Dominant strategy implementability and zero length cycles
- Fundamental groups of real toric spaces over simple polytopes
- Facets of the cone of exact games
- Nearest neighbor control for practical stabilization of passive nonlinear systems
- Existence of continuous maps from \(d\)-spheres \((d \geq 1)\) to its various triangulations having the disjoint support property
- The d-majorization polytope
- Minimum number of edges of polytopes with \(2d+2\) vertices
- Bracketing numbers of convex and m-monotone functions on polytopes
- Polytopes close to being simple
- Grothendieck groups, convex cones and maximal Cohen-Macaulay points
- Polyhedra as domains of harmonic maps
- Toric log del Pezzo surfaces with one singularity
- On cutting planes for cardinality-constrained linear programs
- Congruences of convex algebras.
- Simplicial neighbourly 5-polytopes with nine vertices
- On LYZ's conjecture for the \(U\)-functional
- A geometric study of cores of idempotent stochastic matrices
- Polyhedral aspects of score equivalence in Bayesian network structure learning
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Geometry of possibility measures on finite sets
- A polyhedral approach for a constrained quadratic 0-1 problem
- Polytopes and simplexes in \(p\)-adic fields
- The numbers of edges of 5-polytopes with a given number of vertices
- Lower bound theorems for general polytopes
- Fractional perfect \(b\)-matching polytopes. I: General theory
- Localizable invariants of combinatorial manifolds and Euler characteristic
- Bounds for effective strains of geometrically linear elastic multiwell model
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 Q4747150)