相关论文: Link complexes of subspace arrangements

We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which…

We introduce a filtration on the simplicial homology of a finite simplicial complex X using bi-colourings of its vertices. This yields two dual homology theories closely related to discrete Morse matchings on X. We give an explicit…

Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a…

L. Lechuga and A. Murillo showed that a non-oriented, simple, connected, finite graph $G$ is $k$-colourable if and only if a certain pure Sullivan algebra associated to $G$ and $k$ is not elliptic. In this paper, we extend this result to…

Let A be an arrangement of complex hyperplanes. The fundamental group of the complement of A is determined by a braid monodromy homomorphism from a finitely generated free group to the pure braid group. Using the Gassner representation of…

A central question in arrangement theory is to determine whether the characteristic polynomial $\Delta_q$ of the algebraic monodromy acting on the homology group $H_q(F(\mathcal{A}),\mathbb{C})$ of the Milnor fiber of a complex hyperplane…

We give an explicit characterization for group extensions that correspond to elements of the symmetric cohomology $HS^2(G,A)$. We also give conditions for the map $HS^n(G,A)\to H^n(G,A)$ to be injective.

Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…

We call a Delta Diagram any diagram of a knot or link whose regions (including the unbounded one) have 3, 4, or 5 sides. We prove that any knot or link admits a delta diagram. We define and estimate combinatorial link invariants stemming…

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…

The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this…

We give a decomposition of the Laplace operator (in matrix form) of a covering simplicial complex as a direct sum of several matrices, one of which is the Laplace operator of the base complex. It follows that the spectrum of a covering…

The homology cobordism group of homology cylinders is a generalization of the mapping class group and the string link concordance group. We study this group and its filtrations by subgroups by developing new homomorphisms. First, we define…

The Hom complex $\mathrm{Hom}(G, H)$ of graphs is a simplicial complex associated to a pair of graphs $G$ and $H$, and its homotopy type is of interest in the graph coloring problem and the homomorphism reconfiguration problem. In this…

Given an arrangement of hyperplanes in $\P^n$, possibly with non-normal crossings, we give a vanishing lemma for the cohomology of the sheaf of $q$-forms with logarithmic poles along our arrangement. We give a basis for the ideal $\cal J$…

We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We…

Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…

We define for every dendroidal set X a chain complex and show that this assignment determines a left Quillen functor. Then we define the homology groups $H_n(X)$ as the homology groups of this chain complex. This generalizes the homology of…

In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (real) stable, a property often deduced via the theory of…