Characterizing Block Graphs in Terms of their Vertex-Induced Partitions

Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\subseteq \binom{V}{2}$, we will show that $1.$ the (necessarily unique) smallest block graph with vertex set $V$ whose edge set contains $E$ is uniquely determined by the $V$-indexed family ${\bf P}_G:=\big(\pi_0(G^{(v)})\big)_{v \in V}$ of the various partitions $\pi_0(G^{(v)})$ of the set $V$ into the set of connected components of the graph $G^{(v)}:=(V,\{e\in E: v\notin e\})$, $2.$ the edge set of this block graph coincides with set of all $2$-subsets $\{u,v\}$ of $V$ for which $u$ and $v$ are, for all $w\in V-\{u,v\}$, contained in the same connected component of $G^{(w)}$, $3.$ and an arbitrary $V$-indexed family ${\bf P}p=({\bf p}_v)_{v \in V}$ of partitions $\pi_v$ of the set $V$ is of the form ${\bf P}p={\bf P}p_G$ for some connected simple graph $G=(V,E)$ with vertex set $V$ as above if and only if, for any two distinct elements $u,v\in V$, the union of the set in ${\bf p}_v$ that contains $u$ and the set in ${\bf p}_u$ that contains $v$ coincides with the set $V$, and $\{v\}\in {\bf p}_v$ holds for all $v \in V$. As well as being of inherent interest to the theory of block graphs, these facts are also useful in the analysis of compatible decompositions and block realizations of finite metric spaces

Minimum triplet covers of binary phylogenetic X-trees

Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial result ensures that such trees can be uniquely reconstructed from the distances between the leaves (when the edges are given any strictly positive lengths). Moreover, a linear number of these pairwise distance values suffices to determine both the tree and its edge lengths. A natural set of pairs of leaves is provided by any `triplet cover' of the tree (based on the fact that each non-leaf vertex is the median vertex of three leaves). In this paper we describe a number of new results concerning triplet covers of minimum size. In particular, we characterize such covers in terms of an associated graph being a 2-tree. Also, we show that minimum triplet covers are `shellable' and thereby provide a set of pairs for which the inter-leaf distance values will uniquely determine the underlying tree and its associated branch lengths

Blocks and Cut Vertices of the Buneman Graph

Given a set \Sg of bipartitions of some finite set $X$ of cardinality at least 2, one can associate to \Sg a canonical $X$-labeled graph \B(\Sg), called the Buneman graph. This graph has several interesting mathematical properties - for example, it is a median network and therefore an isometric subgraph of a hypercube. It is commonly used as a tool in studies of DNA sequences gathered from populations. In this paper, we present some results concerning the {\em cut vertices} of \B(\Sg), i.e., vertices whose removal disconnect the graph, as well as its {\em blocks} or 2-{\em connected components} - results that yield, in particular, an intriguing generalization of the well-known fact that \B(\Sg) is a tree if and only if any two splits in \Sg are compatible

A Grassmann algebra for matroids

We introduce an idempotent analogue of the exterior algebra for which the theory of tropical linear spaces (and valuated matroids) can be seen in close analogy with the classical Grassmann algebra formalism for linear spaces. The top wedge power of a tropical linear space is its Plucker vector, which we view as a tensor, and a tropical linear space is recovered from its Plucker vector as the kernel of the corresponding wedge multiplication map. We prove that an arbitrary d-tensor satisfies the tropical Plucker relations (valuated exchange axiom) if and only if the d-th wedge power of the kernel of wedge-multiplication is free of rank one. This provides a new cryptomorphism for valuated matroids, including ordinary matroids as a special case

Recognizing Treelike k-Dissimilarities

A k-dissimilarity D on a finite set X, |X| >= k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edge-weighted trees T with leaf-set X: Given a subset Y of X of size k, D(Y) is defined to be the total length of the smallest subtree of T with leaf-set Y . In case k = 2, it is well-known that 2-dissimilarities arising in this way can be characterized by the so-called "4-point condition". However, in case k > 2 Pachter and Speyer recently posed the following question: Given an arbitrary k-dissimilarity, how do we test whether this map comes from a tree? In this paper, we provide an answer to this question, showing that for k >= 3 a k-dissimilarity on a set X arises from a tree if and only if its restriction to every 2k-element subset of X arises from some tree, and that 2k is the least possible subset size to ensure that this is the case. As a corollary, we show that there exists a polynomial-time algorithm to determine when a k-dissimilarity arises from a tree. We also give a 6-point condition for determining when a 3-dissimilarity arises from a tree, that is similar to the aforementioned 4-point condition.Comment: 18 pages, 4 figure

Constraints on neutrino masses from WMAP5 and BBN in the lepton asymmetric universe

In this paper, we put constraints on neutrino properties such as mass $m_{\nu}$ and degeneracy parameters $\xi_i$ from WMAP5 data and light element abundances by using a Markov chain Monte Carlo (MCMC) approach. In order to take consistently into account the effects of the degeneracy parameters, we run the Big Bang Nucleosynthesis code for each value of $\xi_i$ and the other cosmological parameters to estimate the Helium abundance, which is then used to calculate CMB anisotropy spectra instead of treating it as a free parameter. We find that the constraint on $m_{\nu}$ is fairly robust and does not vary very much even if the lepton asymmetry is allowed, and is given by $\sum m_\nu < 1.3 \rm eV$ ($95$).Comment: 19 pages, 7 figures, 5 table

Optimally Dense Packings for Fully Asymptotic Coxeter Tilings by Horoballs of Different Types

The goal of this paper to determine the optimal horoball packing arrangements and their densities for all four fully asymptotic Coxeter tilings (Coxeter honeycombs) in hyperbolic 3-space $\mathbb{H}^3$. Centers of horoballs are required to lie at vertices of the regular polyhedral cells constituting the tiling. We allow horoballs of different types at the various vertices. Our results are derived through a generalization of the projective methodology for hyperbolic spaces. The main result states that the known B\"or\"oczky--Florian density upper bound for "congruent horoball" packings of $\mathbb{H}^3$ remains valid for the class of fully asymptotic Coxeter tilings, even if packing conditions are relaxed by allowing for horoballs of different types under prescribed symmetry groups. The consequences of this remarkable result are discussed for various Coxeter tilings.Comment: 26 pages, 10 figure

New Constraints on Neutralino Dark Matter in the Supersymmetric Standard Model

We investigate the prospects for neutralino dark matter within the Supersymmetric Standard Model (SSM) including the constraints from universal soft supersymmetry breaking and radiative breaking of the electroweak symmetry. The latter is enforced by using the one-loop Higgs effective potential which automatically gives the one-loop corrected Higgs boson masses. We perform an exhaustive search of the allowed five-dimensional parameter space and find that the neutralino relic abundance $\Omega_\chi h^2_0$ depends most strongly on the ratio $\xi_0\equiv m_0/m_{1/2}$. For $\xi_0\gg1$ the relic abundance is almost always much too large, whereas for $\xi_0\ll1$ the opposite occurs. For $\xi_0\sim1$ there are wide ranges of the remaining parameters for which $\Omega_\chi\sim1$. We also determine that m_{\tilde q}\gsim250\GeV and m_{\tilde l}\gsim100\GeV are necessary in order to possibly achieve $\Omega_\chi\sim1$. These lower bounds are much weaker than the corresponding ones derived previously when radiative breaking was {\it not} enforced.Comment: 12 pages plus 6 figures (not included), CERN-TH.6584/92, CTP-TAMU-56/92, UAHEP921