Results 31 to 40 of about 71,380 (295)
Perfect Prismatoids are Lattice Delaunay Polytopes
Моделирование и анализ информационных систем, 2014 A perfect prismatoid is a convex polytope P such that for every its facet F there exists a supporting hyperplane α k F such that any vertex of P belongs to either F or α.
M. A. Kozachok, A. N. Magazinov
doaj +1 more source
Phylogenetic Networks as Circuits With Resistance Distance
Frontiers in Genetics, 2020 Phylogenetic networks are notoriously difficult to reconstruct. Here we suggest that it can be useful to view unknown genetic distance along edges in phylogenetic networks as analogous to unknown resistance in electric circuits. This resistance distance,
Stefan Forcey, Drew Scalzo
doaj +1 more source
Matroid Polytopes and Their Volumes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian $Gr_{
Federico Ardila +2 more
doaj +1 more source
The matching polytope has exponential extension complexity [PDF]
Symposium on the Theory of Computing, 2013 A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial.
Thomas Rothvoss
semanticscholar +1 more source
Michigan Mathematical Journal, 2023 It is known that the sectional genus of a polarized variety has an upper bound, which is an extension of the Castelnuovo bound on the genus of a projective curve. Polarized varieties whose sectional genus achieves this bound are called Castelnuovo. On the other hand, a lattice polytope is called Castelnuovo if the associated polarized toric variety is ...
openaire +2 more sources
Discrete & Computational Geometry, 2007 This is the second of two papers where we study polytopes arising from affine Coxeter arrangements. Our results include a formula for their volumes, and also compatible definitions of hypersimplices, descent numbers and major index for all Weyl groups. We give a q-analogue of Weyl's formula for the order of the Weyl group. For A_n, C_n and D_4, we give
Lam, Thomas, Postnikov, Alexander
openaire +3 more sources
Polytope Expansion of Lie Characters and Applications [PDF]
, 2013 The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.
Walton, Mark A.
core +1 more source
Some Properties of Metric Polytope Constraints
Моделирование и анализ информационных систем, 2014 The integrality recognition problem is considered on the sequence Mn,k of the nested Boolean quadric polytope relaxations, including the rooted semimetric Mn and the metric Mn,3 polytopes.
V. A. Bondarenko, A. V. Nikolaev
doaj +1 more source
Accuracy and Convergence Rate Comparative Investigation on Polytope Smoothed and Scaled Boundary Finite Element [PDF]
Journal of Applied and Computational Mechanics, 2023 Continuity and discontinuity of two-dimensional domains are thoroughly investigated for accuracy and convergence rate using two prominent discretization methods, namely smoothed and scaled boundary finite element.
Boonchai Phungpaingam +2 more
doaj +1 more source
The polytope of Tesler matrices [PDF]
, 2014 We introduce the Tesler polytope $$\mathsf {Tes}_n(\mathbf{a})$$Tesn(a), whose integer points are the Tesler matrices of size n with hook sums $$a_1,a_2,\ldots ,a_n \in \mathbb {Z}_{\ge 0}$$a1,a2,…,an∈Z≥0. We show that $$\mathsf {Tes}_n(\mathbf{a})$$Tesn(
Karola Mészáros +2 more
semanticscholar +1 more source