Related papers: Decompositions of Augmented Bergman Complexes
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge…
The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…
In this article, we investigate the higher topological complexity of oriented Seifert fibered manifolds that are Eilenberg--MacLane spaces $K(G,1)$ with infinite fundamental group $G$. We first refine the cohomological lower bounds for…
In this paper we consider the reproducing kernel thesis for boundedness and compactness for various operators on Bergman-type spaces. In particular, the results in this paper apply to the weighted Bergman space on the unit ball, the unit…
The theory of analytic function spaces in very general tubular domains over symmetric cones is a relatively new interesting research area. Tube domains are very general and very complicated domains. Recently several new results in this…
Shellability is a well-known combinatorial criterion for verifying that a simplicial complex is Cohen-Macaulay. Another notion familiar to commutative algebraists, but which has not received as much attention from combinatorialists as the…
We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We study their realizability, as well as the irreducible decomposition of their…
Extending the notion of geometric bijections for regular matroids, introduced by the first and third author with Matthew Baker, we describe a family of bijections between bases of an oriented matroid and special orientations. These…
Fleischner introduced the idea of splitting a vertex of degree at least three in a connected graph and used the operation to characterize Eulerian graphs. Raghunathan et. al. extended the splitting operation from graphs to binary matroids.…
We construct rational models for classifying spaces of self-equivalences of bundles over simply connected finite CW-complexes relative to a given simply connected subcomplex. Via work of Berglund-Madsen and Krannich this specializes to…
Given a matroid $M=(E,{\cal I})$, and a total ordering over the elements $E$, a broken circuit is a circuit where the smallest element is removed and an NBC independent set is an independent set in ${\cal I}$ with no broken circuit. The set…
In this paper, we give a new algebraic criterion for the {\em shellability} of (non-pure) simplicial complex $\Delta$ over $[n]$, shellable in the sense of Bj\"orner and Wachs \cite{BW}. We show that the spanning simplicial complex of…
The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set…
Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques…
We explore the special structure of the top-dimensional homology of any compact triangulable space $X$ of dimension $d$. Since there are no $(d+1)$-dimensional cells, the top homology equals the top cycles and is thus a free abelian group.…
Let $(G,G_1)$ be a symmetric pair of holomorphic type, and we consider a pair of Hermitian symmetric spaces $D_1=G_1/K_1\subset D=G/K$, realized as bounded symmetric domains in complex vector spaces $\mathfrak{p}^+_1\subset\mathfrak{p}^+$…
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge…
We construct a class of extended operators in the cohomology of a pair of twisted Schur supercharges of 4d N=2 SCFTs. The extended operators are constructed from the local operators in this cohomology -- the Schur operators -- by a version…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…