Results 41 to 50 of about 71,380 (295)
Universality in Polytope Phase Transitions and Message Passing Algorithms [PDF]
arXiv.org, 2012 We consider a class of nonlinear mappings FA,N in R N indexed by symmetric random matrices A ∈ R N×N with independent entries. Within spin glass theory, special cases of these mappings correspond to iterating the TAP equations and were studied by Erwin ...
M. Bayati, M. Lelarge, A. Montanari
semanticscholar +1 more source
Efficient Random-Walk Methods for Approximating Polytope Volume [PDF]
International Symposium on Computational Geometry, 2013 We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the polytope's volume in ...
I. Emiris, Vissarion Fisikopoulos
semanticscholar +1 more source
Enumerating Triangulations of Convex Polytopes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A triangulation of a finite point set A in $\mathbb{R}^d$ is a geometric simplicial complex which covers the convex hull of $A$ and whose vertices are points of $A$.
Sergei Bespamyatnikh
doaj +1 more source
Poset vectors and generalized permutohedra [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We show that given a poset $P$ and and a subposet $Q$, the integer points obtained by restricting linear extensions of $P$ to $Q$ can be explained via integer lattice points of a generalized permutohedron.
Dorian Croitoru +2 more
doaj +1 more source
Indecomposable Polytopes [PDF]
Transactions of the American Mathematical Society, 1974 The space of summands (with respect to vector addition) of a convex polytope in n dimensions is studied. This space is shown to be isomorphic to a convex pointed cone in Euclidean space. The extreme rays of this cone correspond to similarity classes of indecomposable polytopes.
openaire +1 more source
Extremal properties for dissections of convex 3-polytopes [PDF]
, 1999 A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices forms a ...
Bruns Winfried +6 more
core +5 more sources
Constructing neighborly polytopes and oriented matroids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 A $d$-polytope $P$ is neighborly if every subset of $\lfloor\frac{d}{2}\rfloor $vertices is a face of $P$. In 1982, Shemer introduced a sewing construction that allows to add a vertex to a neighborly polytope in such a way as to obtain a new neighborly ...
Arnau Padrol
doaj +1 more source
A Simple Check Polytope Projection Penalized Algorithm for ADMM Decoding of LDPC Codes
IEEE Access, 2023 ADMM penalized decoding method for Low-Density Parity-Check (LDPC) Codes can improve the frame error rate (FER) performance than the standard ADMM decoder by adding penalty terms to the objective function.
Huiyang Liu +4 more
doaj +1 more source
Topology and its Applications, 2011 We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra.
Došen, Kosta, Petrić, Zoran
openaire +3 more sources
The brick polytope of a sorting network [PDF]
European journal of combinatorics (Print), 2011 The associahedron is a polytope whose graph is the graph of flips on triangulations of a convex polygon. Pseudotriangulations and multitriangulations generalize triangulations in two different ways, which have been unified by Pilaud & Pocchiola in their ...
Vincent Pilaud, F. Santos
semanticscholar +1 more source