Related papers: Lagrangian subspaces, delta-matroids and four-term…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

This paper delves into three research directions, leveraging the Lov\'{a}sz $\vartheta$-function of a graph. First, it focuses on the Shannon capacity of graphs, providing new results that determine the capacity for two infinite subclasses…

In this work we develop a theory of Vessels. This object arises in the study of overdetermined 2D systems invariant in one of the variables, which are usually called time invariant. To each overdetermined time invariant 2D systems there is…

We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system…

We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

The notion of a Bing cell is introduced, and it is used to define invariants, link groups, of 4-manifolds. Bing cells combine some features of both surfaces and 4-dimensional handlebodies, and the link group \lambda(M) measures certain…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

The $\mathfrak{sl}_2$ weight system, corresponding to the colored Jones polynomial of knots, is one of the the simplest weight system for chord diagrams. Recent works have led to explicit computations of this weight system on chord diagrams…

We introduce a universal weight system (a function on chord diagrams satisfying the $4$-term relation) taking values in the ring of polynomials in infinitely many variables whose particular specializations are weight systems associated with…

We compute many dimensions of spaces of finite type invariants of virtual knots (of several kinds) and the dimensions of the corresponding spaces of "weight systems", finding everything to be in agreement with the conjecture that "every…

Leavitt path algebras are associated to di(rected )graphs and there is a combinatorial procedure (the reduction algorithm) making the digraph smaller while preserving the Morita type. We can recover the vertices and most of the arrows of…

This paper continues the study of decompositions of a smooth 4-manifold into two handlebodies with handles of index $\leq2$. Part I gave existence results in terms of spines and chain complexes over the fundamental group of the ambient…

We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arises from a reformulation of previously known results…

This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the…

It has long been argued that higher categories provide the proper algebraic structure underlying state sum invariants of 4-manifolds. This idea has been refined recently, by proposing to use 2-groups and their representations as specific…

In this paper we present a combinatorial machinery, consisting of a graph tower $\overleftarrow \Gamma$ and vector towers $\overleftarrow v$ on $\overleftarrow \Gamma$, which allows us to efficiently describe all invariant measures $\mu =…

The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…