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 “"Set Systems"”.
-
Antichains and Diameters of Set Systems
… present a number of results, mostly concerning set systems that are antichains and/or have bounded diameter. Chapter 1 gives a more detailed outline of the thesis. In Chapter 2, we give a new short proof of Kleitman's theorem concerning the maximal size of a set system with bounded diameter. In …
-
Tharaka Age-Organization and the Theory of Age-Set Systems
Made available in DSpace on 2014-12-10T23:55:00Z (GMT). No. of bitstreams: 1 7412087.pdf: 7656679 bytes, checksum: ff8a6fcfe52aabeba4f8a6ecd46ddfef (MD5) Previous issue date: 1973
-
Maximum size t-cross-intersecting and intersecting families with degree conditions
… (1) A solution to the problem of finding two set systems A and B such that A is r1-intersecting, B is r2-intersecting, A,B are t-cross-intersecting and A+ B is a maximum; (2) A solution to the problem of finding two set systems A and B such that A,B are Sperner, t-cross-intersecting and A+ B …
-
Two problems in extremal set theory
… this dissertation is on two problems in extremal set theory, which is a branch of extremal combinatorics. The general problem in extremal set theory is to start with all collections of subsets of an underlying ground set, apply restrictions, and then ask how large or small some property can be …
-
On profit maximization in mechanism design
… the procurement problem a buyer is given a set of agents with values, along with a family of feasible sets over the agents. The goal is to procure a feasible set of maximum value, for minimum cost. Assuming that a buyer obtains a decreasing marginal benefit per feasible set procured, the …
-
Point Clouds Between Local and Global Approaches
In this thesis we investigated set systems on geometric point data in Euclidean space from a macroscopic (first two chapters) and microscopic (last chapter) perspective. In Chapter A we described cloud sets, which are set systems build on points which give rise to simplicial complexes as control …
-
High-Dimensional Markov Chains and Applications
… crucial role in understanding the geometry of subsets in high-dimensional Euclidean space. In this study, we use high-dimensional Markov chains to develop efficient algorithms for two problems: sampling uniformly from convex bodies and bounding the discrepancy of set systems. We investigate two …
-
Open-set Speaker Recognition with Bounded Laguerre Voronoi Clustering
… last decade. Although numerous supervised closed-set systems successfully harvest the power of deep neural networks, limited studies have been made on open-set speaker recognition. This thesis proposes a self-supervised open-set speaker recognition that leverages the geometric properties of …
-
Branch-and-cut for symmetrical ILPs and combinatorial designs
… t-designs, packings, coverings and intersecting set systems. We experimentally analyze the strengths and limitations of our algorithms and determine when it is efficient to use isomorph-free branch-and-cut. Our framework generates new results and reproduces, in competitive time, existing ones.
-
Problems in Positional Games and Extremal Combinatorics
… fifth chapter, we consider shattering extremal set systems. A set system F ⊆ 2[n] is said to shatter a given set S⊆[n] if 2^S ={F ∩ S: F ∈ F}. TheSauer-ShelahLemma states that in general, a set system F shatters at least |F| sets. Here we concentrate on the case of equality. A set system is …
-
Generalizing Contexts Amenable to Greedy and Greedy-like Algorithms
… However, we do know that in several specific settings, greedy algorithms can achieve good results. This thesis focuses on examining contexts in which greedy and greedy-like algorithms are successful, and extending them to more general settings. In particular, we investigate structural …
-
The Erdős-Ko-Rado Theorem for intersecting families of permutations.
… Theorem is a fundamental result in extremal set theory. It describes the size and structure of the largest collection of subsets of size k from a set of size n having the property that any two subsets have at least t elements in common. Following the publication of the original theorem in …
-
A Collection of Results of Simonyi's Conjecture
Given two set systems $\mathscr{A}$ and $\mathscr{B}$ over an $n$-element set, we say that $(\mathscr{A,B})$ forms a recovering pair if the following conditions hold: \\ $ \forall A, A' \in \mathscr{A}$ and $ \forall B, B' \in \mathscr{B}$, $A \setminus B = A' \setminus B' \Rightarrow A=A'$ \\ $ …
-
On the combinatorics of set families
… thesis concerns the combinatorics and algebra of set systems. Let V be a set of size n. We define a vector space Mn with basis the power set of V. This space decomposes into a direct sum of eigenspaces under certain incidence maps. Any collection of k-sets S embeds naturally into this space, and …
-
Optimal Blocking for Three Treatments and BIBD Robustness - Two Problems in Design Optimality
… in the one-way and multi-way heterogeneity settings, first proving optimality through a series of bounding arguments, then applying combinatorial techniques for their construction. Among the results established are optimality with respect to the well known E and A criteria. A- and E-optimal …
-
SAT-based answer set programming
Answer set programming (ASP) is a declarative programming paradigm oriented towards difficult combinatorial search problems. Syntactically, ASP programs look like Prolog programs, but solutions are represented in ASP by sets of atoms, and not by substitutions, as in Prolog. Answer set systems, such …
-
On the Bollob\'as inequality
In this thesis we are concerned with the poset ${\cal P}(n)={\cal P}(\{1,2,\...,n\} ),$ the power set of $\lbrack n\rbrack=(\{1,2,\..., n\},$ ordered by inclusion. Consider a collection of pairs of sets, $\{(A\sb{i},B\sb{i})\}\sbsp{i=1}{m}$ in ${\cal P}(n)$ with the property that $\Vert …
-
Traceability schemes, frameproof codes, key distribution patterns and related topics: A combinatorial approach
… and other related objects such as separating systems, group testing algorithms, perfect hash families etc.. Traceability schemes for broadcast encryption were defined by Chor, Fiat and Naor (20), and frameproof codes for digital fingerprinting were proposed by Boneh and Shaw (14). Traceability …
Page 1 of 2