Explicit determination of a 727-dimensional root space of the hyperbolic Lie algebra E10E_{10}

The 727-dimensional root space associated with the level-2 root \bLambda_1 of the hyperbolic Kac--Moody algebra $E_{10}$ is determined using a recently developed string theoretic approach to hyperbolic algebras. The explicit form of the basis reveals a complicated structure with transversal as well as longitudinal string states present.Comment: 12 pages, LaTeX 2

On the fundamental representation of Borcherds algebras with one imaginary simple root

Borcherds algebras represent a new class of Lie algebras which have almost all the properties that ordinary Kac-Moody algebras have, and the only major difference is that these generalized Kac-Moody algebras are allowed to have imaginary simple roots. The simplest nontrivial examples one can think of are those where one adds ``by hand'' one imaginary simple root to an ordinary Kac-Moody algebra. We study the fundamental representation of this class of examples and prove that an irreducible module is given by the full tensor algebra over some integrable highest weight module of the underlying Kac-Moody algebra. We also comment on possible realizations of these Lie algebras in physics as symmetry algebras in quantum field theory.Comment: 8 page

Precision spectroscopy by photon-recoil signal amplification

Precision spectroscopy of atomic and molecular ions offers a window to new physics, but is typically limited to species with a cycling transition for laser cooling and detection. Quantum logic spectroscopy has overcome this limitation for species with long-lived excited states. Here, we extend quantum logic spectroscopy to fast, dipole-allowed transitions and apply it to perform an absolute frequency measurement. We detect the absorption of photons by the spectroscopically investigated ion through the photon recoil imparted on a co-trapped ion of a different species, on which we can perform efficient quantum logic detection techniques. This amplifies the recoil signal from a few absorbed photons to thousands of fluorescence photons. We resolve the line center of a dipole-allowed transition in 40Ca+ to 1/300 of its observed linewidth, rendering this measurement one of the most accurate of a broad transition. The simplicity and versatility of this approach enables spectroscopy of many previously inaccessible species.Comment: 25 pages, 6 figures, 1 table, updated supplementary information, fixed typo

Realizability of Polytopes as a Low Rank Matrix Completion Problem

This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another set parameterizing the projective moduli space of a combinatorial polytope

Polytopality and Cartesian products of graphs

We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we show that products of simple polytopes are the only simple polytopes whose graph is a product. On the other hand, we provide a general method to construct (non-simple) polytopal products whose factors are not polytopal.Comment: 21 pages, 10 figure

Oriented Matroids -- Combinatorial Structures Underlying Loop Quantum Gravity

We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence vertices of a graph in 3-dimensional Riemannian space, and can be represented by sign strings containing relative orientations of embedded edges. We demonstrate that these signature factors are a special representation of the general mathematical concept of an oriented matroid. Moreover, we show that oriented matroids can also be used to describe the topology (connectedness) of directed graphs. Hence the mathematical methods developed for oriented matroids can be applied to the difficult combinatorics of embedded graphs underlying the construction of LQG. As a first application we revisit the analysis of [4-5], and find that enumeration of all possible sign configurations used there is equivalent to enumerating all realizable oriented matroids of rank 3, and thus can be greatly simplified. We find that for 7-valent vertices having no coplanar triples of edge tangents, the smallest non-zero eigenvalue of the volume spectrum does not grow as one increases the maximum spin \jmax at the vertex, for any orientation of the edge tangents. This indicates that, in contrast to the area operator, considering large \jmax does not necessarily imply large volume eigenvalues. In addition we give an outlook to possible starting points for rewriting the combinatorics of LQG in terms of oriented matroids.Comment: 43 pages, 26 figures, LaTeX. Version published in CQG. Typos corrected, presentation slightly extende

Signatures of partition functions and their complexity reduction through the KP II equation

A statistical amoeba arises from a real-valued partition function when the positivity condition for pre-exponential terms is relaxed, and families of signatures are taken into account. This notion lets us explore special types of constraints when we focus on those signatures that preserve particular properties. Specifically, we look at sums of determinantal type, and main attention is paid to a distinguished class of soliton solutions of the Kadomtsev-Petviashvili (KP) II equation. A characterization of the signatures preserving the determinantal form, as well as the signatures compatible with the KP II equation, is provided: both of them are reduced to choices of signs for columns and rows of a coefficient matrix, and they satisfy the whole KP hierarchy. Interpretations in term of information-theoretic properties, geometric characteristics, and the relation with tropical limits are discussed.Comment: 42 pages, 11 figures. Section 7.1 has been added, the organization of the paper has been change

Gene Expressio Array Exploration Using K-Formal Concept Analysis

Proceeding of: 9th International Conference, ICFCA 2011, Nicosia, Cyprus, May 2-6, 2011.DNA micro-arrays are a mechanism for eliciting gene expression values, the concentration of the transcription products of a set of genes, under different chemical conditions. The phenomena of interest—up-regulation, down-regulation and co-regulation—are hypothesized to stem from the functional relationships among transcription products. In [1,2,3] a generalisation of Formal Concept Analysis was developed with data mining applications in mind, K-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the usual Boolean carrier set. In this paper, we use (Rmin+)- and (Rmax+) to analyse gene expression data for Arabidopsis thaliana. We introduce the mechanism to render the data in the appropriate algebra and profit by the wealth of different Galois Connections available in Generalized Formal Concept Analysis to carry different analysis for up- and down-regulated genes.Spanish Government-Comision Interministerial de Ciencia y Tecnología projects 2008-06382/TEC and 2008-02473/TEC and the regional projects S-505/TIC/0223 (DGUI-CM) and CCG08-UC3M/TIC- 4457 (Comunidad Aut onoma de Madrid - UC3M)

Six topics on inscribable polytopes

Inscribability of polytopes is a classic subject but also a lively research area nowadays. We illustrate this with a selection of well-known results and recent developments on six particular topics related to inscribable polytopes. Along the way we collect a list of (new and old) open questions.Comment: 11 page

The Quest for Light Sea Quarks: Algorithms for the Future

As part of a systematic algorithm study, we present first results on a performance comparison between a multibosonic algorithm and the hybrid Monte Carlo algorithm as employed by the SESAM collaboration. The standard Wilson fermion action is used on 32*16^3 lattices at beta=5.5.Comment: LaTeX, 3 pages, Lattice2001(algorithms