Results 131 to 140 of about 71,380 (295)
Higher integrality conditions, volumes and Ehrhart polynomials
, 2009 A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a lattice-face polytope
Liu, Fu
core
Generalized translation invariant valuations and the polytope algebra [PDF]
, 2015 We study the space of generalized translation invariant valuations on a finite-dimensional vector space and construct a partial convolution which extends the convolution of smooth translation invariant valuations.
Bernig, Andreas, Faifman, Dmitry
core
Robust fault detection using polytope-based set-membership consistency test
Conference on Control and Fault Tolerant Systems, 2009 This article proposes a robust set-membership fault detection method based on the use of polytopes to bound the parameter uncertainty set. The proposed polytope-based fault detection algorithm is able to handle systems with bounded parameter variation ...
J. Blesa, V. Puig, J. Saludes
semanticscholar +1 more source
Discrete Mathematics, 2004 Binary relations and associated polytopes are considered: facet-defining inequalities, vertex adjacency, symmetries, basic lifting lemma, and relations to probabilistic choice and preference aggregation.
Fiorini, Samuel, Fishburn, Peter C.
openaire +1 more source
The Electronic Journal of Combinatorics, 2018 The Turán hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in Turán's theorem. However, when $r\ge 3$, the problem remains open.
openaire +3 more sources
Colorful Associahedra and Cyclohedra [PDF]
, 2014 Every n-edge colored n-regular graph G naturally gives rise to a simple abstract n-polytope, the colorful polytope of G, whose 1-skeleton is isomorphic to G. The paper describes colorful polytope versions of the associahedron and cyclohedron.
Autónoma México +4 more
core
Perfect Prismatoids and the Conjecture Concerning Face Numbers of Centrally Symmetric Polytopes
Моделирование и анализ информационных систем, 2012 In this paper we introduce and study a class of centrally symmetric polytopes – perfect prismatoids – and some its properties related to the famous conjecture concerning face numbers of centrally symmetric polytopes are proved.
M. A. Kozachok
doaj +3 more sources
Simulating extremal temporal correlations
New Journal of Physics, 2020 The correlations arising from sequential measurements on a single quantum system form a polytope. This is defined by the arrow-of-time (AoT) constraints, meaning that future choices of measurement settings cannot influence past outcomes.
Cornelia Spee +2 more
doaj +1 more source
Double Metric Resolvability in Convex Polytopes [PDF]
, 2022 Muhammad Ahmad +4 more
openalex +1 more source
Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities [PDF]
QuantumFinding a set of empirical criteria fulfilled by any theory satisfying the generalized notion of noncontextuality is a challenging task of both operational and foundational importance.
Soumyabrata Hazra +4 more
doaj +1 more source