• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 189
  • 35
  • 1
  • Tagged with
  • 431
  • 431
  • 156
  • 152
  • 150
  • 124
  • 108
  • 108
  • 79
  • 53
  • 52
  • 45
  • 43
  • 39
  • 35
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
401

Stochastic modelling of rat invasions among islands in the New Zealand archipelago

Miller, Steven Duncan January 2008 (has links)
This project was formulated with the purpose of advancing knowledge of the invasion dynamics of rats within archipelagos in New Zealand. The concentration on islands reflected the conservation focus of this project - islands are the last refuges for many native New Zealand species that cannot survive in the wild on the mainland. This project can be divided into four areas: 1. Data collection: There was no intent for innovation here, but a deeper understanding of the environments in which rats are born, breed, migrate, and die was developed. 2. Development of tools for data exploration: • A user-friendly point-and-click graphical interface for the R program was designed to allow any user to easily explore simple genetic characteristics of the data. • A novel method for exploring the genetic similarity between individuals was developed and showcased with real data, proving successful in cases of both high and low genetic differentiation, and in detecting likely individual migrants. 3. Improvement of a method for estimating migration: • An attempt was made to improve the Markov chain Monte Carlo procedure underlying this method. • The migration model used by the method was significantly improved, so that it could cope with any level of migration. Previously, results from situations where migration rates were high were invalid. 4. Investigated topics of ecological interest: • Field measurements of rats were used to show that Norway rats tend to have larger masses than ship rats, southern rats are generally larger than northern rats, but the effect on mass of living on an island as opposed to the mainland depends on the latitude. It was also shown that relative tail length is a good species discriminator. • Multiple paternity was confirmed for both Norway and ship rats. This breeding characteristic might form part of the explanation for why rats are such successful invaders. During the project, case studies involving rats on Big South Cape Island, Great Barrier Island and in the Bay of Islands were used to highlight the methods developed, and provided some unexpected and fascinating results.
402

On Defining Sets in Latin Squares and two Intersection Problems, one for Latin Squares and one for Steiner Triple Systems

Thomas Mccourt Unknown Date (has links)
Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 = M \ L is called a latin bitrade. Furthermore T1 and T2 are referred to as latin trades, in which T2 is said to be a disjoint mate of T1 (and vice versa). Drápal (1991) showed that, under certain conditions, a partition of an equilateral triangle of side length n, where n is some integer, into smaller, integer length sided equilateral triangles gives rise to a latin trade within the latin square based on the addition table for the integers modulo n. A partial latin square P of order n is said to be completable if there exists a latin square L of order n such that P ⊆ L. If there is only one such possible latin square, L, of order n then P is said to be uniquely completable and P is called a defining set of L. Furthermore, if C is a uniquely completable partial latin square such that no proper subset of C is uniquely completable, C is said to be a critical set or a minimal defining set. These concepts, namely latin trades and defining sets in latin squares, are intimately connected by the following observation. If L is a latin square and D ⊆ L is a defining set, then D intersects all latin bitrades for which one mate is contained in L. In Part I of this thesis Dr´apal’s result is applied to investigate the structure of certain defining sets in latin squares. The results that are obtained are interesting in themselves; furthermore, the geometric approach to the problem yields additional appealing results. These geometric results are discussed in Chapters 3, 4, 5 and 6. They pertain to partitioning regions (polygons in R2 that satisfy certain obvious conditions) into equilateral, integer length sided, triangles, such that no point, in the region, is a corner of more than three distinct triangles. In Chapter 2 one of the main two theorems on defining sets is established, as is a method for using the above geometric results to prove the nonexistence of certain types of defining sets. In Part II of this thesis, intersection problems, for latin squares and Steiner triple systems, are considered. The seminal works, for problems of these types, are due to Lindner and Rosa (1975) and Fu (1980). A natural progression, from the established literature, for intersection problems between elements in a pair of latin squares or Steiner triple systems is to problems in which the intersection is composed of a number of disjoint configurations (isomorphic copies of some specified partial triple system). In this thesis solutions to two intersection problems for disjoint configurations are detailed. An m-flower, (F,F), is a partial triple system/configuration, such that: F = {{x, yi, zi} | {yi, zi} ∩ {yj , zj} = ∅, for 0 ≤ i, j ≤ m − 1, i 6= j}; and F = UX∈FX. The first such problem considered in this thesis asks for necessary and sufficient conditions for integers k and m ≥ 2 such that a pair of latin squares of order n exists that intersect precisely in k disjoint m-flowers. The necessary terminology, constructions, lemmas and proof for this result are contained in Chapters 7, 8 and 9. The second such problem considered in this thesis asks for necessary and sufficient conditions for integers k such that a pair of Steiner triple systems of order u exists that intersect precisely in k disjoint 2-flowers. This result relies on the solution to the latin square problem and an additional result from Chapter 9. The further constructions and lemmas used to prove this result are detailed in Chapter 10.
403

On Defining Sets in Latin Squares and two Intersection Problems, one for Latin Squares and one for Steiner Triple Systems

Thomas Mccourt Unknown Date (has links)
Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 = M \ L is called a latin bitrade. Furthermore T1 and T2 are referred to as latin trades, in which T2 is said to be a disjoint mate of T1 (and vice versa). Drápal (1991) showed that, under certain conditions, a partition of an equilateral triangle of side length n, where n is some integer, into smaller, integer length sided equilateral triangles gives rise to a latin trade within the latin square based on the addition table for the integers modulo n. A partial latin square P of order n is said to be completable if there exists a latin square L of order n such that P ⊆ L. If there is only one such possible latin square, L, of order n then P is said to be uniquely completable and P is called a defining set of L. Furthermore, if C is a uniquely completable partial latin square such that no proper subset of C is uniquely completable, C is said to be a critical set or a minimal defining set. These concepts, namely latin trades and defining sets in latin squares, are intimately connected by the following observation. If L is a latin square and D ⊆ L is a defining set, then D intersects all latin bitrades for which one mate is contained in L. In Part I of this thesis Dr´apal’s result is applied to investigate the structure of certain defining sets in latin squares. The results that are obtained are interesting in themselves; furthermore, the geometric approach to the problem yields additional appealing results. These geometric results are discussed in Chapters 3, 4, 5 and 6. They pertain to partitioning regions (polygons in R2 that satisfy certain obvious conditions) into equilateral, integer length sided, triangles, such that no point, in the region, is a corner of more than three distinct triangles. In Chapter 2 one of the main two theorems on defining sets is established, as is a method for using the above geometric results to prove the nonexistence of certain types of defining sets. In Part II of this thesis, intersection problems, for latin squares and Steiner triple systems, are considered. The seminal works, for problems of these types, are due to Lindner and Rosa (1975) and Fu (1980). A natural progression, from the established literature, for intersection problems between elements in a pair of latin squares or Steiner triple systems is to problems in which the intersection is composed of a number of disjoint configurations (isomorphic copies of some specified partial triple system). In this thesis solutions to two intersection problems for disjoint configurations are detailed. An m-flower, (F,F), is a partial triple system/configuration, such that: F = {{x, yi, zi} | {yi, zi} ∩ {yj , zj} = ∅, for 0 ≤ i, j ≤ m − 1, i 6= j}; and F = UX∈FX. The first such problem considered in this thesis asks for necessary and sufficient conditions for integers k and m ≥ 2 such that a pair of latin squares of order n exists that intersect precisely in k disjoint m-flowers. The necessary terminology, constructions, lemmas and proof for this result are contained in Chapters 7, 8 and 9. The second such problem considered in this thesis asks for necessary and sufficient conditions for integers k such that a pair of Steiner triple systems of order u exists that intersect precisely in k disjoint 2-flowers. This result relies on the solution to the latin square problem and an additional result from Chapter 9. The further constructions and lemmas used to prove this result are detailed in Chapter 10.
404

On Defining Sets in Latin Squares and two Intersection Problems, one for Latin Squares and one for Steiner Triple Systems

Thomas Mccourt Unknown Date (has links)
Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 = M \ L is called a latin bitrade. Furthermore T1 and T2 are referred to as latin trades, in which T2 is said to be a disjoint mate of T1 (and vice versa). Drápal (1991) showed that, under certain conditions, a partition of an equilateral triangle of side length n, where n is some integer, into smaller, integer length sided equilateral triangles gives rise to a latin trade within the latin square based on the addition table for the integers modulo n. A partial latin square P of order n is said to be completable if there exists a latin square L of order n such that P ⊆ L. If there is only one such possible latin square, L, of order n then P is said to be uniquely completable and P is called a defining set of L. Furthermore, if C is a uniquely completable partial latin square such that no proper subset of C is uniquely completable, C is said to be a critical set or a minimal defining set. These concepts, namely latin trades and defining sets in latin squares, are intimately connected by the following observation. If L is a latin square and D ⊆ L is a defining set, then D intersects all latin bitrades for which one mate is contained in L. In Part I of this thesis Dr´apal’s result is applied to investigate the structure of certain defining sets in latin squares. The results that are obtained are interesting in themselves; furthermore, the geometric approach to the problem yields additional appealing results. These geometric results are discussed in Chapters 3, 4, 5 and 6. They pertain to partitioning regions (polygons in R2 that satisfy certain obvious conditions) into equilateral, integer length sided, triangles, such that no point, in the region, is a corner of more than three distinct triangles. In Chapter 2 one of the main two theorems on defining sets is established, as is a method for using the above geometric results to prove the nonexistence of certain types of defining sets. In Part II of this thesis, intersection problems, for latin squares and Steiner triple systems, are considered. The seminal works, for problems of these types, are due to Lindner and Rosa (1975) and Fu (1980). A natural progression, from the established literature, for intersection problems between elements in a pair of latin squares or Steiner triple systems is to problems in which the intersection is composed of a number of disjoint configurations (isomorphic copies of some specified partial triple system). In this thesis solutions to two intersection problems for disjoint configurations are detailed. An m-flower, (F,F), is a partial triple system/configuration, such that: F = {{x, yi, zi} | {yi, zi} ∩ {yj , zj} = ∅, for 0 ≤ i, j ≤ m − 1, i 6= j}; and F = UX∈FX. The first such problem considered in this thesis asks for necessary and sufficient conditions for integers k and m ≥ 2 such that a pair of latin squares of order n exists that intersect precisely in k disjoint m-flowers. The necessary terminology, constructions, lemmas and proof for this result are contained in Chapters 7, 8 and 9. The second such problem considered in this thesis asks for necessary and sufficient conditions for integers k such that a pair of Steiner triple systems of order u exists that intersect precisely in k disjoint 2-flowers. This result relies on the solution to the latin square problem and an additional result from Chapter 9. The further constructions and lemmas used to prove this result are detailed in Chapter 10.
405

Advanced Monte Carlo Methods with Applications in Finance

