Related papers: Split Orders and Convex Polytopes in Buildings

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(n^1/2). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In…

We prove that affine invariant manifolds in strata of flat surfaces are algebraic varieties. The result is deduced from a generalization of a theorem of M\"oller. Namely, we prove that the image of a certain twisted Abel-Jacobi map lands in…

We study the six-dimensional solvmanifolds that admit complex structures of splitting type classifying the underlying solvable Lie algebras. In particular, many complex structures of this type exist on the Nakamura manifold $X$, and they…

A masure (a.k.a affine ordered hovel) I is a generalization of the Bruhat-Tits building that is associated to a split Kac-Moody group G over a non-archimedean local field. This is a union of affine spaces called apartments. When G is a…

It is argued that the electron stripes as found in correlated oxides have to do with an unrecognized form of order. The manifestation of this order is the robust property that the charge stripes are at the same time anti-phase boundaries in…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

Dissections of polytopes are a well-studied subject by geometers as well as recreational mathematicians. A recent application in coding theory arises from the problem of parameterizing binary vectors of constant Hamming weight which has…

The Hilbert scheme of $n$ points in the affine plane contains the open subscheme parametrizing $n$ distinct points in the affine plane, and the closed subscheme parametrizing ideals of codimension $n$ supported at the origin of the affine…

We combine the technology of the theory of polytopes and twisted intersection theory to derive a large class of double copy relations that generalize the classical relations due to Kawai, Lewellen and Tye (KLT) . To do this, we first study…

Hecke operators acting on modular functions arise naturally in the context of 2d conformal field theory, but in seemingly disparate areas, including permutation orbifold theories, ensembles of code CFTs, and more recently in the context of…

The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

We show that the strongly symmetric spectral convex compact sets are precisely the normalized state spaces of finite-dimensional simple Euclidean Jordan algebras and the simplices. Spectrality is the property that every state has a convex…

In 2002 R. Suter identified a dihedral symmetry on certain order ideals in Young's lattice and gave a combinatorial action on the partitions in these order ideals. Viewing this result geometrically, the order ideals can be seen to be seen…

Using the ordered analogue of Farley-Sabalka's discrete gradient field on the configuration space of a graph, we unravel a levelwise behavior of the generators of the pure braid group on a tree. This allows us to generalize Farber's…

We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number $k$ of trees of equal size by removing $k-1$ edges. In that case, the spanning tree is called {\em splittable}.…

For two given positive integers $p$ and $q$ with $p\leqslant q$, we denote $\mathscr{T}_n^{p, q}={T: T$ is a tree of order $n$ with a $(p, q)$-bipartition}. For a graph $G$ with $n$ vertices, let $A(G)$ be its adjacency matrix with…

We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…

We give a new perspective of Heegaard splittings in terms square complexes and Guirardel's notion of a \textit{core} which allows for combinatorial measurement of the obstruction to being a connect sum of Heegaard diagrams. A Heegaard…