Related papers: Electrical networks and hyperplane arrangements
Networks are a widely used and efficient paradigm to model real-world systems where basic units interact pairwise. Many body interactions are often at play, and cannot be modelled by resorting to binary exchanges. In this work, we consider…
This paper aims to undertake an exploration of the behavior of the moduli space of line arrangements while establishing its combinatorial interplay with the incidence structure of the arrangement. In the first part, we investigate…
Many "good" topologies for interconnection networks are based on line digraphs of regular digraphs. These digraphs support unitary matrices. We propose the property "being the digraph of a unitary matrix" as additional criterion for the…
The representation of complex systems as networks is inappropriate for the study of certain problems. We show several examples of social, biological, ecological and technological systems where the use of complex networks gives very limited…
Networks and their higher order generalizations, such as hypernetworks or multiplex networks are ever more popular models in the applied sciences. However, methods developed for the study of their structural properties go little beyond the…
A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the…
Multinets are certain configurations of lines and points with multiplicities in the complex projective plane $\mathbb{P}^2$. They appear in the study of resonance and characteristic varieties of complex hyperplane arrangement complements…
We give a numerical characterization of weighted hyperplane arrangements arising from Dunkl systems.
A D-polyhedron is a polyhedron $P$ such that if $x,y$ are in $P$ then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
We describe a graph parametrization of rational quadratic differentials with presence of a simple pole, whose critical trajectories form a network depending on parameters focusing on the network topological jumps. Obtained bifurcation…
We generalize results of Hattori on the topology of complements of hyperplane arrangements, from the class of generic arrangements, to the much broader class of hypersolvable arrangements. We show that the higher homotopy groups of the…
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
Let $G$ be a simple graph on the vertex set $\{v_1,\dots,v_n\}$ with edge set $E$. Let $K$ be a field. The graphical arrangement $\mathcal{A}_G$ in $K^n$ is the arrangement $x_i-x_j=0, v_iv_j \in E$. An arrangement $\mathcal{A}$ is…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
Spectral analysis of networks states that many structural properties of graphs, such as centrality of their nodes, are given in terms of their adjacency matrices. The natural extension of such spectral analysis to higher order networks is…
We use the results of AG/0406290 to discuss the counting formulas of network flow polytopes and magic squares, i.e. the formula for the corresponding Ehrhart polynomial in terms of residues. We also discuss a description of the big cells…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
We show that the characteristic polynomial of a hyperplane arrangement can be recovered from the class in the Grothendieck group of varieties of the complement of the arrangement. This gives a quick proof of a theorem of Orlik and Solomon…