Related papers: Lagrangian subspaces, delta-matroids and four-term…
We introduce a new series $R_k$, $k=2,3,4,\dots$, of integer valued weight systems. The value of the weight system $R_k$ on a chord diagram is a signed number of cycles of even length $2k$ in the intersection graph of the diagram. We show…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
Construction of a universal finite-type invariant can be reduced, under suitable assumptions, to the solution of certain equations (the hexagon and pentagon equations) in a particular graded associative algebra of chord diagrams. An…
An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…
When placed on four-manifolds, $ \mathcal{N} = 2 $ gauge theories couple to topological invariants of the background via two functions $ A $ and $ B $. General considerations allow for these functions to be fixed in terms of the Coulomb…
This paper investigates the geometrical structures of invariant graphs of skew product systems of the form $F : \Theta \times I \to \Theta \times I , (\theta,y)\mapsto (S\theta,f_\theta(y))$ driven by a hyperbolic base map $S : \Theta \to…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
We propose a data-driven approach to identifying the functionally independent invariants that can be constructed from a tensor with a given symmetry structure. Our algorithm proceeds by first enumerating graphs, or tensor networks, that…
The aim of this paper is to realise the techniques of picture-valued invariants and invariants valued in free groups for long knots in the full torus. Such knots and links are of a particular interest because of their relation to Legendrian…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…
This is the second in a series of papers dedicated to studying w-knots, and more generally, w-knotted objects (w-braids, w-tangles, etc.). These are classes of knotted objects that are wider but weaker than their "usual" counterparts. To…
Modifications of the electromagnetic Maxwell Lagrangian in four dimensions have been considered by some authors. One may include an explicit massive term (Proca) and a topological but not Lorentz-invariant term within certain observational…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a matrix have many applications in graph theory and dynamical…
A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…
We call a Delta Diagram any diagram of a knot or link whose regions (including the unbounded one) have 3, 4, or 5 sides. We prove that any knot or link admits a delta diagram. We define and estimate combinatorial link invariants stemming…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
In this paper, we illustrate important aspects of the interplay between weighing matrices, $(v,k,\lambda)$-graphs with fixed-point free involutions, and signed graphs with an orthogonal adjacency matrix, which arises from thin divisible…
We consider the ring I_n of polynomial invariants over weighted graphs on n vertices. Our primary interest is the use of this ring to define and explore algebraic versions of isomorphism problems of graphs, such as Ulam's reconstruction…