Results 81 to 90 of about 71,380 (295)
Lusztig polytopes and FFLV polytopes
, 2020 22 pages, 12 figures; v2: added Proposition 5.2 and 5 ...
Fang, Xin, Koshevoy, Gleb
openaire +2 more sources
Prodsimplicial-Neighborly Polytopes [PDF]
Discrete & Computational Geometry, 2010 28 pages, 9 figures; minor ...
Matschke, Benjamin +2 more
openaire +4 more sources
Unconditional Reflexive Polytopes [PDF]
Discrete & Computational Geometry, 2020 AbstractA convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. We investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties. In particular, we characterize unconditional reflexive polytopes in terms of perfect graphs.
Kohl, Florian +2 more
openaire +4 more sources
On fractional realizations of graph degree sequences [PDF]
, 2013 We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope.
Barrus, Michael D.
core
UBVH: Unified Bounding Volume and Scene Geometry Representation for Ray Tracing
Computer Graphics Forum, EarlyView.Abstract Bounding volume hierarchies (BVHs) are currently the most common data structure used to accelerate ray tracing. The existing BVH methods distinguish between the bounding volume representation associated with the interior BVH nodes and the scene geometry representation associated with leaf nodes.
M. Káčerik, J. Bittner
wiley +1 more source
Embedding Stacked Polytopes on a Polynomial-Size Grid
, 2017 A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking operations.
Demaine, Erik D., Schulz, Andre
core +1 more source
Faces of 2-Dimensional Simplex of Order and Chain Polytopes
Mathematics, 2019 Each of the descriptions of vertices, edges, and facets of the order and chain polytope of a finite partially ordered set are well known. In this paper, we give an explicit description of faces of 2-dimensional simplex in terms of vertices.
Aki Mori
doaj +1 more source
A lower bound theorem for $d$-polytopes with $2d+1$ vertices [PDF]
, 2021 Guillermo Pineda‐Villavicencio +1 more
openalex +1 more source
Data‐Based Refinement of Parametric Uncertainty Descriptions
International Journal of Robust and Nonlinear Control, Volume 36, Issue 6, Page 3210-3228, April 2026.ABSTRACT We consider dynamical systems with a linear fractional representation involving parametric uncertainties which are either constant or varying with time. Given a finite‐horizon input‐state or input‐output trajectory of such a system, we propose a numerical scheme which iteratively improves the available knowledge about the involved constant ...
Tobias Holicki, Carsten W. Scherer
wiley +1 more source
Fixed points, intersection theorems, variational inequalities, and equilibrium theorems
International Journal of Mathematics and Mathematical Sciences, 2000 From a fixed point theorem for compact acyclic maps defined on admissible convex sets in the sense of Klee, we first deduce collectively fixed point theorems, intersection theorems for sets with convex sections, and quasi-equilibrium theorems.
Sehie Park
doaj +1 more source