Related papers: Split Orders and Convex Polytopes in Buildings

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…

There is a description of the torsion product of two modules in terms of generators and relations given by Eilenberg and Mac Lane. With some additional data on the chain complexes there is a splitting of the map in the Kunneth formula in…

Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases''…

Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…

The set of chambers of a real hyperplane arrangement may be ordered by separation from some fixed chamber. When this poset is a lattice, Bjorner, Edelman, and Ziegler proved that the chambers are in natural bijection with the biconvex sets…

We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…

Metrics on rooted phylogenetic trees are integral to a number of areas of phylogenetic analysis. Cluster-similarity metrics have recently been introduced in order to limit skew in the distribution of distances, and to ensure that trees in…

Defining the $m$-th stratum of a closed subset of an $n$ dimensional Euclidean space to consist of those points, where it can be touched by a ball from at least $n-m$ linearly independent directions, we establish that the $m$-th stratum is…

We construct a homotopy initial functor from the partition complex of a finite set $A$ to a category of trees with leaves labelled by $A$. As an application, this provides an equivalence between different bar constructions of an operad. In…

We study the generalization of split, k-branch split, and intersection cuts from Mixed Integer Linear Programming to the realm of Mixed Integer Nonlinear Programming. Constructing such cuts requires calculating the convex hull of the…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph invariants that distinguish large classes of graphs. Stanley…

Let $k$ be a field of characteristic not 2 or 3. Let $V$ be the $k$-space of binary cubic polynomials. The natural symplectic structure on $k^2$ promotes to a symplectic structure $\omega$ on $V$ and from the natural symplectic action of…

The geodesic between two points $a$ and $b$ in the interior of a simple polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$. It is thus the natural generalization of straight line segments on unconstrained point…

The $n$-slice algebra is introduced as a generalization of path algebra in higher dimensional representation theory. In this paper, we give a classification of $n$-slice algebras via their $(n+1)$-preprojective algebras and the trivial…

In an unpublished preprint \cite{batanin}, Batanin conjectures that it is possible to take `slices' of a globular operad, thereby isolating the algebraic structure in each dimension. It was further hypothesised that the slices of a globular…

Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…

This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…

To each automorphism of a spherical building there is naturally associated an "opposition diagram", which encodes the types of the simplices of the building that are mapped onto opposite simplices. If no chamber (that is, no maximal…