Related papers: High dimensional expansion using zig-zag product
Jaeger's directed cycle double cover conjecture can be formulated as a problem of existence of special perfect matchings in a class of graphs that we call hexagon graphs. In this work, we explore the structure of hexagon graphs. We show…
Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. We analyze several…
Inspired by protein folding, we explored the construction of three-dimensional structures and machines from one-dimensional chains of simple building blocks. This approach not only allows us to recreate the self-replication mechanism…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
We propose a generalization of non-commutative geometry and gauge theories based on ternary Z_3-graded structures. In the new algebraic structures we define, we leave all products of two entities free, imposing relations on ternary products…
We propose a generalization of the concept of a Ribbon graph suitable to provide combinatorial models for marked surfaces equipped with a G-structure. Our main insight is that the necessary combinatorics is neatly captured in the concept of…
Let M be an oriented compact 3-manifold and let T be a (loose) triangulation of M, with ideal vertices at the components of the boundary of M and possibly internal vertices. We show that any spin structure s on M can be encoded by extra…
The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…
This paper considers some different measures for how additively structured a convex set can be. The main result gives a construction of a convex set $A$ containing $\Omega(|A|^{3/2})$ three-term arithmetic progressions.
Symmetric product orbifolds provide a controlled environment to explore generic features of gauge theory and holography. The tractability of these theories lies in the complete characterisation of their gauge structure through holomorphic…
We analyze the gauge structure of a recently proposed superconformal field theory in six dimensions. We find that this structure amounts to a weak Courant-Dorfman algebra, which, in turn, can be interpreted as a strong homotopy Lie algebra.…
For certain dimensionally-regulated one-, two- and three-loop diagrams, problems of constructing the epsilon-expansion and the analytic continuation of the results are studied. In some examples, an arbitrary term of the epsilon-expansion…
An Euler tour of a hypergraph is a closed walk that traverses every edge exactly once; if a hypergraph admits such a walk, then it is called eulerian. Although this notion is one of the progenitors of graph theory --- dating back to the…
A hypersymplectic structure on a 4-manifold is a triple $\omega_1, \omega_2, \omega_3$ of 2-forms for which every non-trivial linear combination $a^1\omega_1 + a^2 \omega_2 + a^3 \omega_3$ is a symplectic form. Donaldson has conjectured…
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…
Random hypergraphs extend the classical notion of random graphs by allowing hyperedges to join more than two vertices, making them well-suited for modeling higher-order interactions in complex systems. Despite their broad applicability,…
We study the computation of our recently introduced Whitney polynomial and the enumeration of the spanning hypertrees for hypermaps whose hyperedges have length at most $3$. This is a class of hypermaps where the computation of the above…
We prove that the uniform spanning forests of $\mathbb{Z}^d$ and $\mathbb{Z}^{\ell}$ have qualitatively different connectivity properties whenever $\ell >d \geq 4$. In particular, we consider the graph formed by contracting each tree of the…
For a fixed dimension $k\ge 1$, let us consider the randomly growing simplical complex on the vertex set $\{1,2,\dots,n\}$ defined as follows: We start with the empty complex, and for each $k+1$-element subset $\sigma$ of $\{1,2,\dots,n\}$,…