Related papers: Unlinking symmetric quivers

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

We conjecture a relation between generalized quiver partition functions and generating functions for symmetrically colored HOMFLY-PT polynomials and corresponding HOMFLY-PT homology Poincar\'e polynomials of a knot $K$. We interpret the…

Let $C$ be a simply laced generalized Cartan matrix. Given an element $b$ of the generalized braid semigroup related to $C$, we construct a collection of mutation-equivalent quivers with potentials. A quiver with potential in such a…

We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…

We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…

We introduce and study a class of Iwanaga-Gorenstein algebras defined via quivers with relations associated with symmetrizable Cartan matrices. These algebras generalize the path algebras of quivers associated with symmetric Cartan…

For a rooted cluster algebra $\mathcal{A}(Q)$ over a valued quiver $Q$, a \emph{symmetric cluster variable} is any cluster variable belonging to a cluster associated with a quiver $\sigma (Q)$, for some permutation $\sigma$. The subalgebra…

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

All knots are fused isotopic to the unknot via a process known as virtualization. We extend and adapt this process to show that, up to fused isotopy, classical links are classified by their linking numbers.

An ordered $r$-uniform matching of size $n$ is a collection of $n$ pairwise disjoint $r$-subsets of a linearly ordered set of $rn$ vertices. For $n=2$, such a matching is called an $r$-pattern, as it represents one of $\tfrac12\binom{2r}r$…

We characterize sandwiched singularities in terms of their link in two different settings. We first prove that such singularities are precisely the normal surface singularities having self-similar non-archimedean links. We describe this…

We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…

The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…

We investigate generalised global symmetries in 3d $\mathcal{N}=4$ orthosymplectic quiver gauge theories. Using the superconformal index, we identify a $D_8$ categorical symmetry web in a class of theories featuring $\mathfrak{so}(2N)…

Kempf [1976] studied proper, G-equivariant maps from equivariant vector bundles over flag manifolds to G-representations V, which he called _collapsings_. We give a simple formula for the G-equivariant cohomology class on V,…

Dujmovi\'c et al. [\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or…

This paper gives the first examples of gordian unlinks. The components of these unlinks cannot be separated while maintaining constant length and thickness. We construct infinite families of 2-component gordian unlinks and also construct…

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…

The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…

We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points…