Eine Erweiterung der Croftonschen Formeln für konvexe Körper

§0. Einführung. Durch die bekannten Croftonschen Integrale können bekanntlich die Minkowskischen Quermaβintegrale konvexer Körper dargestellt werden. In der vorliegenden Note betrachten wir gewisse Erweiterungen dieser klassischen integralgeometrischen Formeln, durch die allgemeinere invariante Eikörperfunktionale gegeben sind. Es handelt sich hierbei um kinematische Integrale mit beweglichen unterdimensionalen Teilräumen, wobei passend gewahlte Funktionen ihrer Abstände vom Eikörper eingehe

On the number of simple arrangements of five double pseudolines

We describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of our algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline arrangements, proved in this paper. Counting results derived from an implementation of our algorithm are also reported.Comment: 24 pages, 16 figures, 6 table

LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies

We extend the classical LR characterization of chirotopes of finite planar families of points to chirotopes of finite planar families of pairwise disjoint convex bodies: a map \c{hi} on the set of 3-subsets of a finite set I is a chirotope of finite planar families of pairwise disjoint convex bodies if and only if for every 3-, 4-, and 5-subset J of I the restriction of \c{hi} to the set of 3-subsets of J is a chirotope of finite planar families of pairwise disjoint convex bodies. Our main tool is the polarity map, i.e., the map that assigns to a convex body the set of lines missing its interior, from which we derive the key notion of arrangements of double pseudolines, introduced for the first time in this paper.Comment: 100 pages, 73 figures; accepted manuscript versio

Reconstructing a Simple Polytope from its Graph

Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and algorithmic proof of that result. However, his algorithm has always exponential running time. We show that the problem to reconstruct the vertex-facet incidences of a simple polytope P from its graph can be formulated as a combinatorial optimization problem that is strongly dual to the problem of finding an abstract objective function on P (i.e., a shelling order of the facets of the dual polytope of P). Thereby, we derive polynomial certificates for both the vertex-facet incidences as well as for the abstract objective functions in terms of the graph of P. The paper is a variation on joint work with Michael Joswig and Friederike Koerner (2001).Comment: 14 page

Hysteretic photochromic switching of Eu-Mg defects in GaN links the shallow transient and deep ground states of the Mg acceptor

Although p-type activation of GaN by Mg underpins a mature commercial technology, the nature of the Mg acceptor in GaN is still controversial. Here, we use implanted Eu as a ‘spectator ion’ to probe the lattice location of Mg in doubly doped GaN(Mg):Eu. Photoluminescence spectroscopy of this material exemplifies hysteretic photochromic switching (HPS) between two configurations, Eu0 and Eu1(Mg), of the same Eu-Mg defect, with a hyperbolic time dependence on ‘switchdown’ from Eu0 to Eu1(Mg). The sample temperature and the incident light intensity at 355 nm tune the characteristic switching time over several orders of magnitude, from less than a second at 12.5 K, ~100 mW/cm2 to (an estimated) several hours at 50 K, 1 mW/cm2. Linking the distinct Eu-Mg defect configurations with the shallow transient and deep ground states of the Mg acceptor in the Lany-Zunger model, we determine the energy barrier between the states to be 27.7(4) meV, in good agreement with the predictions of theory. The experimental results further suggest that at low temperatures holes in deep ground states are localized on N atoms axially bonded to Mg acceptors

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

Geometric Configurations, Regular Subalgebras of E10 and M-Theory Cosmology

We re-examine previously found cosmological solutions to eleven-dimensional supergravity in the light of the E_{10}-approach to M-theory. We focus on the solutions with non zero electric field determined by geometric configurations (n_m, g_3), n\leq 10. We show that these solutions are associated with rank $g$ regular subalgebras of E_{10}, the Dynkin diagrams of which are the (line) incidence diagrams of the geometric configurations. Our analysis provides as a byproduct an interesting class of rank-10 Coxeter subgroups of the Weyl group of E_{10}.Comment: 48 pages, 27 figures, 5 tables, references added, typos correcte

Computing pseudotriangulations via branched coverings

We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility complexes and on the extension of that theory to the setting of branched coverings. The problem of computing a pseudotriangulation that contains a given set of bitangent line segments is also examined.Comment: 66 pages, 39 figure

Subword complexes, cluster complexes, and generalized multi-associahedra

In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called multi-cluster complex. For k=1, we show that this subword complex is isomorphic to the cluster complex of the given type. We show that multi-cluster complexes of types A and B coincide with known simplicial complexes, namely with the simplicial complexes of multi-triangulations and centrally symmetric multi-triangulations respectively. Furthermore, we show that the multi-cluster complex is universal in the sense that every spherical subword complex can be realized as a link of a face of the multi-cluster complex.Comment: 26 pages, 3 Tables, 2 Figures; final versio