3,678 research outputs found
Decision trees, monotone functions, and semimatroids
We define decision trees for monotone functions on a simplicial complex. We
define homology decidability of monotone functions, and show that various
monotone functions related to semimatroids are homology decidable. Homology
decidability is a generalization of semi-nonevasiveness, a notion due to
Jonsson. The motivating example is the complex of bipartite graphs, whose Betti
numbers are unknown in general.
We show that these monotone functions have optimum decision trees, from which
we can compute relative Betti numbers of related pairs of simplicial complexes.
Moreover, these relative Betti numbers are coefficients of evaluations of the
Tutte polynomial, and every semimatroid collapses onto its broken circuit
complex.Comment: 16 page
Chromatic Polynomials and Rings in Species
Abstract. We present a generalization of the chromatic polynomial, and chromatic symmetric function, arising in the study of combinatorial species. These invariants are defined for modules over lattice rings in species. The primary examples are graphs and set partitions. For these new invariants, we present analogues of results regarding stable partitions, the bond lattice, the deletion-contraction recurrence, and the subset expansion formula. We also present two detailed examples, one related to enumerating subgraphs by their blocks, and a second example related to enumerating subgraphs of a directed graph by their strongly connected components. Resumé. Nous présentons une généralisation du polynôme chromatique et de la fonction symétrique chromatique, qui apparaissent dans l’étude des espèces de structures. Ces invariants sont définis pour modules sur anneaux réticulés aux espéces de structures. Les exemples principaux sont les graphes et les partitions d’entiers. Pour ces invariants nouveaux, nous présentons d’analogues de rsultats concernants les partitions stables, le treillis de liaisons, la rélation de contraction-suppression, et la formule d’expansion en termes de sous-ensembles. Nous présentons aussi deux exemples détaill´s, l’un lié à l’énumération des sous-graphes par ses blocs, et l’autre lié à l’énumération des sousgraphes d’un graphe dirigé par ses composantes fortement connexes
The Discrete Fundamental Group of the Associahedron, and the Exchange Module
The associahedron is an object that has been well studied and has numerous
applications, particularly in the theory of operads, the study of non-crossing
partitions, lattice theory and more recently in the study of cluster algebras.
We approach the associahedron from the point of view of discrete homotopy
theory. We study the abelianization of the discrete fundamental group, and show
that it is free abelian of rank . We also find a combinatorial
description for a basis of this rank. We also introduce the exchange module of
the type cluster algebra, used to model the relations in the cluster
algebra. We use the discrete fundamental group to the study of exchange module,
and show that it is also free abelian of rank .Comment: 16 pages, 4 figure
ALMA and VLA Observations of the HD 141569 System
We present VLA 9 mm (33 GHz) observations of the HD 141569 system from
semester 16A. The observations achieve a resolution of 0.25 arcsec (
au) and a sensitivity of . We find (1) a Jy point source at the location of HD 141569A that shows potential
variability, (2) the detected flux is contained within the SED-inferred central
clearing of the disc meaning the spectral index of the dust disc is steeper
than previously inferred, and (3) the M dwarf companions are also detected and
variable. Previous lower-resolution VLA observations (semester 14A) found a
higher flux density, interpreted as solely dust emission. When combined with
ALMA observations, the VLA 14A observations suggested the spectral index and
grain size distribution of HD 141569's disc was shallow and an outlier among
debris systems. Using archival ALMA observations of HD 141569 at 0.87 mm and
2.9 mm we find a dust spectral index of . The
VLA 16A flux corresponds to a brightness temperature of K,
suggesting strong non-disc emission is affecting the inferred grain properties.
The VLA 16A flux density of the M2V companion HD 141569B is Jy,
corresponding to a brightness temperature of K and
suggesting significant stellar variability when compared to the VLA14A
observations, which are smaller by a factor of .Comment: Accepted for publication in MNRAS, 8 pages, 6 figure
MESAS: Measuring the Emission of Stellar Atmospheres at Submm/mm wavelengths
In the early stages of planet formation, small dust grains grow to become mm
sized particles in debris disks around stars. These disks can in principle be
characterized by their emission at submillimeter and millimeter wavelengths.
Determining both the occurrence and abundance of debris in unresolved
circumstellar disks of A-type main-sequence stars requires that the stellar
photospheric emission be accurately modeled. To better constrain the
photospheric emission for such systems, we present observations of Sirius A, an
A-type star with no known debris, from the JCMT, SMA, and VLA at 0.45, 0.85,
0.88, 1.3, 6.7, and 9.0 mm. We use these observations to inform a PHOENIX model
of Sirius A's atmosphere. We find the model provides a good match to these data
and can be used as a template for the submm/mm emission of other early A-type
stars where unresolved debris may be present. The observations are part of an
ongoing observational campaign entitled Measuring the Emission of Stellar
Atmospheres at Submm/mm wavelengths (MESAS)Comment: 17 pages, 1 figure, Accepted to AJ on April 25th 201
Astronomy in the Cloud: Using MapReduce for Image Coaddition
In the coming decade, astronomical surveys of the sky will generate tens of
terabytes of images and detect hundreds of millions of sources every night. The
study of these sources will involve computation challenges such as anomaly
detection and classification, and moving object tracking. Since such studies
benefit from the highest quality data, methods such as image coaddition
(stacking) will be a critical preprocessing step prior to scientific
investigation. With a requirement that these images be analyzed on a nightly
basis to identify moving sources or transient objects, these data streams
present many computational challenges. Given the quantity of data involved, the
computational load of these problems can only be addressed by distributing the
workload over a large number of nodes. However, the high data throughput
demanded by these applications may present scalability challenges for certain
storage architectures. One scalable data-processing method that has emerged in
recent years is MapReduce, and in this paper we focus on its popular
open-source implementation called Hadoop. In the Hadoop framework, the data is
partitioned among storage attached directly to worker nodes, and the processing
workload is scheduled in parallel on the nodes that contain the required input
data. A further motivation for using Hadoop is that it allows us to exploit
cloud computing resources, e.g., Amazon's EC2. We report on our experience
implementing a scalable image-processing pipeline for the SDSS imaging database
using Hadoop. This multi-terabyte imaging dataset provides a good testbed for
algorithm development since its scope and structure approximate future surveys.
First, we describe MapReduce and how we adapted image coaddition to the
MapReduce framework. Then we describe a number of optimizations to our basic
approach and report experimental results comparing their performance.Comment: 31 pages, 11 figures, 2 table
- …