arXiv subjects

Dustin A. Cartwright

Publications and source records attributed to Dustin A. Cartwright.

3 recordsLinked to original sources

arXiv2010

The maximum independent sets of de Bruijn graphs of diameter 3

The nodes of the de Bruijn graph B(d,3) consist of all strings of length 3, taken from an alphabet of size d, with edges between words which are distinct substrings of a word of length 4. We give an inductive characterization of the maximum independent sets of the de Bruijn graphs B(d,3) and for the de Bruijn graph of diameter three with loops removed, for arbitrary alphabet size. We derive a recurrence relation and an exponential generating function for their number. This recurrence allows us to construct exponentially many comma-free codes of length 3 with maximal cardinality.

math.CO↗

arXiv2009

Reconstructing Spatiotemporal Gene Expression Data from Partial Observations

Developmental transcriptional networks in plants and animals operate in both space and time. To understand these transcriptional networks it is essential to obtain whole-genome expression data at high spatiotemporal resolution. Substantial amounts of spatial and temporal microarray expression data previously have been obtained for the Arabidopsis root; however, these two dimensions of data have not been integrated thoroughly. Complicating this integration is the fact that these data are heterogeneous and incomplete, with observed expression levels representing complex spatial or temporal mixtures. Given these partial observations, we present a novel method for reconstructing integrated high resolution spatiotemporal data. Our method is based on a new iterative algorithm for finding approximate roots to systems of bilinear equations.

q-bio.GN↗

arXiv2008

Hilbert schemes of 8 points

The Hilbert scheme H^d_n of n points in A^d contains an irreducible component R^d_n which generically represents n distinct points in A^d. We show that when n is at most 8, the Hilbert scheme H^d_n is reducible if and only if n = 8 and d >= 4. In the simplest case of reducibility, the component R^4_8 \subset H^4_8 is defined by a single explicit equation which serves as a criterion for deciding whether a given ideal is a limit of distinct points. To understand the components of the Hilbert scheme, we study the closed subschemes of H_n^d which parametrize those ideals which are homogeneous and have a fixed Hilbert function. These subschemes are a special case of multigraded Hilbert schemes, and we describe their components when the colength is at most 8. In particular, we show that the scheme corresponding to the Hilbert function (1,3,2,1) is the minimal reducible example.

math.AG↗