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 21 for “"Zonotopes"”.
-
Zonotopes and Hypertoric Varieties
Hypertoric varieties are a class of conical symplectic resolutions which are very computable. In the current literature, they are only defined constructively, using hyperplane arrangements. We provide an abstract definition of a hypertoric variety and a new construction using zonotopal tilings and …
-
Lattice points, oriented matroids, and zonotopes
… the celebrated Bohne-Dress theorem on tilings of zonotopes by zonotopes with an approach which relies on a novel interpretation of the chirotope of an oriented matroid.
-
Discrete Geometry and Optimization Approaches for Zonotopes
We consider the problem of generating the vertices of a zonotope, that is, a Minkowski sum of a finite set of segments. We propose a computational, convex-hull-free framework that exploits the combinatorial structure of a zonotope, such as its symmetry group, to generate all canonical …
-
Unified Framework for Neural Network Verification with Hybrid Zonotopes
… verification increasingly important. Hybrid Zonotopes have recently emerged as a promising geometric representation for reachability analysis, noted for their ability to represent complex sets while remaining computationally tractable. This thesis builds upon that foundation and aims to …
-
Applications of Discrepancy Theory to Machine Learning
… result about the vector balancing constant for zonotopes. The first application to machine learning– coresets for kernel density estimators–gives both improved bounds over existing results for a variety of applications of interest, as well as a new chaining-based technique that allows for a more …
-
Zonotope matching and approximation for neural networks
… for approximating arbitrary polytopes by zonotopes using techniques from subgradient descent. Finally, we combine these two results to provide a novel neural network pruning algorithm based on the geometry of zonotope approximation
-
Extensions of Ehrhart theory and applications to combinatorial structures
… of the Ehrhart polynomial for special classes of zonotopes associated with signed graphs. There is a well-established dictionary between zonotopes, hyperplane arrangements, and (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called …
-
Topology of real matroid Schubert varieties
… real matroid Schubert varieties to quotients of zonotopes. Further, this combinatorial model for the topology of the variety can be generalised to define a topological space for any oriented matroid. As a consequence, we are able to compute the fundamental group and integral cohomology of these …
-
Oriented Matroid Circuit Polytopes
… permutation. These type A polytopes are graphic zonotopes, are polar duals of symmetric edge polytopes, and also make an appearance in Stapledon’s paper introducing Equivariant Ehrhart Theory.
-
Hybrid Reachability Analysis for Kuramoto-Lanchester Model
… linear systems using support functions and zonotopes as well as Taylor model based analysis for nonlinear systems. In order to evaluate our methods, we apply them to the Kuramoto-Lanchester model. This model exhibits highly nonlinear dynamics and can be easily scaled, and thus is well-suited …
-
Vector Balancing and Integer Programming
… classes of convex bodies, such as Lp balls, zonotopes and Schatten balls (Chapters 2, 3 and 7). We explore connections to sparsification of convex combinations (Chapter 4) and graphs (Chapter 6). We investigate the tightness of approximations to a robust notion of balancing (Chapter 5), …
-
Safe Bipedal Locomotion and Navigation in Uncertain Environments
… social path planning both parameterized as zonotopes. We integrate the SZN with a model predictive controller (MPC), where the zonotopes outputted by SZN are encoded as constraints for reachability-based motion planning and collision checking. Our results demonstrate the framework’s …
-
On the Combinatorics of Valuations
… In Chapter 3 we consider the h*-vector of zonotopes and show that the entries of their h*-vector form a unimodal sequence for all translation invariant valuations that satisfy the nonnegativity condition. The second part deals with certain enumeration problems for order preserving maps. …
-
Spectral Realizations of Symmetric Graphs, Spectral Polytopes and Edge-Transitivity
… complete classification of the vertex-transitive zonotopes and a new characterization for root systems.
-
Big Data-driven Predictive Control for Nonlinear Processes Using Trajectory Clusters - A Behavioural Systems Approach
… approach is based on the convex combination of zonotopes. In the second approach, the interpolation method is based on the kernel density estimation of data trajectories and the weighted linear subspace distance. An online BDPC controller is designed to optimise control actions subject to an …
-
Facial weak order, Coxeter groups and oriented matroids
… matroïdes orientés, poset de topes, permutoèdre, zonotopes, quotients de treillis, associaèdre
-
Diameter and Coherence of Monotone Path Graph
… path is coherent and showing that all other zonotopes contain at least one incoherent $f$-monotone path. For arrangements of corank 1, we prove that the monotone path graph has diameter equal to the lower bound suggested by Reiner and Roichman using methods of $L_2$-accessibility and …
-
Matroid-Theoretic Approaches to Compactified Jacobians and Vector Bundles
… spaces into highly-structured polyhedra known as zonotopes. By taking periodic subdivisions of this type and passing to the quotient under the lattice of periodicity, one obtains a class of cell decompositions of real tori. We prove an enumerative result on the $f$-vectors of these decompositions. …
-
Computational and Geometric Aspects of Linear Optimization
Linear optimization is concerned with maximizing, or minimizing, a linear objective function over a feasible region defined as the intersection of a finite number of hyperplanes. Pivot-based simplex methods and central-path following interior point methods are the computationally most efficient …
Page 1 of 2