scientific article; zbMATH DE number 3804333

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

Publication:4747150

zbMath0509.52001MaRDI QIDQ4747150

Arne Brøndsted

Publication date: 1983


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





Related Items (only showing first 100 items - show all)

Convexity and finite quantum logicsGaps in the numbers of vertices of cubical polytopes. ILattice paths and submonoids of \(\mathbb{Z}^2\)On the diameter of lattice polytopesFacial reduction in partially finite convex programmingNonsmooth critical point theory and applications to the spectral graph theoryReflected Brownian motion with skew symmetric data in a polyhedral domainMcMullen's conditions and some lower bounds for general convex polytopesThe cohomology algebra of polyhedral product spacesThe number of extreme pairs of finite point-sets in Euclidean spacesOn the complexity of some basic problems in computational convexity. I. Containment problemsThe non-Platonic and non-Archimedean noncomposite polyhedra\(f\)-polynomials, \(h\)-polynomials, and \(l^2\)-Euler characteristicsExtending shelling orders and a hierarchy of functions of unimodal simple polytopesSatisfiability in many-valued sentential logic is NP-completeProjection problems for symmetric polytopesComputation of Betti numbers of monomial ideals associated with stacked polytopesCompletely unimodal numberings of a simple polytopeLinear conditions on the number of faces of manifolds with boundaryReachability analysis of dynamical systems having piecewise-constant derivativesSubsemigroups of finitely generated groups with divisor-theoryA simple way to tell a simple polytope from its graphSupport functions on ordinal productsWeighted \(L^2\)-cohomology of Coxeter groups.On support points of segmentally closed convex bodies in the rational planeOn the maximal number of Nash equilibria in an \(n\times n\) bimatrix gameMajorization, polyhedra, and statistical testing problemsA convex semi-nonnegative matrix factorisation approach to fuzzy \(c\)-means clusteringInfinite-dimensional reductive monoids associated to highest weight representations of Kac-Moody groupsA complete complex hypersurface in the ball of \(\mathbb{C}^N\)An FPTAS for minimizing the product of two non-negative linear cost functionsCanonical modules of certain edge subringsGauge 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.Wythoff's construction for Coxeter groupsOn the order dimension of convex polytopesOn Pareto optima, the Fermat-Weber problem, and polyhedral gaugesOn the reconstruction of polytopesOn input design for regularized LTI system identification: power-constrained inputOn the complexity of core, kernel, and bargaining setRees cones and monomial rings of matroidsRepresentability of convex sets by analytical linear inequality systems.Evenly convex credal setsA geometric description of the maximal monoids of some matrix semigroupsOn the numbers of faces of low-dimensional regular triangulations and shellable ballsConvex hulls of samples from spherically symmetric distributionsOn divisor-closed submonoids and minimal distances in finitely generated monoidsComputing regions of attraction with polytopes: Planar caseOn Dantzig figures from graded lexicographic ordersOn the diameter of convex polytopesThe complement of polyhedral product spaces and the dual simplicial complexesA unified approach for the stability robustness of polynomials in a convex setInvariant convex subcones of the Tits cone of a linear Coxeter groupMinimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)Geometry, complexity, and combinatorics of permutation polytopesLyapunov-type least-squares problems over symmetric conesGeometry of the copositive and completely positive conesLattice polytopes of degree 2Arrangements of hyperplanes with property DSome \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice pathsCharacterization of rankings generated by linear discriminant analysisOn \(Q\) and \(R_0\) properties of a quadratic representation in linear complementarity problems over the second-order coneA geometric view on learning Bayesian network structuresRigidity and the lower bound theorem. IRobust pole assignmentA new basis of polytopesA property that characterizes Euler characteristic among invariants of combinatorial manifoldsUnimodular rows over monoid ringsCyclic convex bodies and optimization moment problemsOn the enumeration of certain weighted graphsThe Santalo point of a planar convex setBlowup algebras of square-free monomial ideals and some links to combinatorial optimization problemsThe conjugacy problem for Coxeter groups.Eulerian stratification of polyhedraSome problems on polyhedraEulerian 2-strata spacesThe associahedron and triangulations of the \(n\)-gonRandom convex hulls in a product of ballsConverting between quadrilateral and standard solution sets in normal surface theoryFaces of sets of operators with the numerical range in a prescribed polyhedronHypergeometric series representations of Feynman integrals by GKZ hypergeometric systemsGal's conjecture for nestohedra corresponding to complete bipartite graphsThe structure of the efficient frontier of finite-dimensional completely-shaded setsGeneralized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered setsÜber die minimalen Seitenzahlen von Polytopen ohne dreieckige 2-SeitenA bound on local minima of arrangements that implies the upper bound theoremAn improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertexVers une généralisation des espaces symétriques. (Towards a generalization of symmetric spaces)Constructive invariant theory for toriConvex polytopes, Coxeter orbifolds and torus actionsEfficiency in Euclidean constrained location problemsTriangle-free polytopes with few facetsConditions for the uniqueness of the optimal solution in linear semi- infinite programmingDirectional end of a convex set: theory and applications.On the necessity of the invariance conditions for reach control on polytopesBruhat intervals, polyhedral cones and Kazhdan-Lusztig-Stanley polynomialsRobust stability of neutral delay differential systemsHolomorphic functions unbounded on curves of finite length







This page was built for publication: