An Enumeration of Graphical Designs

Let $\Psi(t,k)$ denote the set of pairs $(v,\lambda)$ for which there exists a graphical $t$-$(v,k,\lambda)$ design. Most results on graphical designs have gone to show the finiteness of $\Psi(t,k)$ when $t$ and $k$ satisfy certain conditions. The exact determination of $\Psi(t,k)$ for specified $t$ and $k$ is a hard problem and only $\Psi(2,3)$, $\Psi(2,4)$, $\Psi(3,4)$, $\Psi(4,5)$, and $\Psi(5,6)$ have been determined. In this paper, we determine completely the sets $\Psi(2,5)$ and $\Psi(3,5)$. As a result, we find more than 270000 inequivalent graphical designs, and more than 8000 new parameter sets for which there exists a graphical design. Prior to this, graphical designs are known for only 574 parameter sets.Comment: 16 page

Constructions of tt-designs from weighing matrices and walk-regular graphs

We provide a method to construct $t$-designs from weighing matrices and walk-regular graphs. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to a question of Gunderson and Semeraro JCTB 2017. We explore variations of our method on some matrices that satisfy certain combinatorial restrictions. In particular, we show that there exist various infinite families of partially balanced incomplete block designs with block size four on the binary Hamming schemes and the $3$-class association schemes attached to symmetric designs, and regular pairwise balanced designs with block sizes three and four.Comment: 31 page

Contemporary Coding Theory

Coding Theory naturally lies at the intersection of a large number of disciplines in pure and applied mathematics. A multitude of methods and means has been designed to construct, analyze, and decode the resulting codes for communication. This has suggested to bring together researchers in a variety of disciplines within Mathematics, Computer Science, and Electrical Engineering, in order to cross-fertilize generation of new ideas and force global advancement of the field. Areas to be covered are Network Coding, Subspace Designs, General Algebraic Coding Theory, Distributed Storage and Private Information Retrieval (PIR), as well as Code-Based Cryptography

Integer linear programming techniques for constant dimension codes and related structures

The lattice of subspaces of a finite dimensional vector space over a finite field is combined with the so-called subspace distance or the injection distance a metric space. A subset of this metric space is called subspace code. If a subspace code contains solely elements, so-called codewords, with equal dimension, it is called constant dimension code, which is abbreviated as CDC. The minimum distance is the smallest pairwise distance of elements of a subspace code. In the case of a CDC, the minimum distance is equivalent to an upper bound on the dimension of the pairwise intersection of any two codewords. Subspace codes play a vital role in the context of random linear network coding, in which data is transmitted from a sender to multiple receivers such that participants of the communication forward random linear combinations of the data. The two main problems of subspace coding are the determination of the cardinality of largest subspace codes and the classification of subspace codes. Using integer linear programming techniques and symmetry, this thesis answers partially the questions above while focusing on CDCs. With the coset construction and the improved linkage construction, we state two general constructions, which improve on the best known lower bound of the cardinality in many cases. A well-structured CDC which is often used as building block for elaborate CDCs is the lifted maximum rank distance code, abbreviated as LMRD. We generalize known upper bounds for CDCs which contain an LMRD, the so-called LMRD bounds. This also provides a new method to extend an LMRD with additional codewords. This technique yields in sporadic cases best lower bounds on the cardinalities of largest CDCs. The improved linkage construction is used to construct an infinite series of CDCs whose cardinalities exceed the LMRD bound. Another construction which contains an LMRD together with an asymptotic analysis in this thesis restricts the ratio between best known lower bound and best known upper bound to at least 61.6% for all parameters. Furthermore, we compare known upper bounds and show new relations between them. This thesis describes also a computer-aided classification of largest binary CDCs in dimension eight, codeword dimension four, and minimum distance six. This is, for non-trivial parameters which in addition do not parametrize the special case of partial spreads, the third set of parameters of which the maximum cardinality is determined and the second set of parameters with a classification of all maximum codes. Provable, some symmetry groups cannot be automorphism groups of large CDCs. Additionally, we provide an algorithm which examines the set of all subgroups of a finite group for a given, with restrictions selectable, property. In the context of CDCs, this algorithm provides on the one hand a list of subgroups, which are eligible for automorphism groups of large codes and on the other hand codes having many symmetries which are found by this method can be enlarged in a postprocessing step. This yields a new largest code in the smallest open case, namely the situation of the binary analogue of the Fano plane

Real-time Measurement and Control of Urban Stormwater Systems

Urban watersheds are being stressed beyond their capacity as storms are becoming more frequent and intense. Flash flooding is the leading cause of natural disaster deaths in the United States. Simultaneously, population pressures are changing landscapes and impairing water quality by altering the composition of urban stormwater runoff. Presently, the only solution to combat these challenges relies on the construction of larger infrastructure, which is cost prohibitive for most cities and communities. Advances in technology and autonomous systems promise to usher in a new generation of “smart” stormwater systems, which will use city-scale sensing and control to instantly “redesign” themselves in response to changing inputs. By dynamically controlling pumps, valves and gates throughout the entire city this paradigm promises to push the performance of existing assets without requiring the construction of new infrastructure. This will allow for entire urban watersheds to be dynamically controlled to meet a variety of desired outcomes. Despite technological advances and an established fundamental knowledge of water systems, it is presently entirely unclear how “smart” stormwater systems can actually be built. This dissertation conducts a review of existing “static” solutions and provides an assessment of a number of limited, but highly promising, real-world control studies. An analysis of sensor network scalability is then carried out, focusing on how large water sensor networks can be enabled by leveraging wireless connectivity and web-services. A study of urban water quality follows, which shows how real-time data improve our watershed-scale understanding of pollutant loads during storm events. In turn, through an unprecedented real-world study, it is illustrated how this improved understanding can be used to control flows across a watershed. A feedback control-based approach is then introduced to enable the control of urban watersheds. Through extensive simulation, this framework is applied to identify which control assets have the highest potential to improve watershed performance and to determine how many sites must be retrofitted to achieve desired outcomes. Finally, an analysis of input uncertainty is carried out, which quantifies the importance of weather forecasts in improving control performance across the scale of urban headwater catchments. The dissertation closes by laying out future directions in the emerging field of “smart” stormwater research.PHDCivil EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/140797/1/bpwong_1.pd

Business Cycles in Economics

The business cycles are generated by the oscillating macro-/micro-/nano- economic output variables in the economy of the scale and the scope in the amplitude/frequency/phase/time domains in the economics. The accurate forward looking assumptions on the business cycles oscillation dynamics can optimize the financial capital investing and/or borrowing by the economic agents in the capital markets. The book's main objective is to study the business cycles in the economy of the scale and the scope, formulating the Ledenyov unified business cycles theory in the Ledenyov classic and quantum econodynamics