Related papers: Split Orders and Convex Polytopes in Buildings

The most important aspects of scattering amplitudes have long been thought to be associated with their poles. But recently a very different sort of "split" factorizations for a wide range of particle and string tree amplitudes have been…

Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust…

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…

It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…

This paper continues the study of finite-type invariants of homology spheres studied by Ohtsuki and Garoufalidis. We apply the surgery classification of links to give a diagrammatic description, using ideas of Ohtsuki. This uses a…

Geometric approach to classical and exceptional groups of Lie type has been quite successful and has led to the deveopment of the concept of buildings and polar spaces. The latter have been characterized by simple systems of axioms with a…

We study the structure of the set of all maximal green sequences of a finite-dimensional algebra. There is a natural equivalence relation on this set, which we show can be interpreted in several different ways, underscoring its…

The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…

The $k$-th spectral moment $M_k(G)$ of the adjacency matrix of a graph~$G$ represents the number of closed walks of length~$k$ in~$G$. We study here the partial order $\preceq$ of graphs, defined by $G\preceq H$ if $M_k(G)\leq M_k(H)$ for…

We describe a construction of topological orders from coupled lower dimensional symmetry-protected topological orders, which is closely related to gauging a subsystem symmetry. Our construction yields both conventional topological orders…

Given a graph $G$ with a terminal set $R \subseteq V(G)$, the Steiner tree problem (STREE) asks for a set $S\subseteq V(G) \setminus R$ such that the graph induced on $S\cup R$ is connected. A split graph is a graph which can be partitioned…

In this work, we explore the use of operator splitting algorithms for solving regularized structural topology optimization problems. The context is the classical structural design problems (e.g., compliance minimization and compliant…

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

One of the major open problems in noncommutative algebraic geometry is the classification of noncommutative surfaces, and this paper resolves a significant case of this problem. Specifically, let S denote the 3-dimensional Sklyanin algebra…

The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…