Related papers: Lagrangian subspaces, delta-matroids and four-term…
Many inference tasks on knowledge graphs, including relation prediction, operate on knowledge graph embeddings -- vector representations of the vertices (entities) and edges (relations) that preserve task-relevant structure encoded within…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
We prove the existence of a degree 7 Vassiliev invariant of long (or string) two-component links which is not preserved under the simultaneous change of orientation of both components. The non-invertibility of this invariant can be detected…
We construct knot invariants categorifying the quantum knot variants for all representations of quantum groups. We show that these invariants coincide with previous invariants defined by Khovanov for sl_2 and sl_3 and by Mazorchuk-Stroppel…
In 2010, Turaev introduced knotoids as a variation on knots that replaces the embedding of a circle with the embedding of a closed interval with two endpoints which here we call poles. We define generalized knotoids to allow arbitrarily…
Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…
A {\em $3$-graph} is a connected cubic graph such that each vertex is is equipped with a cyclic order of the edges incident with it. A {\em weight system} is a function $f$ on the collection of $3$-graphs which is {\em antisymmetric}:…
We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of…
Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant…
Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…
Parity mappings from the chords of a Gauss diagram to the integers is defined. The parity of the chords is used to construct families of invariants of Gauss diagrams and virtual knots. One family consists of degree $n$ Vassiliev invariants.
We continue to develop an obstruction theory for embedding 2-spheres into 4-manifolds in terms of Whitney towers. The proposed intersection invariants take values in certain graded abelian groups generated by labelled trivalent trees, and…
We present a unified framework to describe lattice gauge theories by means of tensor networks: this framework is efficient as it exploits the high amount of local symmetry content native of these systems describing only the gauge invariant…
The $\Upsilon$ invariant is a concordance invariant defined by using knot Floer homology. F\"{o}ldv\'{a}ri gives a combinatorial restructure of it using grid homology. We extend the combinatorial $\Upsilon$ invariant for balanced spatial…
We consider Open Gromov-Witten invariants for noncompact Calabi-Yau in the case the Lagrangian has the topology of $\R^2 \times S^1$. The definition of the invariant involves the choice of a frame for the Lagrangian, in accord with string…
We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…
The general seven-dimensional maximal supergravity is presented. Its universal Lagrangian is described in terms of an embedding tensor which can be characterized group-theoretically. The theory generically combines vector, two-form and…
For each relative $\operatorname{GL}(V)$-invariant tensor $I\in \Lambda^{p_1+1}V^{\vee}\otimes .. \otimes \Lambda^{p_n+1}V^{\vee}$ we construct a $\operatorname{GL}(V)$-invariant weighted differential form $\eta$ on $(\mathbb{P} V)^{n}$.…
We propose a representation of graph as a functional object derived from the power iteration of the underlying adjacency matrix. The proposed functional representation is a graph invariant, i.e., the functional remains unchanged under any…
Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical…