On the monotone upper bound problem.
Pfeifle, Julian, Ziegler, Günter M. (2004)
Experimental Mathematics
Similarity:
Displaying similar documents to “Computing the discrete compactness of orthogonal pseudo-polytopes via their D-EVM representation.”
On the monotone upper bound problem.
Counting -polytopes with vertices.
Fusy, Éric (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sweeping the cd-index and the toric -vector.
Lee, Carl W. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two signed associahedra.
Burgiel, H., Reiner, V. (1998)
The New York Journal of Mathematics [electronic only]
Similarity:
On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.
Subramani, K. (2009)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds.
Schwartz, Alexander, Ziegler, Günter M. (2004)
Experimental Mathematics
Similarity:
Flag vectors of multiplicial polytopes.
Bayer, Margaret M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vertex-vectors of quadrangular 3-polytopes with two types of edges
S. Jendrol, E. Jucovič, M. Trenkler (1989)
Banach Center Publications
Similarity:
Detection of influential points by convex hull volume minimization
Petr Tichavský, Pavel Boček (1998)
Kybernetika
Similarity:
A method of geometrical characterization of multidimensional data sets, including construction of the convex hull of the data and calculation of the volume of the convex hull, is described. This technique, together with the concept of minimum convex hull volume, can be used for detection of influential points or outliers in multiple linear regression. An approximation to the true concept is achieved by ordering the data into a linear sequence such that the volume of the convex hull of...
On non-inscribable polytopes
Branko Grünbaum, Ernest Jucovič (1974)
Czechoslovak Mathematical Journal
Similarity:
All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5
Oleg V. Borodin, Anna O. Ivanova (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Lebesgue (1940) proved that every 3-polytope P5 of girth 5 has a path of three vertices of degree 3. Madaras (2004) refined this by showing that every P5 has a 3-vertex with two 3-neighbors and the third neighbor of degree at most 4. This description of 3-stars in P5s is tight in the sense that no its parameter can be strengthened due to the dodecahedron combined with the existence of a P5 in which every 3-vertex has a 4-neighbor. We give another tight description of 3-stars in P5s:...