相关论文: Link complexes of subspace arrangements

We study the chromatic symmetric function on graphs, and show that its kernel is spanned by the modular relations. We generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes, a family of generalized…

If we fix a spanning subgraph $H$ of a graph $G$, we can define a chromatic number of $H$ with respect to $G$ and we show that it coincides with the chromatic number of a double covering of $G$ with co-support $H$. We also find a few…

We consider Colouring on graphs that are $H$-subgraph-free for some fixed graph $H$, which are graphs that do not contain $H$ as a subgraph. To classify the complexity of Colouring on $H$-subgraph-free graphs for connected $H$, it remains…

Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…

It is shown that the description of certain class of representations of the holonomy Lie algebra associated to hyperplane arrangement $\Delta$ is essentially equivalent to the classification of $\vee$-systems associated to $\Delta.$ The…

Let $V$ be a degree $d$, reduced hypersurface in $\mathbb{CP}^{n+1}$, $n \geq 1$, and fix a generic hyperplane, $H$. Denote by $\mathcal{U}$ the (affine) hypersurface complement, $\mathbb{CP}^{n+1}- V \cup H$, and let $\mathcal{U}^c$ be the…

This paper extends the relation established for group cohomology by Green, Hunton and Schuster between chromatic phenomena in stable homotopy theory and certain natural subrings of singular cohomology. This exploits the theory due to Henn,…

An immersed concordance between two links is a concordance with possible self-intersections. Given an immersed concordance we construct a smooth four-dimensional cobordism between surgeries on links. By applying $d$-invariant inequalities…

Given a graph G, the graph associahedron is a simple convex polytope whose face poset is based on the connected subgraphs of G. With the additional assignment of a color palette, we define the colorful graph associahedron, show it to be a…

To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…

We generalize the notion of involutivity to systems of differential equations of different orders and show that the classical results due to Guillemin and Quillen relating involutivity, restrictions, characteristics and characteristicity,…

A multigraph is a nonsimple graph which is permitted to have multiple edges, that is, edges that have the same end nodes. We introduce the concept of spanning simplicial complexes $\Delta_s(\mathcal{G})$ of multigraphs $\mathcal{G}$, which…

In this paper firstly, we generalize the concept of codismantlable graphs to hypergraphs and show that some special vertex decomposable hypergraphs are codismantlable. Then we generalize the concept of bouquet in graphs to hypergraphs to…

Given a semisimple complex linear algebraic group $G$ and a lower ideal $I$ in positive roots of $G$, three objects arise: the ideal arrangement $\mathcal{A}_I$, the regular nilpotent Hessenberg variety $\mbox{Hess}(N,I)$, and the regular…

For a simplicial complex K on m vertices and simplicial complexes K1,...,Km a composed simplicial complex K(K1,...,Km) is introduced. This construction generalizes an iterated simplicial wedge construction studied by A. Bahri, M. Bendersky,…

We study when co-evolving (or adaptive) higher-order networks defined on directed hypergraphs admit a simplicial description. Binary and triadic couplings are modelled by time-dependent weight tensors. Using representation theory of the…

We study the hypersimplex under the action of the symmetric group $S_n$ by coordinate permutation. We prove that the evaluation of its equivariant $H^*$-polynomial at $1$ is the permutation character of decorated ordered set partitions…

We introduce $H$-chromatic symmetric functions, $X_{G}^{H}$, which use the $H$-coloring of a graph $G$ to define a generalization of Stanley's chromatic symmetric functions. We say two graphs $G_1$ and $G_2$ are $H$-chromatically equivalent…

A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H.…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…