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 81 for “"Discrete geometry"”.
-
Optimization Methods in Discrete Geometry
In this thesis we study some problems from discrete geometry and develop new methods for solving them. Many such problems can be formulated as optimization problems over spaces defined by systems of polynomial inequalities. Our method consists of two steps, which can be summarized as follows: Model …
-
Discrete Geometry in Normed Spaces
This work refers to ball-intersections bodies as well as covering, packing, and kissing problems related to balls and spheres in normed spaces. A quick introduction to these topics and an overview of our results is given in Section 1.1 of Chapter 1. The needed background knowledge is collected in …
-
An algebraic view of discrete geometry
… have in common that they combine algebra with discrete geometry, mostly by using algebraic tools to prove statements from discrete geometry. Algebraic curves and number theory also recur throughout the proofs and results. In Chapter 1, we will detail these common threads. In Chapter 2, we prove …
-
Higher Gauge Theory and Discrete Geometry
… will recall, this can be done at the classical (discrete) level in a consistent manner, only if we use 2-group symmetries. This thesis focuses on understanding the symmetry aspects, the different possible discretizations and the quantization of four dimensional topological theories for some …
-
Equivariant topology methods in discrete geometry
The first chapter of this thesis is on the colored Tverberg problem, which is joint work with Pavle Blagojević and Günter Ziegler [BMZ09], [BMZ11a], [BMZ11b]. First we present a new and tight colored version of Tverberg's theorem that implies the Bárány-Larman conjecture for primes minus one and …
-
Ball Packings and Lorentzian Discrete Geometry
While the tangency graphs of disk packings are completely characterised by Koebe-Andreev-Thurston’s disk packing theorem, not so much is known about the combinatorics of ball packings in higher dimensions. This thesis tries to make a contribution by investigating some higher dimensional ball …
-
Discrete Geometry and Optimization Approaches for Zonotopes
… studied in various contexts, including algebraic geometry, mathematical physics, economics, psychometrics, and representation theory.
-
New Applications of Topological Methods in Discrete Geometry
… of topological methods to problems in discrete geometry. The topological proof strategy we use goes back to Lovász' 1978 proof of the Kneser conjecture: reduce the question of whether a geometric statement is true to the nonexistence of an equivariant map between a test space and a …
-
Discrete Geometry for Comparing and Transferring Neural Representations
… representational similarity, and diffusion geometry, incorporating tools from multi-view learning into this field for the first time. A key contribution is an exact Markov reformulation of a broad class of centered, scale-invariant RSMbased similarity measures in terms of row-stochastic …
-
Discrete Geometry and Optimization Approaches for Lattice Polytopes
Linear optimization aims at maximizing, or minimizing, a linear objective function over a feasible region defined by a finite number of linear constrains. For several well-studied problems such as maxcut, all the vertices of the feasible region are integral, that is, with integer-valued …
-
KKM theorems and applications to problems in discrete geometry
We use topological methods to obtain results in discrete geometry. The main topological tool used here is the KKM theorem, an equivalent version of Brouwer's fixed point theorem, and its variants. The problems in discrete geometry that we are different variations of piercing problems for families …
-
Applications of Topology, Combinatorics and Algorithms to Discrete Geometry
In Chapter 1, we show upper bounds to the Grünbaum–Hadwiger–Ramos problem. We give new proofs for almost all known upper bounds and improve the following cases: Let d,n,k be natural number with d >= 2^n(1 + 2^(k-1)). For any 2^(n+1) masses on R^d there are k affine hyperplanes that induce a …
-
Combinatorial Optimization and Discrete Geometry Approaches for Half-Integral Polytopes
… of the number of its facets, is a key element of discrete geometry. Polyhedral diameter is also related to the simplex method, as diameter is a lower bound on the worst-case number of simplex pivots. Hirsch conjectured in 1953 that the diameter of a bounded polyhedron (polytope) is at most the …
-
Markov chains and emergent behavior for problems from discrete geometry
… time bounds for two sampling problems from discrete geometry: dyadic tilings, combinatorial structures with applications in machine learning and harmonic analysis, and 3-colorings on a grid, an instance of the celebrated antiferromagnetic Potts model from statistical physics. Both of these …
-
Computation, Discrete Geometry, and Soft Mechanics in Non-Euclidean Elasticity
This dissertation explores the ways in which the geometry of thin objects influences their mechanics, i.e., the way they respond to external forces/stimuli and the ways that they move. This is relevant to biological phenomena, e.g., in the deployment of leaves, blooming of flowers, swimming of sea …
-
Polynomial Methods and Polynomial Partitioning in Discrete Geometry and Harmonic Analysis
Η παρούσα διατριβή εξερευνά την ανάπτυξη και την εφαρμογή της Πολυωνυμικής Μεθόδου στη διακριτή γεωμετρία και την αρμονική ανάλυση, καταγράφοντας την εξέλιξή της από τις πρώιμες αλγεβρικές ρίζες έως τις σύγχρονες ανακαλύψεις. Ξεκινάμε εξετάζοντας την προέλευση της μεθόδου, αναδεικνύοντας τις …
-
Computational aspects of some problems from discrete geometry in higher dimensions
… computational aspects of several problems from discrete geometry in higher dimensions. In the plane, many of them are well understood and can be solved efficiently, but as the dimension increases, most of them seem to be considerably harder to solve. In this thesis, we make progress towards …
-
Problems in computational algebra and integer programming
… and geometric combinatorics: one in tropical geometry, one in computational algebra, and two in discrete geometry and integer programming. Key tools used in this thesis include the theory of polyhedra, Grobner bases, and computational complexity theory.
Page 1 of 5