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 28 for “"Combinatorial geometry"”.

  1. Some problems in combinatorial geometry

    <p>This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining three chapters with finite matroids.</p> <p>Chapter 1 has two main results. Firstly we prove that there is no duality function on the class of independence spaces which behaves like duality for …

    oxford Repository record for Some problems in combinatorial geometry (opens in a new tab)

  2. COMPATIBILITY OF EXTENSIONS OF A COMBINATORIAL GEOMETRY

    Two extensions of a geometry are compatible with each other if they have a common extension. If the given extensions are elementary, their compatibility can be intrinsically described in terms of their corresponding linear subclasses. Certain adjointness relation between an extension of a geometry …

    waterloo Repository record for COMPATIBILITY OF EXTENSIONS OF A COMBINATORIAL GEOMETRY (opens in a new tab)

  3. On a Generalization of the de Bruijn-Erdos Theorem

    The de Bruijn-Erdos Theorem from combinatorial geometry states that every set of $n$ noncollinear points in the plane determine at least $n$ distinct lines. Chen and Chvatal conjecture that this theorem can be generalized from the Euclidean metric to all finite metric spaces with appropriately …

    concordia Download PDF for On a Generalization of the de Bruijn-Erdos Theorem (opens in a new tab)

  4. Multifold sums and products over R, and combinatorial problems on sumsets

    … problem studied by Chang. By introducing several combinatorial tools, this expands upon a method of Croot and Hart which used the Tarry-Escott problem to build distinct sums from polynomials with specific vanishing properties. We also study other aspects of the sum-product problem such as a method …

    gatech Repository record for Multifold sums and products over R, and combinatorial problems on sumsets (opens in a new tab)

  5. Reliable distributed information : agreement and structure

    … performing repeated agreement. A result between combinatorial geometry and approximate Byzantine agreement is also provided. Coding is often used in communication, but here we provide examples of the usage of coding to minimize broadcast information and to solve a concurrent problem. The first …

    texas Repository record for Reliable distributed information : agreement and structure (opens in a new tab)

  6. Probabilistic Methods

    … very useful to solve problems in number theory, combinatorial geometry, linear algebra and real analysis. More recently, it has been applied in the development of efficient algorithms and in the study of various computational problems.Broadly, the probabilistic method is somewhat opposite of the …

    vcu Repository record for Probabilistic Methods (opens in a new tab)

  7. Combinatorial approach to ABV-packets for GLn

    … complexity of this problem by considering the combinatorial geometry of these objects using multisegments, since there exists a natural relationship between this description and the structure of ABV-packets. The first part of this thesis investigates interpretations of the Zelevinskii …

    lethbridge Repository record for Combinatorial approach to ABV-packets for GLn (opens in a new tab)

  8. Eigenvalue Densities for the Hermitian Two-Matrix Model and Connections to Hurwitz Numbers

    … interaction term for the two-matrix model to a combinatorial geometry problem. In particular, the interaction term is written as the Harish-Chandra-Itzykson-Zuber integral, which is expanded in a neighborhood of \tau=0, where \tau is the coupling constant appearing in the interaction term. The …

    arizona-thes Repository record for Eigenvalue Densities for the Hermitian Two-Matrix Model and Connections to Hurwitz Numbers (opens in a new tab)

  9. EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING

    … case of Euclidean norm; this result relies on combinatorial geometry techniques concerning $k$-sets and dynamic convex hulls. Finally, we study the problem in fixed dimension $d$ with $k=2$; by means of tools of real algebraic geometry and numerical techniques for localising algebraic roots we …

    milano Repository record for EXACT ALGORITHMS FOR SIZE CONSTRAINED CLUSTERING (opens in a new tab)

  10. Combinatorial problems for intervals, fractal sets and tubes

    We discuss three problems related to combinatorial geometry, based on two separate works. The first work concerns arrangements of intervals in R² for which there are many pairs forming trapezoids, meaning the convex hull of the pair is a trapezoid. We characterise arrangements forming more than a …

    ubc Repository record for Combinatorial problems for intervals, fractal sets and tubes (opens in a new tab) Download PDF for Combinatorial problems for intervals, fractal sets and tubes (opens in a new tab)

  11. Metrical Properties of Convex Bodies in Minkowski Spaces

    … of constant Minkowskian width, Minkowskian geometry of simplices, geometric inequalities and the corresponding optimization problems for convex bodies. First we examine one-dimensional Minkowskian cross-section measures deriving (in a unified manner) various properties of these measures. …

    qucosa-diss

  12. Recursive optimization: exact and efficient combinatorial optimization algorithm design principles with applications to machine learning

    … a generic algorithm design framework for solving combinatorial optimization problems, it subsumes the classical recursive optimization methods, such as greedy, dynamic programming, divide-and-conquer, and branch-and-bound (BnB) methods. In particular, this thesis focuses on solving combinatorial …

    birmingham Download PDF for Recursive optimization: exact and efficient combinatorial optimization algorithm design principles with applications to machine learning (opens in a new tab)

  13. Limits and Singularities of Normal Functions.

    … algebraic) cycles are totally derived from the combinatorial geometry of these polytopes, we expect that their dual polytopes encodes the “mirror” objects via mirror symmetry.

    wustl Repository record for Limits and Singularities of Normal Functions. (opens in a new tab)

  14. Presmooth geometries

    … In addition, families of curves and the combinatorial geometry of one-dimensional structures are studied to prove a weak trichotomy theorem based on very weak one-basedness.</p> <p>It is then shown that under suitable additional conditions groups and group actions can be constructed in …

    oxford Repository record for Presmooth geometries (opens in a new tab)

  15. Characterizations of Some Combinatorial Geometries

    … use characteristic polynomials. A geometry is non—splitting if it cannot be expressed as the union of two of its proper flats. A geometry G is upper homogeneous if for all k, k = 1, 2, ... , r(G), and for every pair x, y of flats of rank k, the contraction G/x is isomorphic to the …

    unt Repository record for Characterizations of Some Combinatorial Geometries (opens in a new tab)

  16. Development and evaluation of a Monte Carlo code system for analysis of ionization chamber responses

    … a mixture. Finally, MICAP incorporates a combinatorial geometry package and input cross section processors to eliminate restrictions in the modeling capability of the code system with respect to geometry, physical processes, nuclear data, and sources.</p> <p>To evaluate MICAP, comparisons …

    utk-theses Repository record for Development and evaluation of a Monte Carlo code system for analysis of ionization chamber responses (opens in a new tab)

  17. Computational aspects of some problems from discrete geometry in higher dimensions

    … 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 explaining …

    fu-berlin Repository record for Computational aspects of some problems from discrete geometry in higher dimensions (opens in a new tab)

  18. The inverse problem to the Voronoi diagram

    The primary purpose of this thesis is to address the problem of solving the Inverse Problem for the Voronoi Diagram where the Inverse Problem is: Given a diagram that is in fact a Voronoi Diagram find the set of points X = {x1, x2, x3,…,x n} in R2 that will generate the diagram. In formulating a …

    twu Repository record for The inverse problem to the Voronoi diagram (opens in a new tab)

  19. The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors

    We show that the maximum size of a geometry of rank n excluding the (q + 2)-point line, the 3-wheel W_3, and the 3-whirl W^3 as minor is (n - 1)q + 1, and geometries of maximum size are parallel connections of (q + 1)-point lines. We show that the maximum size of a geometry of rank n excluding the …

    unt Repository record for The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors (opens in a new tab)

Page 1 of 2