Near-source dispersion of contaminant from an elevated line-source

The use of a time-dependent-diffusivity in the solution of the convective-diffusion equation is explored. The results are shown to compare favourably with near-source experimental data.     

The Order of Automorphisms of Quasigroups

We prove quadratic upper bounds on the order of any autotopism of a quasigroup or Latin square, and hence also on the order of any automorphism of a Steiner triple system or 1‐factorization of a complete graph. A corollary is that a permutation σ chosen uniformly at random from the symmetric group will almost surely not be an automorphism of a Steiner triple system of order n, a quasigroup of order n or a 1‐factorization of the complete graph . Nor will σ be one component of an autotopism for any Latin square of order n. For groups of order n it is known that automorphisms must have order less than n, but we show that quasigroups of order n can have automorphisms of order greater than n. The smallest such quasigroup has order 7034. We also show that quasigroups of prime order can possess autotopisms that consist of three permutations with different cycle structures. Our results answer three questions originally posed by D.  Stones.     

Rectangular-radial drawings of cubic plane graphs

Rectangular drawings and rectangular duals can be naturally extended to other surfaces. In this paper, we extend rectangular drawings and rectangular duals to drawings on a cylinder. The extended drawings are called rectangular-radial drawings and rectangular-radial duals. Rectangular-radial drawings correspond to periodic rectangular tilings of a 1-dimensional strip. We establish a necessary and sufficient condition for plane graphs with maximum degree 3 to have rectangular-radial drawings and a necessary and sufficient condition for triangulated plane graphs to have rectangular-radial duals. Furthermore, we present three linear time algorithms under three different conditions for finding a rectangular-radial drawing for a given cubic plane graph, if one exists.     

Asymptotically liberating sequences of random unitary matrices

A fundamental result of free probability theory due to Voiculescu and subsequently refined by many authors states that conjugation by independent Haar-distributed random unitary matrices delivers asymptotic freeness. In this paper we exhibit many other systems of random unitary matrices that, when used for conjugation, lead to freeness. We do so by first proving a general result asserting “asymptotic liberation” under quite mild conditions, and then we explain how to specialize these general results in a striking way by exploiting Hadamard matrices. In particular, we recover and generalize results of the second-named author and of Tulino, Caire, Shamai and Verdú.     

Saturation of Berge hypergraphs

Given a graph $F$, a hypergraph is a Berge- $F$ if it can be obtained by expanding each edge in $F$ to a hyperedge containing it. A hypergraph $H$ is Berge-$F$-saturated if $H$ does not contain a subhypergraph that is a Berge-$F$, but for any edge $e\in E\left(\overline{H}\right)$, $H+e$ does. The $k$-uniform saturation number of Berge-$F$ is the minimum number of edges in a $k$-uniform Berge-$F$-saturated hypergraph on $n$ vertices. For $k=2$ this definition coincides with the classical definition of saturation for graphs. In this paper we study the saturation numbers for Berge triangles, paths, cycles, stars and matchings in $k$-uniform hypergraphs.     

Characterizing projective spaces on deformations of Hilbert schemes of K3 surfaces

We seek to characterize homology classes of Lagrangian projective spaces embedded in irreducible holomorphic‐symplectic manifolds, up to the action of the monodromy group. This paper addresses the case of manifolds deformation‐equivalent to the Hilbert scheme of length‐3 subschemes of a K3 surface. The class of the projective space in the cohomology ring has prescribed intersection properties, which translate into Diophantine equations. Possible homology classes correspond to integral points on an explicit elliptic curve; our proof entails showing that the only such point is two‐torsion. © 2011 Wiley Periodicals, Inc.     

L-functions of second-order cusp forms

We discuss equivalent definitions of holomorphic second-order cusp forms and prove bounds on their Fourier coefficients. We also introduce their associated L-functions, prove functional equations for twisted versions of these L-functions and establish a criterion for a Dirichlet series to originate from a second order form. In the last section we investigate the effect of adding an assumption of periodicity to this criterion. 2000 Mathematics Subject Classification Primary—11F12, 11F66 G. Mason: Research supported in part by NSF Grant DMS 0245225. C. O’Sullivan: Research supported in part by PSC CUNY Research Award No. 65453-00 34.     

Longitudinal dispersion in flows that are homogeneous in the streamwise direction

The longitudinal dispersion of a pulse of passive scalar contaminant within a flow that is unchanging in the downstream direction is established to be a function of the mean-velocity-history of molecules from a uniform distribution on the flow cross-section. The specific case of laminar flow between parallel plates is investigated in detail, wherein it is found that $$\frac{1}{2}\frac{{\overline {d\eta (t)^2 } }}{{dt}} = \frac{9}{{2\pi ^6 }}\frac{{\bar U^2 d^2 }}{k}\sum\limits_{n = 1}^\infty {\frac{1}{{n^6 }}} \left( {1 - \exp \left( {\frac{{ - (2n\pi )^2 tK}}{{d^2 }}} \right)} \right),$$ where η(t) is the displacement relative to an axis located byūt whenū is the discharge velocity,K is the molecular diffusivity andd is the plate separation. This flow is used to show that the molecule mean velocity-histories can be approximated by a function that does not directly depend on the release position of the molecule on the flow cross-section. The results of a numerical simulation of the dispersion in this flow are presented for comparison.     

A shortest path-based approach to the multileaf collimator sequencing problem

The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of an integer matrix into a weighted sequence of binary matrices whose rows satisfy a consecutive ones property. Minimising the cardinality of the decomposition is an important objective and has been shown to be strongly NP-hard, even for a matrix restricted to a single column or row. We show that in this latter case it can be solved efficiently as a shortest path problem, giving a simple proof that the one-row problem is fixed-parameter tractable in the maximum intensity. We develop new linear and constraint programming models exploiting this result. Our approaches significantly improve the best known for the problem, bringing real-world sized problem instances within reach of exact algorithms.