Equiangular lines in Euclidean spaces

We obtain several new results contributing to the theory of real equiangular line systems. Among other things, we present a new general lower bound on the maximum number of equiangular lines in d dimensional Euclidean space; we describe the two-graphs on 12 vertices; and we investigate Seidel matrices with exactly three distinct eigenvalues. As a result, we improve on two long-standing upper bounds regarding the maximum number of equiangular lines in dimensions d=14, and d=16. Additionally, we prove the nonexistence of certain regular graphs with four eigenvalues, and correct some tables from the literature.Comment: 24 pages, to appear in JCTA. Corrected an entry in Table

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

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

Improving the efficiency of the cardiac catheterization laboratories through understanding the stochastic behavior of the scheduled procedures

  Background: In this study, we sought to analyze the stochastic behavior of Catherization Labora­tories (Cath Labs) procedures in our institution. Statistical models may help to improve estimated case durations to support management in the cost-effective use of expensive surgical resources. Methods: We retrospectively analyzed all the procedures performed in the Cath Labs in 2012. The duration of procedures is strictly positive (larger than zero) and has mostly a large mini­mum duration. Because of the strictly positive character of the Cath Lab procedures, a fit of a lognormal model may be desirable. Having a minimum duration requires an estimate of the threshold (shift) parameter of the lognormal model. Therefore, the 3-parameter lognormal model is interesting. To avoid heterogeneous groups of observations, we tested every group-car­diologist-procedure combination for the normal, 2- and 3-parameter lognormal distribution. Results: The total number of elective and emergency procedures performed was 6,393 (8,186 h). The final analysis included 6,135 procedures (7,779 h). Electrophysiology (intervention) pro­cedures fit the 3-parameter lognormal model 86.1% (80.1%). Using Friedman test statistics, we conclude that the 3-parameter lognormal model is superior to the 2-parameter lognormal model. Furthermore, the 2-parameter lognormal is superior to the normal model. Conclusions: Cath Lab procedures are well-modelled by lognormal models. This information helps to improve and to refine Cath Lab schedules and hence their efficient use.

Formation of a molecular Bose-Einstein condensate and an entangled atomic gas by Feshbach resonance

Processes of association in an atomic Bose-Einstein condensate, and dissociation of the resulting molecular condensate, due to Feshbach resonance in a time-dependent magnetic field, are analyzed incorporating non-mean-field quantum corrections and inelastic collisions. Calculations for the Na atomic condensate demonstrate that there exist optimal conditions under which about 80% of the atomic population can be converted to a relatively long-lived molecular condensate (with lifetimes of 10 ms and more). Entangled atoms in two-mode squeezed states (with noise reduction of about 30 dB) may also be formed by molecular dissociation. A gas of atoms in squeezed or entangled states can have applications in quantum computing, communications, and measurements.Comment: LaTeX, 5 pages with 4 figures, uses REVTeX