Related papers: Homotopy on spatial graphs and generalized Sato-Le…
In this paper, we introduce and generalize some combinatorial invariants of graphs such as matching number and induced matching number to hypergraphs. Then we compare them together and present some upper bounds for the regularity of…
Given an arbitrary graph $E$ we investigate the relationship between $E$ and the groupoid $G_E$. We show that there is a lattice isomorphism between the lattice of pairs $(H, S)$, where $H$ is a hereditary and saturated set of vertices and…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the…
We describe a homotopical version of the relational and gluing models of type theory, and generalize it to inverse diagrams and oplax limits. Our method uses the Reedy homotopy theory on inverse diagrams, and relies on the fact that Reedy…
General invariants of a geometric mapping of a symmetric affine connection space are obtained in this paper. These invariants are generalizations of the previous obtained basic invariants (see [16]). Moreover, these invariants are related…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
In this paper, we generalize the log-Sobolev inequalities to R\'enyi--Sobolev inequalities by replacing the entropy with the two-parameter entropy, which is a generalized version of entropy and closely related to R\'enyi divergences. We…
In many data-driven applications, higher-order relationships among multiple objects are essential in capturing complex interactions. Hypergraphs, which generalize graphs by allowing edges to connect any number of nodes, provide a flexible…
This paper deals with links and braids up to link-homotopy, studied from the viewpoint of Habiro's clasper calculus. More precisely, we use clasper homotopy calculus in two main directions. First, we define and compute a faithful linear…
The symmetric edge polytope (SEP) of a (finite, undirected) graph is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. SEPs have been studied extensively in the past twenty years. Recently,…
Fields exhibit a variety of topological properties, like different topological charges, when field space in the continuum is composed by more than one topological sector. Lattice treatments usually encounter difficulties describing those…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
An explicit polynomial in the linking numbers $l_{ij}$ and Milnor's triple linking numbers $\mu(rst)$ on six component links is shown to be a well-defined finite type link-homotopy invariant. This solves a problem raised by B. Mellor and D.…
This paper introduces a notion of gradient and an infimal-convolution operator that extend properties of solutions of Hamilton Jacobi equations to more general spaces, in particular to graphs. As a main application, the hypercontractivity…
The interior polynomial is an invariant of bipartite graphs, and a part of the HOMFLY polynomial of a special alternating link coincides with the interior polynomial of the Seifert graph of the link. We extend the interior polynomial to…
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…
The configuration space of a non-linear sigma model is the space of maps from one manifold to another. This paper reviews the authors' work on non-linear sigma models with target a homogeneous space. It begins with a description of the…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…