Joshua Chi Chun Chan Unknown Date (has links)
The main objective of this thesis is to develop novel Monte Carlo techniques with emphasis on various applications in finance and economics, particularly in the fields of risk management and asset returns modeling. New stochastic algorithms are developed for rare-event probability estimation, combinatorial optimization, parameter estimation and model selection. The contributions of this thesis are fourfold. Firstly, we study an NP-hard combinatorial optimization problem, the Winner Determination Problem (WDP) in combinatorial auctions, where buyers can bid on bundles of items rather than bidding on them sequentially. We present two randomized algorithms, namely, the cross-entropy (CE) method and the ADAptive Mulitilevel splitting (ADAM) algorithm, to solve two versions of the WDP. Although an efficient deterministic algorithm has been developed for one version of the WDP, it is not applicable for the other version considered. In addition, the proposed algorithms are straightforward and easy to program, and do not require specialized software. Secondly, two major applications of conditional Monte Carlo for estimating rare-event probabilities are presented: a complex bridge network reliability model and several generalizations of the widely popular normal copula model used in managing portfolio credit risk. We show how certain efficient conditional Monte Carlo estimators developed for simple settings can be extended to handle complex models involving hundreds or thousands of random variables. In particular, by utilizing an asymptotic description on how the rare event occurs, we derive algorithms that are not only easy to implement, but also compare favorably to existing estimators. Thirdly, we make a contribution at the methodological front by proposing an improvement of the standard CE method for estimation. The improved method is relevant, as recent research has shown that in some high-dimensional settings the likelihood ratio degeneracy problem becomes severe and the importance sampling estimator obtained from the CE algorithm becomes unreliable. In contrast, the performance of the improved variant does not deteriorate as the dimension of the problem increases. Its utility is demonstrated via a high-dimensional estimation problem in risk management, namely, a recently proposed t-copula model for credit risk. We show that even in this high-dimensional model that involves hundreds of random variables, the proposed method performs remarkably well, and compares favorably to existing importance sampling estimators. Furthermore, the improved CE algorithm is then applied to estimating the marginal likelihood, a quantity that is fundamental in Bayesian model comparison and Bayesian model averaging. We present two empirical examples to demonstrate the proposed approach. The first example involves women's labor market participation and we compare three different binary response models in order to find the one best fits the data. The second example utilizes two vector autoregressive (VAR) models to analyze the interdependence and structural stability of four U.S. macroeconomic time series: GDP growth, unemployment rate, interest rate, and inflation. Lastly, we contribute to the growing literature of asset returns modeling by proposing several novel models that explicitly take into account various recent findings in the empirical finance literature. Specifically, two classes of stylized facts are particularly important. The first set is concerned with the marginal distributions of asset returns. One prominent feature of asset returns is that the tails of their distributions are heavier than those of the normal---large returns (in absolute value) occur much more frequently than one might expect from a normally distributed random variable. Another robust empirical feature of asset returns is skewness, where the tails of the distributions are not symmetric---losses are observed more frequently than large gains. The second set of stylized facts is concerned with the dependence structure among asset returns. Recent empirical studies have cast doubts on the adequacy of the linear dependence structure implied by the multivariate normal specification. For example, data from various asset markets, including equities, currencies and commodities markets, indicate the presence of extreme co-movement in asset returns, and this observation is again incompatible with the usual assumption that asset returns are jointly normally distributed. In light of the aforementioned empirical findings, we consider various novel models that generalize the usual normal specification. We develop efficient Markov chain Monte Carlo (MCMC) algorithms to estimate the proposed models. Moreover, since the number of plausible models is large, we perform a formal Bayesian model comparison to determine the model that best fits the data. In this way, we can directly compare the two approaches of modeling asset returns: copula models and the joint modeling of returns.
406

Critical Sets in Latin Squares and Associated Structures

Bean, Richard Winston Unknown Date (has links)
A critical set in a Latin square of order n is a set of entries in an n×n array which can be embedded in precisely one Latin square of order n, with the property that if any entry of the critical set is deleted, the remaining set can be embedded in more than one Latin square of order n. The number of critical sets grows super-exponentially as the order of the Latin square increases. It is difficult to find patterns in Latin squares of small order (order 5 or less) which can be generalised in the process of creating new theorems. Thus, I have written many algorithms to find critical sets with various properties in Latin squares of order greater than 5, and to deal with other related structures. Some algorithms used in the body of the thesis are presented in Chapter 3; results which arise from the computational studies and observations of the patterns and subsequent results are presented in Chapters 4, 5, 6, 7 and 8. The cardinality of the largest critical set in any Latin square of order n is denoted by lcs(n). In 1978 Curran and van Rees proved that lcs(n)<=n²-n. In Chapter 4, it is shown that lcs(n)<=n²-3n+3. Chapter 5 provides new bounds on the maximum number of intercalates in Latin squares of orders m×2^α (m odd, α>=2) and m×2^α+1 (m odd, α>=2 and α≠3), and a new lower bound on lcs(4m). It also discusses critical sets in intercalate-rich Latin squares of orders 11 and 14. In Chapter 6 a construction is given which verifies the existence of a critical set of size n²÷ 4 + 1 when n is even and n>=6. The construction is based on the discovery of a critical set of size 17 for a Latin square of order 8. In Chapter 7 the representation of Steiner trades of volume less than or equal to nine is examined. Computational results are used to identify those trades for which the associated partial Latin square can be decomposed into six disjoint Latin interchanges. Chapter 8 focusses on critical sets in Latin squares of order at most six and extensive computational routines are used to identify all the critical sets of different sizes in these Latin squares.
407

Critical Sets in Latin Squares and Associated Structures

