Related papers: Reflexive graph lenses in univalent foundations

Modeling generative process of growing graphs has wide applications in social networks and recommendation systems, where cold start problem leads to new nodes isolated from existing graph. Despite the emerging literature in learning graph…

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…

While lifting map has significantly enhanced the expressivity of graph neural networks, extending this paradigm to hypergraphs remains fragmented. To address this, we introduce the categorical Weisfeiler-Lehman framework, which formalizes…

Properties of the `$k$-equivalent' graph families constructed in Cai, F\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-dim WL method is…

Word-representable graphs, which are the same as semi-transitively orientable graphs, generalize several fundamental classes of graphs. In this paper we propose a novel approach to study word-representability of graphs using a technique of…

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…

Let $\langle G_r,G_b \rangle$ be a pair of plane $st$-graphs with the same vertex set $V$. A simultaneous visibility representation with L-shapes of $\langle G_r,G_b \rangle$ is a pair of bar visibility representations…

A G-gain graph is a graph whose oriented edges are labeled invertibly from a group G. Zaslavsky proposed two matroids of G-gain graphs, called frame matroids and lift matroids, and investigated linear representations of them. Each matroid…

A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…

We generalize the notion of a root system by relaxing the conditions that ensure that it is invariant under reflections and study the resulting structures, which we call generalized root systems (GRSs for short). Since both Kostant root…

We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…

We determine the contact mapping class group of the standard contact structures on lens spaces. To prove the main result, we use the one-parametric convex surface theory to classify Legendrian and transverse rational unknots in any tight…

After having established elementary results on the relationship between a finite complex (pseudo-)reflection group W < GL(V) and its reflection arrangement A, we prove that the action of W on A is canonically related with other natural…

I introduce a formalism for representing the syntax of recursively structured graph-like patterns. It does not use production rules, like a conventional graph grammar, but represents the syntactic structure in a more direct and declarative…

When the theory of Leavitt path algebras was already quite advanced, it was discovered that some of the more difficult questions were susceptible to a new approach using topological groupoids. The main result that makes this possible is…

The notion of a $k$-11-representable graph was introduced by Jeff Remmel in 2017 and studied by Cheon et al.\ in 2019 as a natural extension of the extensively studied notion of word-representable graphs, which are precisely…

We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…

Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite…