<em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

    <em id="zlul0"></em>

      <dl id="zlul0"></dl>
        <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
        <em id="zlul0"></em>

        <div id="zlul0"><ol id="zlul0"></ol></div>

        Questions tagged [convex-polytopes]

        Convex polytopes are the convex hulls of a finite set of points in Euclidean spaces. They have rich combinatorial, arithmetic, and metrical theory, and are related to toric varieties and to linear programming

        Filter by
        Sorted by
        Tagged with
        0
        votes
        0answers
        47 views

        How can the same polytope have three different volumes?

        I'm quite new to geometry and I came across the idea that the same convex polytope can have at least three different volumes. Consider the permutohedron, formed by the convex hull of the n! points ...
        0
        votes
        0answers
        18 views

        Gaussian mean width of normal random cones

        Suppose $1 \leq n < m < \infty$ are integers. For $g \sim \mathcal N(0, I_n)$ define the gaussian mean width of a non-empty set $T \subseteq \mathbb R^n$ by $$ w(T) := \mathbb E \sup_{x \in T} \...
        1
        vote
        0answers
        18 views

        Partition complexity measure of the boolean cube?

        Given $n$ points $p_1,\dots,p_n$ in $\{0,1\}^d$ my goal is to find $m$ index sets $\mathcal I_1,\dots,\mathcal I_m$ on the condition that each index set is a subset of $\{1,\dots,n\}$ on the ...
        3
        votes
        0answers
        49 views

        Is there any edge- but not vertex-transitive polytope in $d\ge 4$ dimensions?

        I consider convex polytopes $P\subset\Bbb R^d$. The polytope is called vertex- resp. edge-transitive, if any vertex resp. edge can be mapped to any other by a symmetry of the polytope. I am looking ...
        0
        votes
        0answers
        14 views

        Relatively prime polytope extension complexity

        What is the extension complexity of the $0/1$ vertexed polytope in $2d$ dimensions with property that integer represented by first $d$ coordinates is coprime to integer represented by second $d$ ...
        0
        votes
        0answers
        36 views

        Realizing 0/1-polytopes with shortest possible edge lengths

        Has there been something written about the following question? Question: Given a 0/1-polytope, what is the shortest edge lengths with which this polytope can be realized as a 0/1-polytope. The ...
        0
        votes
        1answer
        51 views

        A source for $01$-polytopes

        Can you recommend any books or survey articles on $01$-polytopes, thats is, polytopes with vertices in $\{0,1\}^n$? I am less interested in random $01$-polytopes, but more in the combinatorial ...
        2
        votes
        1answer
        66 views

        The number of Hamiltonian circuits on a convex polytope embedded in $\mathbb{R}^N$

        Recently I wondered whether there might be a natural topological complexity measure for convex polytopes embedded in $\mathbb{R}^N$. After some reflection it occurred to me that the number of distinct ...
        2
        votes
        1answer
        35 views

        Polytopes and polyhedral cones in complex Euclidean space

        Given $A \in \mathsf{M}_{m \times n}(\mathbb{R})$ and $b \in \mathbb{R}^m$, the polyhedron with respect to $A$ and $b$, denoted by $P(A,b)$, is defined by $$ \{ x \in \mathbb{R}^n \mid Ax \le b \}.$$ ...
        2
        votes
        0answers
        38 views

        Iterated polyhedron face twisting

        Let $Q$ be a polygon in the plane. Modify $Q$ by rotating each edge about its midpoint by $180^\circ$. The result is $Q$ again: No change. This suggests exploring a similar operation in $\mathbb{R}^3$...
        3
        votes
        1answer
        60 views

        Regular triangulations of star-convex polyhedra with given boundary

        Given an $n$-dimensional star-convex polyhedron $P\subset \mathbb{R}^n$ with simplicial facets, is it always possible to construct a regular triangulation $K$ of $P$ which does not subdivide the ...
        1
        vote
        0answers
        64 views

        Is there a simple polyhedral characterization of these integral points?

        Given $n\in\mathbb Z_{>0}$ consider the set of $n$-tuples $$(a_1,\dots,a_n)\in\mathbb Z_{\geq0}^n$$ on following simple conditions $0\leq a_i\leq 2^{2^n}-1$ If $a_i=b_{i,2^{n}-1}2^{2^{n}-1}+\dots+...
        1
        vote
        1answer
        84 views

        Estimating volume of a simple object

        Volume computation is $\#P$ hard. Take the $[0,1]^n$ polytope. Slice it by an half space inequality with $poly(n)$ bit rational coefficients into two unequal halves. Volume of bigger section is $\...
        4
        votes
        0answers
        70 views

        Edges of the contact polytope of the Leech lattice

        Let $P\subset\Bbb R^{24}$ be the contact polytope of the Leech lattice, that is, $P$ is the convex hull of the 196,560 shortest vectors of $\Lambda_{24}$. Question: What are the edges of $P$? Let'...
        1
        vote
        1answer
        84 views

        Given $H_{N}=\{\vec{x} \in [-1,1]^N:\sum_{i=1}^N x_i = 0\}$, what is the smallest subset $S \subset H_{2N}$ such that $\mathrm{conv}(S)=H_{2N}$

        Motivation: This is related to a different question I asked in April. It occurred to me while thinking about the sums of uniform random variables and it stuck in my mind because it's the special case ...

        15 30 50 per page
        山西福彩快乐十分钟
          <em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

          <em id="zlul0"></em>

            <dl id="zlul0"></dl>
              <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
              <em id="zlul0"></em>

              <div id="zlul0"><ol id="zlul0"></ol></div>
                <em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

                <em id="zlul0"></em>

                  <dl id="zlul0"></dl>
                    <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
                    <em id="zlul0"></em>

                    <div id="zlul0"><ol id="zlul0"></ol></div>
                    楚天22选五走势图 广东福彩app官方下载 重庆时时彩分析软件计划 河南11选5走势图一定牛 pk10为何前赢后输 彩票11选5开奖结果查询 乐江西时时 秒速时时彩精准计划 360pk10走势图 吉林时时走势图号码