Diagonal forms, linear algebraic methods and Ramsey-type problems

This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M. Wilson and the author find the general formula for the Smith normal form or diagonal form of N_t(H) for all simple graphs H and for a very general class of t-uniform hypergraphs H.

As a continuation, the author determines the formula for diagonal forms of integer matrices obtained from other combinatorial structures, including incidence matrices for subgraphs of a complete bipartite graph and inclusion matrices for multisets.

One major application of diagonal forms is in zero-sum Ramsey theory. For instance, Caro's results in zero-sum Ramsey numbers for graphs and Caro and Yuster's results in zero-sum bipartite Ramsey numbers can be reproduced. These results are further generalized to t-uniform hypergraphs. Other applications include signed bipartite graph designs.

Research results on some other problems are also included in this thesis, such as a Ramsey-type problem on equipartitions, Hartman's conjecture on large sets of designs and a matroid theory problem proposed by Welsh.

Multipole moments in general relativity and dynamical perturbations of black-hole magnetospheres

This thesis consists of two parts. In Part I, we develop a multipole moment formalism in general relativity and use it to analyze the motion and precession of compact bodies. More specifically, the generic, vacuum, dynamical gravitational field of the exterior universe in the vicinity of a freely moving body is expanded in positive powers of the distance r away from the body's spatial origin (i.e., in the distance r from its timelike-geodesic world line). The expansion coefficients, called "external multipole moments,'' are defined covariantly in terms of the Riemann curvature tensor and its spatial derivatives evaluated on the body's central world line. In a carefully chosen class of de Donder coordinates, the expansion of the external field involves only integral powers of r ; no logarithmic terms occur. The expansion is used to derive higher-order corrections to previously known laws of motion and precession for black holes and other bodies. The resulting laws of motion and precession are expressed in terms of couplings of the time derivatives of the body's quadrupole and octopole moments to the external moments, i.e., to the external curvature and its gradient.

In part II, we study the interaction of magnetohydrodynamic (MHD) waves in a black-hole magnetosphere with the "dragging of inertial frames" effect of the hole's rotation - i.e., with the hole's "gravitomagnetic field." More specifically: we first rewrite the laws of perfect general relativistic magnetohydrodynamics (GRMHD) in 3+1 language in a general spacetime, in terms of quantities (magnetic field, flow velocity, ...) that would be measured by the ''fiducial observers” whose world lines are orthogonal to (arbitrarily chosen) hypersurfaces of constant time. We then specialize to a stationary spacetime and MHD flow with one arbitrary spatial symmetry (e.g., the stationary magnetosphere of a Kerr black hole); and for this spacetime we reduce the GRMHD equations to a set of algebraic equations. The general features of the resulting stationary, symmetric GRMHD magnetospheric solutions are discussed, including the Blandford-Znajek effect in which the gravitomagnetic field interacts with the magnetosphere to produce an outflowing jet. Then in a specific model spacetime with two spatial symmetries, which captures the key features of the Kerr geometry, we derive the GRMHD equations which govern weak, linealized perturbations of a stationary magnetosphere with outflowing jet. These perturbation equations are then Fourier analyzed in time t and in the symmetry coordinate x, and subsequently solved numerically. The numerical solutions describe the interaction of MHD waves with the gravitomagnetic field. It is found that, among other features, when an oscillatory external force is applied to the region of the magnetosphere where plasma (e⁺e^-) is being created, the magnetosphere responds especially strongly at a particular, resonant, driving frequency. The resonant frequency is that for which the perturbations appear to be stationary (time independent) in the common rest frame of the freshly created plasma and the rotating magnetic field lines. The magnetosphere of a rotating black hole, when buffeted by nonaxisymmetric magnetic fields anchored in a surrounding accretion disk, might exhibit an analogous resonance. If so then the hole's outflowing jet might be modulated at resonant frequencies ω=(m/2) Ω_H where m is an integer and Ω_H is the hole's angular velocity.

Algebraic Techniques in Coding Theory: Entropy Vectors, Frames, and Constrained Coding

The study of codes, classically motivated by the need to communicate information reliably in the presence of error, has found new life in fields as diverse as network communication, distributed storage of data, and even has connections to the design of linear measurements used in compressive sensing. But in all contexts, a code typically involves exploiting the algebraic or geometric structure underlying an application. In this thesis, we examine several problems in coding theory, and try to gain some insight into the algebraic structure behind them.

The first is the study of the entropy region - the space of all possible vectors of joint entropies which can arise from a set of discrete random variables. Understanding this region is essentially the key to optimizing network codes for a given network. To this end, we employ a group-theoretic method of constructing random variables producing so-called "group-characterizable" entropy vectors, which are capable of approximating any point in the entropy region. We show how small groups can be used to produce entropy vectors which violate the Ingleton inequality, a fundamental bound on entropy vectors arising from the random variables involved in linear network codes. We discuss the suitability of these groups to design codes for networks which could potentially outperform linear coding.

The second topic we discuss is the design of frames with low coherence, closely related to finding spherical codes in which the codewords are unit vectors spaced out around the unit sphere so as to minimize the magnitudes of their mutual inner products. We show how to build frames by selecting a cleverly chosen set of representations of a finite group to produce a "group code" as described by Slepian decades ago. We go on to reinterpret our method as selecting a subset of rows of a group Fourier matrix, allowing us to study and bound our frames' coherences using character theory. We discuss the usefulness of our frames in sparse signal recovery using linear measurements.

The final problem we investigate is that of coding with constraints, most recently motivated by the demand for ways to encode large amounts of data using error-correcting codes so that any small loss can be recovered from a small set of surviving data. Most often, this involves using a systematic linear error-correcting code in which each parity symbol is constrained to be a function of some subset of the message symbols. We derive bounds on the minimum distance of such a code based on its constraints, and characterize when these bounds can be achieved using subcodes of Reed-Solomon codes.