BPS Saturation from Null Reduction

We show that any $d$-dimensional strictly stationary, asymptotically Minkowskian solution $(d\ge 4)$ of a null reduction of $d+1$-dimensional pure gravity must saturate the BPS bound provided that the KK vector field can be identified appropriately. We also argue that it is consistent with the field equations.Comment: 10 page

Vitamin E content of different animal products: Influence of animal nutrition

Zusammenfassung: In der vorliegenden Studie wurde der α-Tocopherolgehalt verschiedener Fleischstücke untersucht. Hähnchenschenkel hatte den höchsten α-Tocopherolgehalt, gefolgt von Hähnchenbrust und Schweineschulter (p Leber > Fettgewebe >Musculus longissimus dorsi. Die Nährstoffdichten betrugen 28.8, 7.3, 0.9 und 1.2 mg α-Tocopherol/MJ für Eigelb, Leber, Fettgewebe und Musculus longissimus dorsi der jeweiligen mit Vitamin E supplementierten Gruppe. Diese Ergebnisse zeigen, daß Fleisch, mit Ausnahme des Hähnchenschenkels, von Tieren mit supplementierten Diäten kein bedeutender Vitamin E-Lieferant ist. Hingegen wurde Eigelb durch fütterungsbedingte Modifikation zu einer guten Vitamin E-Quell

Is the classical Bukhvostov-Lipatov model integrable? A Painlev\'e analysis

In this work we apply the Weiss, Tabor and Carnevale integrability criterion (Painlev\'e analysis) to the classical version of the two dimensional Bukhvostov-Lipatov model. We are led to the conclusion that the model is not integrable classically, except at a trivial point where the theory can be described in terms of two uncoupled sine-Gordon models

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

Top Management Team Diversity: A systematic Review

Empirical research investigating the impact of top management team (TMT) diversity on executives’ decision making has produced inconclusive results. To synthesize and aggregate the results on the diversity-performance link, a meta-regression analysis (MRA) is conducted. It integrates more than 200 estimates from 53 empirical studies investigating TMT diversity and its impact on the quality of executives’ decision making as reflected in corporate performance. The analysis contributes to the literature by theoretically discussing and empirically examining the effects of TMT diversity on corporate performance. Our results do not show a link between TMT diversity and performance but provide evidence for publication bias. Thus, the findings raise doubts on the impact of TMT diversity on performance

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

Small grid embeddings of 3-polytopes

We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(188^{n})$. If the graph contains a triangle we can bound the integer coordinates by $O(2^{4.82n})$. If the graph contains a quadrilateral we can bound the integer coordinates by $O(2^{5.46n})$. The crucial part of the algorithm is to find a convex plane embedding whose edges can be weighted such that the sum of the weighted edges, seen as vectors, cancel at every point. It is well known that this can be guaranteed for the interior vertices by applying a technique of Tutte. We show how to extend Tutte's ideas to construct a plane embedding where the weighted vector sums cancel also on the vertices of the boundary face

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

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)