Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 316 for “"polytope"”.

  1. Polytope Membership in High Dimension

    Τα πολύτοπα σε προβλήματα βελτιστοποίησης και δειγματοληψίας δίνονται συνήθως από μια έμμεση αναπαράσταση μέσω μιας μηχανής οracle. Η πιο βασική μηχανή oracle είναι ο έλεγχος μέλους σε πολύτοπα που μπορεί να απαντήσει στο αν ένα σημείο επερώτησης q βρίσκεται μέσα στο P ή όχι, και χρησιμοποιείται …

    athens Repository record for Polytope Membership in High Dimension (opens in a new tab)

  2. Three interesting lattice polytope problems

    … this thesis is about three interesting lattice polytope problems. Chapter 2 is about classifying lattice polytopes and we show that in every dimension d there is a number W(d), called the finiteness threshold width, such that there are only finitely many lattice polytopes of bounded size whose …

    fu-berlin Repository record for Three interesting lattice polytope problems (opens in a new tab)

  3. Generalized Characteristics Of A Generic Polytope

    … We will show that, for symplectic-faced 4-polytopes ∑, we have the existence and local uniqueness of generalized characteristics of ∑. Then, we will show that symplectic-faced polytopes ∑ ⊂ R2n admit only characteristics with piecewise-linear trajectories. Finally, we will extend our …

    mississippi Repository record for Generalized Characteristics Of A Generic Polytope (opens in a new tab)

  4. Some problems related to the polytope illumination

    … the Illumination Conjecture for the primitive polytopes. A bounded intersection of halfspaces is a primitive polytope, if omitting any halfspace renders the intersection unbounded. A C-polyhedron P ⊂ E^d is a reduced, d-dimensional intersection of homothets of a smooth, strictly convex body C ⊂ …

    calgary Repository record for Some problems related to the polytope illumination (opens in a new tab)

  5. Methods from Differential Geometry in Polytope Theory

    … thesis is to study classical objects, such as polytopes, polytopal complexes, and subspace arrangements. We will tackle problems, old and new, concerning them. We do so by using some of the new tools that have been developed in combinatorial topology, especially those tools developed in …

    fu-berlin Repository record for Methods from Differential Geometry in Polytope Theory (opens in a new tab)

  6. Poset and polytope perspectives on alternating sign matrices.

    … TSSCPPs. We define the alternating sign matrix polytope as the convex hull of nxn alternating sign matrices and prove its equivalent description in terms of inequalities. We count its facets and vertices and describe its projection to the permutohedron as well as give a complete characterization …

    umn Repository record for Poset and polytope perspectives on alternating sign matrices. (opens in a new tab)

  7. On DP-constraints for the Traveling Salesman polytope.

    … for the Symmetric Traveling Salesman Polytope (STSP) which includes the family of comb constraints. Moreover, there exists a polynomial-time exact separation algorithm for the DP-constraints for points whose support graph is planar. However, while the comb constraints are known to be …

    ottawa-retro Repository record for On DP-constraints for the Traveling Salesman polytope. (opens in a new tab)

  8. Computational determination of the largest lattice polytope diameter

    A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let δ(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational framework to determine δ(d, k) for small instances. We show that δ(3, 4) = …

    mcmaster Repository record for Computational determination of the largest lattice polytope diameter (opens in a new tab)

  9. Polytope-based topology optimization using a mimetic-inspired method

    … work of Wachspress, many interpolants for polytopes have come forth; such as, mean value coordinates, natural neighbor-based coordinates, metric coordinate method and maximum entropy shape functions. The extension of the shape functions to three-dimensions, however, has been relatively slow …

    uiuc Repository record for Polytope-based topology optimization using a mimetic-inspired method (opens in a new tab)

  10. The number of facets of a projection of a convex polytope

    … $\IR\sp{d}$ onto a hyperplane and let P be a d-polytope in $\IR\sp{d}$. The following relations hold on the numbers of facets $f\sb{d-1}(P)$ of P and $f\sb{d-2}(\pi(P))$ of $\pi(P)$:$$\eqalign{f\sb2(P)&\ge{1\over2}f\sb1(\pi(P))+2\ {\rm if}\ d=3,\cr f\sb{d-1}(P)&\ge2{\sqrt{f\sb{d-2}(\pi(P))}}\ …

    uiuc Repository record for The number of facets of a projection of a convex polytope (opens in a new tab)

  11. Extended Target Tracking of Convex Polytope Shapes with Maneuvers and Clutter

    … descriptor, an algorithm to track 2D convex polytope shaped targets is developed. Further, the point target Probabilistic Multiple Hypotheses Tracker (PMHT) is modified to derive an extended target PMHT (ET-PMHT) equations to track 3D convex polytope shapes, using a Delaunay triangulation to …

    mcmaster Repository record for Extended Target Tracking of Convex Polytope Shapes with Maneuvers and Clutter (opens in a new tab)

  12. From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers

    … who recently found a new formula for the cross-polytope numbers. My topic will be focused on "Generalizations of cross-polytope numbers". It will include the proofs of the combinatorics results in Dr. Edwards and Dr. Griffiths' recently published paper. $E(n,m)$ and $O(n,m)$, the even terms and …

    kennesaw Repository record for From Simplest Recursion to the Recursion of Generalizations of Cross Polytope Numbers (opens in a new tab)

  13. Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures

    … (DGFEM) spatial discretization on arbitrary polytope (polygonal and polyhedral) grids compatible for massively-parallel computer architectures. Polytope meshes are attractive for multiple reasons, including their use in other physics communities and their ease in handling local mesh …

    tamu Repository record for Higher-Order DGFEM Transport Calculations on Polytope Meshes for Massively-Parallel Architectures (opens in a new tab)

  14. Conjugate of some rational functions and convex envelope of quadratic functions over a polytope

    … For a bivariate PLQ function de ned over a polytope, we start with computing the convex envelope of each piece. This convex envelope is characterized by a polyhedral subdivision such that over each member of the subdivision, it has an implicitly de ned rational form(square of a linear …

    ubc Repository record for Conjugate of some rational functions and convex envelope of quadratic functions over a polytope (opens in a new tab) Download PDF for Conjugate of some rational functions and convex envelope of quadratic functions over a polytope (opens in a new tab)

  15. On the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytope

    … applied recursively to the fractional stable set polytope of a graph. We focus on two related conjectures proposed by Liptak and Tuncel: the N-N_0 Conjecture and Rank Conjecture. First, we look at the algebraic derivation of new valid inequalities by the operators N and N_0. We then present …

    waterloo Repository record for On the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytope (opens in a new tab)

  16. Asymptotics of the number of lattice points in the transportation polytope via optimization on Lorentzian polynomials.

    We formally extend the theory of polynomial capacity to power series and totally uni- modular matrices. Using these results, we prove the log-asymptotic correctness of bounds by Brändén, Leake, and Pak developed through the use of Lorentzian polynomials ([BLP23]) under certain conditions, and …

    waterloo Repository record for Asymptotics of the number of lattice points in the transportation polytope via optimization on Lorentzian polynomials. (opens in a new tab)

  17. Lattice Path Matroids: Base Polytopes & Ehrhart Theory

    We study matroid base polytopes of lattice path matroids, $\mathscr{P}(M(\nu))\subset \Rr^n$ with skew shape $\nu$. Our goal is to compute their corresponding Ehrhart polynomials. This story comes in three parts.\textit{Part 1:} We produce a minimal linear inequality description for the base …

    ku Repository record for Lattice Path Matroids: Base Polytopes & Ehrhart Theory (opens in a new tab)

Page 1 of 16