Related papers: Decompositions of Augmented Bergman Complexes
The augmented Bergman complex of a matroid is a simplicial complex introduced recently in work of Braden, Huh, Matherne, Proudfoot and Wang. It may be viewed as a hybrid of two well-studied pure shellable simplicial complexes associated to…
Inspired by Bruggesser-Mani's line shellings of polytopes, we introduce line shellings for the lattice of flats of a matroid: given a normal complex for a Bergman fan of a matroid induced by a building set, we show that the lexicographic…
For a matroid, we define a new simplicial complex whose facets are indexed by its independent sets. This complex contains the external activity complex as a subcomplex. We call our complex the augmented external activity complex since its…
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…
Unit interval and interval complexes are higher-dimensional generalizations of unit interval and interval graphs, respectively. We show that strongly connected unit interval complexes are shellable with shellings induced by their unit…
Bergman complexes are polyhedral complexes associated to matroids. Faces of these complexes are certain matroids, called matroid types, too. In order to understand the structure of these faces we decompose matroid types into direct…
We study structural and topological properties of nested set complexes of matroids with arbitrary building sets, proving that these complexes are vertex decomposable and admit convex ear decompositions. These results unify and generalize…
In recent work of Braden, Huh, Matherne, Proudfoot and Wang, a class of simplicial complexes associated to matroids, called augmented Bergman complexes, was introduced. The present article concerns the face enumeration of these complexes.…
Shelling orders are a ubiquitous tool used to understand invariants of cell complexes. Significant effort has been made to develop techniques to decide when a given complex is shellable. However, empirical evidence shows that some shelling…
Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no…
The tropical variety defined by linear equations with constant coefficients is the Bergman fan of the corresponding matroid. Building on a self-contained introduction to matroid polytopes, we present a geometric construction of the Bergman…
In the paper, we investigate weighted composition operators on Bergman spaces of a half-plane. We characterize weighted composition operators which are hermitian and those which are complex symmetric with respect to a family of…
The $k$-cut complex was recently introduced by Bayer et al. as a generalization of earlier work of Fr{\"o}berg (1990) and Eagon and Reiner (1998), and was shown to be shellable for several classes of graphs. In this article, we prove that…
In this paper, we study weighted composition operators on Bergman spaces of analytic functions which are square integrable on polydisk. We develop the study in full generality, meaning that the corresponding weighted composition operators…
We investigate when the independence complex of $G[H]$, the lexicographical product of two graphs $G$ and $H$, is either vertex decomposable or shellable. As an application, we construct an infinite family of graphs with the property that…
We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…
Recently, in order to broad the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank function, spanning sets and so on. In this paper, we…
Maxwell lattices are characterized by an equal number of degrees of freedom and constraints. A subset of them, dubbed topological lattices, are capable of localizing stress and deformation on opposing edges, displaying a polarized…
The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…
A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…