Related papers: Invariant Bridges Between Four Successive Points: …

Various classes of Graph Neural Networks (GNN) have been proposed and shown to be successful in a wide range of applications with graph structured data. In this paper, we propose a theoretical framework able to compare the expressive power…

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…

We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of topology and…

The fundamental representations of the special linear group ${\rm SL}_n$ over the complex numbers are the exterior powers of $\mathbb{C}^n$. We consider the invariant rings of sums of arbitrary many copies of these ${\rm SL}_n$-modules. The…

Motivated by the quest for a broader understanding of communication complexity of simple functions, we introduce the class of "permutation-invariant" functions. A partial function $f:\{0,1\}^n \times \{0,1\}^n\to \{0,1,?\}$ is…

We show that for an $n$-component, $n$-bridge link and a positive integer $m$, the following is true: If the longitudes of $L$ lie in the $(m+2)$-th term of the lower central series of the link group then all the finite type invariants of…

A new link invariant is derived using the exactly solvable chiral Potts model and a generalized Gaussian summation identity. Starting from a general formulation of link invariants using edge-interaction spin models, we establish the…

Progress on graph foundation models is hindered by benchmark practices that conflate the contributions of node features and graph structure, making it hard to tell whether a model actually learns from connectivity, or whether it even needs…

We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…

We introduce a triple coproduct for knots on surfaces, providing a commutative framework that decomposes a single-component diagram into three components (Section 2). This construction is motivated by the interplay between intersection…

Cartan's equivalence method is applied to explicitly construct invariant coframes for four branches, which are used to characterize all non-linearizable third-order ODEs with a four-dimensional Lie symmetry subalgebra under point…

We continue the work of [1, 2, 3] by analyzing the equivalence relation of bi-embeddability on various classes of countable planes, most notably the class of countable non-Desarguesian projective planes. We use constructions of the second…

In the present paper we construct differential invariants for generic rank 2 vector distributions on n-dimensional manifold. In the case n=5 (the first case containing functional parameters) E. Cartan found in 1910 the covariant…

We report new topological invariants in four dimensions that are generalizations of the Nieh-Yan topological invariant. The new topological invariants are obtained through a systematic method along the lines of the one used to get the…

We consider pairs of maps $(f,g)$, where $f$ is an $n$-valued map and $g$ is an $m$-valued map, defined on connected finite polyhedra. A point $x$ such that $f(x)\cap g(x)\neq \emptyset$ is called a coincidence point of $f$ and $g$. A…

We study the Donaldson invariants of simply connected $4$-manifolds with $b_+=1$, and in particular the change of the invariants under wall-crossing. We assume the conjecture of Kotschick and Morgan about the shape of the wall-crossing…

We show that embedding calculus invariants $ev_n$ are surjective for long knots in an arbitrary $3$-manifold. This solves some remaining open cases of Goodwillie--Klein--Weiss connectivity estimates, and at the same time confirms one half…

Invariant and equivariant networks are useful in learning data with symmetry, including images, sets, point clouds, and graphs. In this paper, we consider invariant and equivariant networks for symmetries of finite groups. Invariant and…

Using the language of Riordan arrays, we look at two related iterative processes on matrices and determine which matrices are invariant under these processes. In a special case, the invariant sequences that arise are conjectured to have…

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…