Results 91 to 100 of about 181 (122)
Stochastic Identification of Stability of Competitive Interactions in Ecosystems. [PDF]
PLoS One, 2016 Vach M, Vachová P.
europepmc +1 more source
Feasibility Theory Reconciles and Informs Alternative Approaches to Neuromuscular Control. [PDF]
Front Comput Neurosci, 2018 Cohn BA +3 more
europepmc +1 more source
Mechanisms for Robust Local Differential Privacy. [PDF]
Entropy (Basel)Lopuhaä-Zwakenberg M, Goseling J.
europepmc +1 more source
Volume and Surface Area for Polyhedra and Polytopes
Mathematics Magazine, 1997 When the curious calculus student first realizes the relationship between the area and circumference of the circle, dA/dr = C, and the similar relationship between the volume and surface area of the sphere, dV/dr = A, the question arises: "Is this always the case?" We show that, indeed, such a relation exists in all dimensions for (convex) regular ...
John Emert, Roger B. Nelson
+4 more sources
Planes, Polyhedra, and Polytopes
, 2018 Elementary geometric objects defined by linear equations and inequalities are introduced, along with their basic properties. This serves two purposes, the first of which is simply to introduce basic vocabulary. Beginning with affine subspaces and half spaces, we will proceed to (closed) cones, polyhedra, and polytopes, which are polyhedra that are ...
Andrew McLennan
openalex +2 more sources
The Steiner Traveling Salesman Polytope and Related Polyhedra
SIAM Journal on Optimization, 2002 Summary: We consider an extended formulation of the Steiner traveling salesman problem, that is, when variables are associated with both the edges and the nodes of the graph. We give a complete linear description of the associated polytope when the underlying graph is series-parallel.
Mourad Baı̈ou, Ali Ridha Mahjoub
openalex +3 more sources
Decomposability of polytopes and polyhedra
Geometriae Dedicata, 1987 A polytope P is called decomposable if it is the algebraic sum of two non-trivial polytopes. Investigating the space of affine dependences (i.e. all vectors of coefficients summing to 0, and yielding a 0 linear combination) of the vertices of the dual polytope, several results concerning decomposability are obtained. E.g.
Zeev Smilansky
openalex +2 more sources
Self-Dual Regular 4-Polytopes and Their Petrie-Coxeter-Polyhedra
Results in Mathematics, 1987 \textit{H. S. M. Coxeter} [Proc. Lond. Math. Soc., II. Ser. 43, 33-62 (1937; Zbl 0016.27101)] discovered that to every self-dual convex regular 4- polytope P, there may be associated a regular skew-polyhedron M. The automorphism group of M is that of P twisted by \(Z_ 2\). The authors define an incidence-polytope as a combinatorial analog of a polytope,
Peter McMullen, Egon Schulte
openalex +2 more sources
The Steiner tree polytope and related polyhedra
Mathematical Programming, 1994 The author considers the vertex weighted Steiner tree problem, an extension of the classical Steiner tree problem, from a polyhedral point of view. Given an undirected graph \(G= (V,E)\), a set \(T\subseteq V\), a cost function \(c\) defined on \(E\) and a cost function \(f\) on \(V\), the requirement is to find a Steiner tree \((U,F)\) minimizing the ...
Michel X. Goemans
openalex +2 more sources
Polytopes, Polyhedra, and Cones
, 1995 In this lecture we prove some fundamental properties, in particular the equivalence of the two definitions of polytopes in Definition 0.1.
Günter M. Ziegler
openalex +2 more sources