10 research outputs found
Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
Generalized balance tournament packings (GBTPs) extend the concept of
generalized balanced tournament designs introduced by Lamken and Vanstone
(1989). In this paper, we establish the connection between GBTPs and a class of
codes called equitable symbol weight codes. The latter were recently
demonstrated to optimize the performance against narrowband noise in a general
coded modulation scheme for power line communications. By constructing classes
of GBTPs, we establish infinite families of optimal equitable symbol weight
codes with code lengths greater than alphabet size and whose narrowband noise
error-correcting capability to code length ratios do not diminish to zero as
the length grows
Breakout group allocation schedules and the social golfer problem with adjacent group sizes
The current pandemic has led schools and universities to turn to online meeting software solutions such as Zoom and Microsoft Teams. The teaching experience can be enhanced via the use of breakout rooms for small group interaction. Over the course of a class (or over several classes), the class will be allocated to breakout groups multiple times over several rounds. It is desirable to mix the groups as much as possible, the ideal being that no two students appear in the same group in more than one round. In this paper, we discuss how the problem of scheduling balanced allocations of students to sequential breakout rooms directly corresponds to a novel variation of a well-known problem in combinatorics (the social golfer problem), which we call the social golfer problem with adjacent group sizes. We explain how solutions to this problem can be obtained using constructions from combinatorial design theory and how they can be used to obtain good, balanced breakout room allocation schedules. We present our solutions for up to 50 students and introduce an online resource that educators can access to immediately generate suitable allocation schedules
Applications of finite geometries to designs and codes
This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures.
A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples.
We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs.
Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes
Biogeochemical significance and biomarker potential of novel glycerolipids and respiratory quinones in the marine environment
Microorganisms catalyze processes which shape the chemistry of the biosphere, drive global element cycles, and ultimately influence the composition of Earthâ s surface and interior on geological timescales. Microbial lipids provide crucial information about the distribution, activity, and adaptation of microbial communities in both modern and ancient environments. In this thesis, advanced chromatographic methods were developed that have significantly expanded the analytical window for microbial lipidomics in complex environmental sample matrices and have paved the way for the discovery of novel microbial biomarkers. Application of the novel protocols to samples from microbial cultures, the hypersaline Discovery Basin and the stratified water column and sediments of the Black Sea revealed an exceptional diversity of lipids. The combination of respiratory quinone and core and intact polar lipid analysis provided detailed information about microbial community composition and biogeochemical processes the microbes are mediating
Recommended from our members
Configurations and colouring problems in block designs
A Steiner triple system of order v (STS(v)) is called x-chromatic if x is the smallest number of colours needed to avoid monochromatic blocks. Amongst our results on colour class structures we show that every STS (19) is 3- or 4-chromatic, that every 3-chromatic STS(19) has an equitable 3-colouring (meaning that the colours are as uniformly distributed as possible), and that for all admissible v > 25 there exists a 3-chromatic STS(v) which does not admit an equitable 3-colouring. We obtain a formula for the number of independent sets in an STS(v) and use it to show that an STS(21) must contain eight independent points. This leads to a simple proof that every STS(21) is 3- or 4-chromatic. Substantially extending existing tabulations, we provide an enumeration of STS trades of up to 12 blocks, and as an application we show that any pair of STS(15)s must be 3-1-isomorphic. We prove a general theorem that enables us to obtain formulae for the frequencies of occurrence of configurations in triple systems. Some of these are used in our proof that for v > 25 no STS(u) has a 3-existentially closed block intersection graph. Of specific interest in connection with a conjecture of Erdos are 6-sparse and perfect Steiner triple systems, characterized by the avoidance of specific configurations. We describe two direct constructions that produce 6-sparse STS(v)s and we give a recursive construction that preserves 6-sparseness. Also we settle an old question concerning the occurrence of perfect block transitive Steiner triple systems. Finally, we consider Steiner 5(2,4, v) designs that are built from collections of Steiner triple systems. We solve a longstanding problem by constructing such systems with v = 61 (Zoe’s design) and v = 100 (the design of the century)
Aeronautical engineering: A cumulative index to a continuing bibliography
This bibliography is a cumulative index to the abstracts contained in NASA SP-7037(210) through NASA SP-7037(221) of Aeronautical Engineering: A Continuing Bibliography. NASA SP-7037 and its supplements have been compiled through the cooperative efforts of the American Institute of Aeronautics and Astronautics (AIAA) and the National Aeronautics and Space Administration (NASA). This cumulative index includes subject, personal author, corporate source, foreign technology, contract number, report number, and accession number indexes