اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the Facets of the Secondary Polytope
341
0
0.0
(
0
)
تأليف
Sven Herrmann
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very well studied, there is not much known about the facets of the secondary polytope. The splits of a polytope, subdivisions with exactly two maximal faces, are the simplest examples of such facets and the first that were systematically investigated. The present paper can be seen as a continuation of these studies and as a starting point of an examination of the subdivisions corresponding to the facets of the secondary polytope in general. As a special case, the notion of k-split is introduced as a possibility to classify polytopes in accordance to the complexity of the facets of their secondary polytopes. An application to matroid subdivisions of hypersimplices and tropical geometry is given.
قيم البحث
اقرأ أيضاً
This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $ntimes ntimes n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e., the Upper an
d Lower Bound Theorems), we present some new lower and upper bounds. We show that the new upper bound is tighter than the one recently obtained by Chang, Paksoy and Zhang [Ann. Funct. Anal. 7 (2016), no.~3, 386--393] and also sharper than the one in Linial and Lurias [Discrete Comput. Geom. 51 (2014), no.~1, 161--170]. We demonstrate that the analog of the lower bound obtained in such a way, however, is no better than the existing ones.
In this paper we investigate the structure of the fundamental polytope used in the Linear Programming decoding introduced by Feldman, Karger and Wainwright. We begin by showing that for expander codes, every fractional pseudocodeword always has at le
ast a constant fraction of non-integral bits. We then prove that for expander codes, the active set of any fractional pseudocodeword is smaller by a constant fraction than the active set of any codeword. We further exploit these geometrical properties to devise an improved decoding algorithm with the same complexity order as LP decoding that provably performs better, for any blocklength. It proceeds by guessing facets of the polytope, and then resolving the linear program on these facets. While the LP decoder succeeds only if the ML codeword has the highest likelihood over all pseudocodewords, we prove that the proposed algorithm, when applied to suitable expander codes, succeeds unless there exist a certain number of pseudocodewords, all adjacent to the ML codeword on the LP decoding polytope, and with higher likelihood than the ML codeword. We then describe an extended algorithm, still with polynomial complexity, that succeeds as long as there are at most polynomially many pseudocodewords above the ML codeword.
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. Our main theorem is that McMullens p
olytope algebra is a subalgebra of the (partial) convolution algebra of generalized translation invariant valuations. More precisely, we show that the polytope algebra embeds injectively into the space of generalized translation invariant valuations and that for polytopes in general position, the convolution is defined and corresponds to the product in the polytope algebra.
Let m,n be positive integers. Define T(m,n) to be the transportation polytope consisting of the m x n non-negative real matrices whose rows each sum to 1 and whose columns each sum to m/n. The special case B(n)=T(n,n) is the much-studied Birkhoff-von
Neumann polytope of doubly-stochastic matrices. Using a recent asymptotic enumeration of non-negative integer matrices (Canfield and McKay, 2007), we determine the asymptotic volume of T(m,n) as n goes to infinity, with m=m(n) such that m/n neither decreases nor increases too quickly. In particular, we give an asymptotic formula for the volume of B(n).
We show that a generic framework $(G,p)$ on the cylinder is globally rigid if and only if $G$ is a complete graph on at most four vertices or $G$ is both redundantly rigid and $2$-connected. To prove the theorem we also derive a new recursive constru
ction of circuits in the simple $(2,2)$-sparse matroid, and a characterisation of rigidity for generic frameworks on the cylinder when a single designated vertex is allowed to move off the cylinder.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
