The slopes determined by n points in the plane

Let $m_{12}$, $m_{13}$, ..., $m_{n-1,n}$ be the slopes of the $\binom{n}{2}$ lines connecting $n$ points in general position in the plane. The ideal $I_n$ of all algebraic relations among the $m_{ij}$ defines a configuration space called the {\em slope variety of the complete graph}. We prove that $I_n$ is reduced and Cohen-Macaulay, give an explicit Gr\"obner basis for it, and compute its Hilbert series combinatorially. We proceed chiefly by studying the associated Stanley-Reisner simplicial complex, which has an intricate recursive structure. In addition, we are able to answer many questions about the geometry of the slope variety by translating them into purely combinatorial problems concerning enumeration of trees.Comment: 36 pages; final published versio

What determines the properties of the X-ray jets in FR-I radio galaxies?

We present the first large sample investigation of the properties of jets in Fanaroff and Riley type I radio galaxies (FR-I) based on data from the Chandra archive. We explore relations between the properties of the jets and the properties of host galaxies in which they reside. We find previously unknown correlations to exist, relating photon index, volume emissivity, jet volume and luminosity, and find that the previously long held assumption of a relationship between luminosities at radio and X-ray wavelengths is linear in nature when bona fide FR-I radio galaxies are considered. In addition, we attempt to constrain properties which may play a key role in determination of the diffuse emission process. We test a simple model in which large-scale magnetic field variations are primarily responsible for determining jet properties; however, we find that this model is inconsistent with our best estimates of the relative magnetic field strength in our sample. Models of particle acceleration should attempt to account for our results if they are to describe FR-I jets accurately.Comment: 14 Pages, 2 Figures, 9 Tables, Final Version, Published in MNRA

Cyclotomic and simplicial matroids

Two naturally occurring matroids representable over Q are shown to be dual: the {\it cyclotomic matroid} $\mu_n$ represented by the $n^{th}$ roots of unity $1,\zeta,\zeta^2,...,\zeta^{n-1}$ inside the cyclotomic extension $Q(\zeta)$, and a direct sum of copies of a certain simplicial matroid, considered originally by Bolker in the context of transportation polytopes. A result of Adin leads to an upper bound for the number of $Q$-bases for $Q(\zeta)$ among the $n^{th}$ roots of unity, which is tight if and only if $n$ has at most two odd prime factors. In addition, we study the Tutte polynomial of $\mu_n$ in the case that $n$ has two prime factors.Comment: 9 pages, 1 figur

Geometry of graph varieties

A picture P of a graph G = (V,E) consists of a point P(v) for each vertex v in V and a line P(e) for each edge e in E, all lying in the projective plane over a field k and subject to containment conditions corresponding to incidence in G. A graph variety is an algebraic set whose points parametrize pictures of G. We consider three kinds of graph varieties: the picture space X(G) of all pictures, the picture variety V(G), an irreducible component of X(G) of dimension 2|V|, defined as the closure of the set of pictures on which all the P(v) are distinct, and the slope variety S(G), obtained by forgetting all data except the slopes of the lines P(e). We use combinatorial techniques (in particular, the theory of combinatorial rigidity) to obtain the following geometric and algebraic information on these varieties: (1) a description and combinatorial interpretation of equations defining each variety set-theoretically; (2) a description of the irreducible components of X(G); and (3) a proof that V(G) and S(G) are Cohen-Macaulay when G satisfies a sparsity condition, rigidity independence. In addition, our techniques yield a new proof of the equality of two matroids studied in rigidity theory.Comment: 19 pages. To be published in Transactions of the AM