Related papers: Reflexive graph lenses in univalent foundations

In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…

To each graph on $n$ vertices there is an associated subspace of the $n \times n$ matrices called the operator system of the graph. We prove that two graphs are isomorphic if and only if their corresponding operator systems are unitally…

We study the crystal graphs of irreducible $U_{v}(\hat{sl}}_{e})$-modules of higher level l. Generalizing works of the first author, we obtain a simple description of the bijections between the classes of multipartitions which naturally…

Graph contrastive learning (GCL) has achieved remarkable success by following the computer vision paradigm of preserving absolute similarity between augmented views. However, this approach faces fundamental challenges in graphs due to their…

In matching theory, one of the most fundamental and classical branches of combinatorics, {\em canonical decompositions} of graphs are powerful and versatile tools that form the basis of this theory. However, the abilities of the known…

A similarity structure on a connected manifold M is a Riemannian metric on its universal cover such that the fundamental group of M acts by similarities. If the manifold M is compact, we show that the universal cover admits a de Rham…

Lumsdaine (2010) and van den Berg-Garner (2011) proved that types in Martin-L\"of type theory carry the structure of weak {\omega}-groupoids. Their proofs, while foundational, rely on abstract properties of the identity type without…

We consider isomorphism properties of infinite random geometric graphs defined over a variety of metrics. In previous work, it was shown that for $\mathbb{R}^n$ with the $L_{\infty}$-metric, the infinite random geometric graph is, with…

Graph neural networks are prominent models for representation learning over graph-structured data. While the capabilities and limitations of these models are well-understood for simple graphs, our understanding remains incomplete in the…

The classical Capelli identity is an important determinantal identity of a matrix with noncommutative entries that determines the center of the enveloping algebra of the general linear Lie algebra, and was used by Weyl as a main tool to…

This paper initiates the study of the "Laplacian simplex" $T_G$ obtained from a finite graph $G$ by taking the convex hull of the columns of the Laplacian matrix for $G$. Basic properties of these simplices are established, and then a…

Establishing dense correspondence across 3D shapes is crucial for fundamental downstream tasks, including texture transfer, shape interpolation, and robotic manipulation. However, learning these mappings without manual supervision remains a…

A topological group $G$ is said to have the L\'evy property if it admits a dense subgroup which is decomposed as the union of an increasing sequence of compact subgroups $\mathcal{G}=\{G_i:i\in\mathbb{N}\}$ of $G$ which exhibits…

Graph Self-Supervised Learning (GSSL) has emerged as a powerful paradigm for generating high-quality representations for graph-structured data. While multi-scale graph contrastive learning has received increasing attention, many existing…

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

In this article we introduce new affinely invariant points---`special parabolic points'---on the parabolic set of a generic surface $M$ in real 4-space, associated with symmetries in the 2-parameter family of reflexions of $M$ in points of…

An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…

Graph-based models form a fundamental aspect of data representation in Data Sciences and play a key role in modeling complex networked systems. In particular, recently there is an ever-increasing interest in modeling dynamic complex…

Two simple undirected graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues. Cospectrality yields an equivalence relation on the family of graphs which is provably weaker than isomorphism. In…