Bean, Richard Winston Unknown Date (has links)
A critical set in a Latin square of order n is a set of entries in an n×n array which can be embedded in precisely one Latin square of order n, with the property that if any entry of the critical set is deleted, the remaining set can be embedded in more than one Latin square of order n. The number of critical sets grows super-exponentially as the order of the Latin square increases. It is difficult to find patterns in Latin squares of small order (order 5 or less) which can be generalised in the process of creating new theorems. Thus, I have written many algorithms to find critical sets with various properties in Latin squares of order greater than 5, and to deal with other related structures. Some algorithms used in the body of the thesis are presented in Chapter 3; results which arise from the computational studies and observations of the patterns and subsequent results are presented in Chapters 4, 5, 6, 7 and 8. The cardinality of the largest critical set in any Latin square of order n is denoted by lcs(n). In 1978 Curran and van Rees proved that lcs(n)<=n²-n. In Chapter 4, it is shown that lcs(n)<=n²-3n+3. Chapter 5 provides new bounds on the maximum number of intercalates in Latin squares of orders m×2^α (m odd, α>=2) and m×2^α+1 (m odd, α>=2 and α≠3), and a new lower bound on lcs(4m). It also discusses critical sets in intercalate-rich Latin squares of orders 11 and 14. In Chapter 6 a construction is given which verifies the existence of a critical set of size n²÷ 4 + 1 when n is even and n>=6. The construction is based on the discovery of a critical set of size 17 for a Latin square of order 8. In Chapter 7 the representation of Steiner trades of volume less than or equal to nine is examined. Computational results are used to identify those trades for which the associated partial Latin square can be decomposed into six disjoint Latin interchanges. Chapter 8 focusses on critical sets in Latin squares of order at most six and extensive computational routines are used to identify all the critical sets of different sizes in these Latin squares.
408

Bayesian inference on astrophysical binary inspirals based on gravitational-wave measurements

Röver, Christian January 2007 (has links)
Gravitational waves are predicted by general relativity theory. Their existence could be confirmed by astronomical observations, but until today they have not yet been measured directly. A measurement would not only confirm general relativity, but also allow for interesting astronomical observations. Great effort is currently being expended to facilitate gravitational radiation measurement, most notably through earth-bound interferometers (such as LIGO and Virgo), and the planned space-based LISA interferometer. Earth-bound interferometers have recently taken up operation, so that a detection might be made at any time, while the space-borne LISA interferometer is scheduled to be launched within the next decade.Among the most promising signals for a detection are the waves emitted by the inspiral of a binary system of stars or black holes. The observable gravitational-wave signature of such an event is determined by properties of the inspiralling system, which may in turn be inferred from theobserved data. A Bayesian inference framework for the estimation of parameters of binary inspiral events as measured by ground- and space-based interferometers is described here. Furthermore, appropriate computational methods are developed that are necessary for its application in practice. Starting with a simplified model considering only 5 parameters and data from a single earth-bound interferometer, the model is subsequently refined by extending it to 9 parameters, measurements from several interferometers, and more accurate signal waveform approximations. A realistic joint prior density for the 9 parameters is set up. For the LISA application the model is generalised so that the noise spectrum is treated as unknown as well and can be inferred along with the signal parameters. Inference through the posterior distribution is facilitated by the implementation of Markov chain Monte Carlo (MCMC) methods. The posterior distribution exhibits many local modes, and there is only a small "attraction region" around the global mode(s), making it hard, if not impossible, for basic MCMC algorithms to find the relevant region in parameter space. This problem is solved by introducing a parallel tempering algorithm. Closer investigation of its internal functionality yields some insight into a proper setup of this algorithm, which in turn also enables the efficient implementation for the LISA problem with its vastly enlarged parameter space. Parallel programming was used to implement this computationally expensive MCMC algorithm, so that the code can be run efficiently on a computer cluster. In this thesis, a Bayesian approach to gravitational wave astronomy is shown to be feasible and promising.
409

Stochastic modelling of rat invasions among islands in the New Zealand archipelago

Miller, Steven Duncan January 2008 (has links)
This project was formulated with the purpose of advancing knowledge of the invasion dynamics of rats within archipelagos in New Zealand. The concentration on islands reflected the conservation focus of this project - islands are the last refuges for many native New Zealand species that cannot survive in the wild on the mainland. This project can be divided into four areas: 1. Data collection: There was no intent for innovation here, but a deeper understanding of the environments in which rats are born, breed, migrate, and die was developed. 2. Development of tools for data exploration: • A user-friendly point-and-click graphical interface for the R program was designed to allow any user to easily explore simple genetic characteristics of the data. • A novel method for exploring the genetic similarity between individuals was developed and showcased with real data, proving successful in cases of both high and low genetic differentiation, and in detecting likely individual migrants. 3. Improvement of a method for estimating migration: • An attempt was made to improve the Markov chain Monte Carlo procedure underlying this method. • The migration model used by the method was significantly improved, so that it could cope with any level of migration. Previously, results from situations where migration rates were high were invalid. 4. Investigated topics of ecological interest: • Field measurements of rats were used to show that Norway rats tend to have larger masses than ship rats, southern rats are generally larger than northern rats, but the effect on mass of living on an island as opposed to the mainland depends on the latitude. It was also shown that relative tail length is a good species discriminator. • Multiple paternity was confirmed for both Norway and ship rats. This breeding characteristic might form part of the explanation for why rats are such successful invaders. During the project, case studies involving rats on Big South Cape Island, Great Barrier Island and in the Bay of Islands were used to highlight the methods developed, and provided some unexpected and fascinating results.
410

On Defining Sets in Latin Squares and two Intersection Problems, one for Latin Squares and one for Steiner Triple Systems

Thomas Mccourt Unknown Date (has links)
Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 = M \ L is called a latin bitrade. Furthermore T1 and T2 are referred to as latin trades, in which T2 is said to be a disjoint mate of T1 (and vice versa). Drápal (1991) showed that, under certain conditions, a partition of an equilateral triangle of side length n, where n is some integer, into smaller, integer length sided equilateral triangles gives rise to a latin trade within the latin square based on the addition table for the integers modulo n. A partial latin square P of order n is said to be completable if there exists a latin square L of order n such that P ⊆ L. If there is only one such possible latin square, L, of order n then P is said to be uniquely completable and P is called a defining set of L. Furthermore, if C is a uniquely completable partial latin square such that no proper subset of C is uniquely completable, C is said to be a critical set or a minimal defining set. These concepts, namely latin trades and defining sets in latin squares, are intimately connected by the following observation. If L is a latin square and D ⊆ L is a defining set, then D intersects all latin bitrades for which one mate is contained in L. In Part I of this thesis Dr´apal’s result is applied to investigate the structure of certain defining sets in latin squares. The results that are obtained are interesting in themselves; furthermore, the geometric approach to the problem yields additional appealing results. These geometric results are discussed in Chapters 3, 4, 5 and 6. They pertain to partitioning regions (polygons in R2 that satisfy certain obvious conditions) into equilateral, integer length sided, triangles, such that no point, in the region, is a corner of more than three distinct triangles. In Chapter 2 one of the main two theorems on defining sets is established, as is a method for using the above geometric results to prove the nonexistence of certain types of defining sets. In Part II of this thesis, intersection problems, for latin squares and Steiner triple systems, are considered. The seminal works, for problems of these types, are due to Lindner and Rosa (1975) and Fu (1980). A natural progression, from the established literature, for intersection problems between elements in a pair of latin squares or Steiner triple systems is to problems in which the intersection is composed of a number of disjoint configurations (isomorphic copies of some specified partial triple system). In this thesis solutions to two intersection problems for disjoint configurations are detailed. An m-flower, (F,F), is a partial triple system/configuration, such that: F = {{x, yi, zi} | {yi, zi} ∩ {yj , zj} = ∅, for 0 ≤ i, j ≤ m − 1, i 6= j}; and F = UX∈FX. The first such problem considered in this thesis asks for necessary and sufficient conditions for integers k and m ≥ 2 such that a pair of latin squares of order n exists that intersect precisely in k disjoint m-flowers. The necessary terminology, constructions, lemmas and proof for this result are contained in Chapters 7, 8 and 9. The second such problem considered in this thesis asks for necessary and sufficient conditions for integers k such that a pair of Steiner triple systems of order u exists that intersect precisely in k disjoint 2-flowers. This result relies on the solution to the latin square problem and an additional result from Chapter 9. The further constructions and lemmas used to prove this result are detailed in Chapter 10.

Page generated in 0.1454 seconds