相关论文: On arrangements of hyperplanes from connected subg…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

In an earlier paper, the authors considered three types of graphs, and three equivalence relations, defined on a group, viz.\ the power graph, enhanced power graph, and commuting graph, and the relations of equality, conjugacy, and same…

We give a necessary and sufficient condition in order for a hyperplane arrangement to be of Torelli type, namely that it is recovered as the set of unstable hyperplanes of its Dolgachev sheaf of logarithmic differentials. Decompositions and…

This is a glossary of notions and methods related with the topological theory of collections of affine planes, including braid groups, configuration spaces, order complexes, stratified Morse theory, simplicial resolutions, complexes of…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

We study the Hadamard product of the linear forms defining a hyperplane arrangement with those of its dual, which we view as generating an ideal in a certain polynomial ring. We use this ideal, which we call the ideal of pairs, to study…

An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…

Factors $\frac{X}{Y}$ in a free group $F$ with $Y$ normal in $X$ are considered. Precise results on the free structure of ${Y}$ relative to the free structure of ${X}$ when $\frac{X}{Y}$ is abelian are obtained. Some extensions and…

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…

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…

We construct explicit minimal models for the (hyper)operads governing modular, cyclic and ordinary operads, and wheeled properads, respectively. Algebras for these models are homotopy versions of the corresponding structures.

Higher order networks are able to characterize data as different as functional brain networks, protein interaction networks and social networks beyond the framework of pairwise interactions. Most notably higher order networks include…

In this paper, we study simplicial hyperplane arrangements in real projective $3$-space. We give a necessary condition for the characteristic polynomial to have only real roots, valid also for non-simplicial arrangements. As application, we…

We establish a one-to-one correspondence between 1-planar graphs and general and hole-free 4-map graphs and show that 1-planar graphs can be recognized in polynomial time if they are crossing-augmented, fully triangulated, and maximal…

Let $\mathcal C :f=0$ be a curve arrangement in the complex projective plane. If $\mathcal C$ contains a curve subarrangement consisting of at least three members in a pencil, then one obtains an explicit syzygy among the partial…

For more than hundred years, various concepts were developed to understand the fields of geometric objects and invariant differential operators between them for conformal Riemannian and projective geometries. More recently, several general…

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…

The Tutte polynomial is originally a bivariate polynomial which enumerates the colorings of a graph and of its dual graph. Ardila extended in 2007 the definition of the Tutte polynomial on the real hyperplane arrangements. He particularly…