Related papers: Feynman graphs and Hyperplane arrangements defined…
The complement of an arrangement A of a finite number of affine hyperplanes in complex n-space has the structure of a poset of spaces indexed by the intersection poset, L(A). The space corresponding to G in L(A) is homotopy equivalent to…
Described the algebraic structure on the space of homotopy classes of cycles with marked topological flags of disks. This space is a non-commutative monoid, with an Abelian quotient corresponding to the group of singular homologies…
We prove similar theorems concerning the structure of bundles involving complements of fiber-type hyperplane arrangements and orbit configuration spaces. These results facilitate analysis of the fundamental groups of these spaces, which may…
For some geometric graph classes, tractability of testing first-order formulas is precisely characterised by the graph parameter twin-width. This was first proved for interval graphs among others in [BCKKLT, IPEC '22], where the equivalence…
Let F be R or C, d the dimension of F over R. Denote by P(F) either the affine plane A(F) or the hyperbolic plane H(F) over F. An arrangement L of k lines in P(F) (pairwise non-parallel in the hyperbolic case) has a link at infinity K(L)…
In this paper we consider the question of the existence of Hamiltonian circuits in the tope graphs of central arrangements of hyperplanes. Some of the results describe connections between the existence of Hamiltonian circuits in the…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
For the complement of a hyperplane arrangement we construct a dual homology basis to the no broken circuit basis of cohomology. This is based on the theory of wonderful embeddings and nested sets.
Given a rational homology sphere M, whose splice diagram satisfy the semigroup condition, Neumann and Wahl were able to define a complete intersection surface singularity called splice diagram singularity from the splice diagram of M. They…
A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…
A study of triangulations of cycles in the Cayley diagrams of finitely generated groups leads to a new geometric characterization of hyperbolic groups.
A linear cycle in a hypergraph $H$ is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are disjoint and $\alpha(H)$ denotes the size of a largest…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
Recent work of An, Drummond-Cole, and Knudsen, as well as the author, has shown that the homology groups of configuration spaces of graphs can be equipped with the structure of a finitely generated graded module over a polynomial ring. In…
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…
Athanasiadis studied arrangements obtained by adding shifted hyperplanes to the braid arrangement. Similarly, Bailey studied arrangements obtained by adding tilted hyperplanes to the braid arrangement. These two kinds of arrangements are…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
The Lefschetz hyperplane section theorem asserts that an affine variety is homotopy equivalent to a space obtained from its generic hyperplane section by attaching some cells. The purpose of this paper is to describe attaching maps of these…