Related papers: P-graph Associahedra and Hypercube Graph Associahe…

A graph $X$ is defined inductively to be $(a_0,\dots,a_{n-1})$-regular if $X$ is $a_0$-regular and for every vertex $v$ of $X$, the sphere of radius $1$ around $v$ is an $(a_1,\dots,a_{n-1})$-regular graph. Such a graph $X$ is said to be…

Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{\c{c}}alves, 2009), \textsc{L}-shapes (Gon{\c{c}}alves et al, 2018).…

We introduce the shuffle of deformed permutahedra (a.k.a. generalized permutahedra), a simple associative operation obtained as the Cartesian product followed by the Minkowski sum with the graphical zonotope of a complete bipartite graph.…

Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these…

Hypergraphs naturally represent group interactions, which are omnipresent in many domains: collaborations of researchers, co-purchases of items, and joint interactions of proteins, to name a few. In this work, we propose tools for answering…

We give a full classification of continuous flexible discrete axial cone-nets, which are called axial C-hedra. The obtained result can also be used to construct their semi-discrete analogs. Moreover, we identify a novel subclass within the…

Symmetric edge polytopes, a.k.a. PV-type adjacency polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In…

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Topological deep learning is a rapidly growing field that pertains to the development of deep learning models for data supported on topological domains such as simplicial complexes, cell complexes, and hypergraphs, which generalize many…

Pedigree polytopes are extensions of the classical Symmetric Traveling Salesman Problem polytopes whose graphs (1-skeletons) contain the TSP polytope graphs as spanning subgraphs. While deciding adjacency of vertices in TSP polytopes is…

We define and study homotopy groups of cubical sets. To this end, we give four definitions of homotopy groups of a cubical set, prove that they are equivalent, and further that they agree with their topological analogues via the geometric…

Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…

Complex tetrahedral surface $\mathcal{T}$ is a non planar projective surface that is generated by four intersecting complex projective planes $CP^{2}$. In this paper, we study the family $\{\mathcal{T}_{m}\} $ of blow ups of $\mathcal{T}$…

We introduce the concept of pseudocover, which is a counterpart of cover, for symmetric graphs. The only known example of pseudocovers of symmetric graphs so far was given by Praeger, Zhou and the first-named author a decade ago, which…

The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…