Band 23, Heft 4

The purpose of this paper is fourfold. The first is to develop the theory of tropical differential algebraic geometry from scratch; the second is to present the tropical fundamental theorem for differential algebraic geometry , and show how it may be used to extract combinatorial information about the set of power series solutions to a given system of differential equations, both in the archimedean (complex analytic) and in the non-Archimedean (e.g., p -adic) setting. A third and subsidiary aim is to show how tropical differential algebraic geometry is a natural application of semiring theory, and in so doing, contribute to the valuative study of differential algebraic geometry. We use this formalism to extend the fundamental theorem of partial differential algebraic geometry to the differential fraction field of the ring of formal power series in arbitrarily (finitely many variables; in doing so we produce new examples of non-Krull valuations that merit further study in their own right.

While the maximum cut problem and its corresponding polytope has received a lot of attention inliterature, comparably little is known about the natural closely related variant maximum bond. Here, given a graph G = (V, E) , we ask for a maximum cut δ(S) ⊆ E with S ⊆ V under the restriction that both G [ S ] as well as G [ V \ S ] are connected. Observe that both the maximum cut and the maximum bond can be seen as inverse problems to the traditional minimum cut, as there, the connectivity arises naturally in optimal solutions. The bond polytope is the convex hull of all incidence vectors of bonds. Similar to the connection of the corresponding optimization problems, the bond polytope is closely related to the cut polytope. While the latter has been intensively studied, there are no results on bond polytopes. We start a structural study of the latter, which additionally allows us to deduce algorithmic consequences. We investigate the relation between cut- and bond polytopes and the additional intricacies that arise when requiring connectivity in the solutions. We study the effect of graph modifications on bond polytopes and their facets, akin to what has been spearheaded for cut polytopes by Barahona, Grötschel and Mahjoub [4; 3] and Deza and Laurant [17; 15; 16]. Moreover, we study facet-defining inequalities arising from edges and cycles for bond polytopes. In particular, these yield a complete linear description of bond polytopes of cycles and 3-connected planar ( K 5 − e )-minor free graphs. Finally, we present a reduction of the maximum bond problem on arbitrary graphs to the maximum bond problem on 3-connected graphs. This yields a linear time algorithm for maximum bond on ( K 5 − e )-minor free graphs.

We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently, closed curves of length 2) allowing translations and discrete rotations. In particular, we show that the solution is an equilateral triangle of height 1 when translations and discrete rotations of π are allowed. We also give convex coverings of closed curves of length 2 under translations and discrete rotations of multiples of π /2 and of 2 π /3. We show that no proper closed subset of that covering is a covering for discrete rotations of multiples of π /2, which is an equilateral triangle of height smaller than 1, and conjecture that such a covering is the smallest-area convex covering. Finally, we give the smallest-area convex coverings of all unit segments under translations and discrete rotations of 2 π / k for all integers k =3.

We show that the base polytope P M of any paving matroid M can be systematically obtained from a hypersimplex by slicing off certain subpolytopes, namely base polytopes of lattice path matroids corresponding to panhandle-shaped Ferrers diagrams. We calculate the Ehrhart polynomials of these matroids and consequently write down the Ehrhart polynomial of P M , starting with Katzman’s formula for the Ehrhart polynomial of a hypersimplex. The method builds on and generalizes Ferroni’s work on sparse paving matroids. Combinatorially, our construction corresponds to constructing a uniform matroid from a paving matroid by iterating the operation of stressed-hyperplane relaxation introduced by Ferroni, Nasr and Vecchi, which generalizes the standard matroid-theoretic notion of circuit-hyperplane relaxation. We present evidence that panhandle matroids are Ehrhart positive and describe a conjectured combinatorial formula involving chain forests and Eulerian numbers from which Ehrhart positivity of panhandle matroids will follow. As an application of the main result, we calculate the Ehrhart polynomials of matroids associated with Steiner systems and finite projective planes, and show that they depend only on their design-theoretic parameters: for example, while projective planes of the same order need not have isomorphic matroids, their base polytopes must be Ehrhart equivalent.

Bridgeland stability manifolds of Calabi–Yau categories are of noticeable interest both in mathematics and physics. By looking at some of the known examples, a pattern clearly emerges and gives a fairly precise description of how they look like. In particular, they all seem to have missing loci, which tend to correspond to degenerate stability conditions vanishing on spherical objects. Describing such missing strata is also interesting from a mirror-symmetric perspective, as they conjecturally parametrize interesting types of degenerations of complex structures. All the naive attempts at constructing modular partial compactifications show how elusive and subtle the problem in fact is: ideally, the missing strata would correspond to stability manifolds of quotient triangulated categories, but establishing such a correspondence on the geometric level and viewing stability conditions on quotients of the original triangulated category as suitable degenerations of stability conditions is not straightforward. In this paper, we will present a method to construct such partial compactifications if some additional hypotheses are satisfied, by realizing our space of interest as a suitable metric completion of the stability manifold.

The relationship of discrete L -algebras to projective geometry is deepened and made explicit in several ways. Firstly, a geometric lattice is associated to any discrete L -algebra. Monoids of I-type are obtained as a special case where the perspectivity relation is trivial. Secondly, the structure group of a non-degenerate discrete L -algebra X is determined and shown to be a complete invariant. It is proved that X ∖ {1} is a projective space with an orthogonality relation. A new definition of non-symmetric quantum sets, extending the recursive definition of symmetric quantum sets, is provided and shown to be equivalent to the former one. Quantum sets are characterized as complete projective spaces with an anisotropic duality, and they are also characterized in terms of their complete lattice of closed subspaces, which is one-sided orthomodular and semimodular. For quantum sets of finite cardinality n > 3, a representation as a projective space with duality over a skew-field is given. Quantum sets of cardinality 2 are classified, and the structure group of their associated L -algebra is determined.

This paper examines the moduli space M m , n , k of m -self-dual n -gons in ℙ k . We present an explicit construction of self-dual polygons and determine the dimension of M m , n , k for certain n and m . Additionally, we propose a conjecture that extends Clebsch’s theorem, which states that every pentagon in ℝℙ 2 is invariant under the Pentagram map.