Related papers: Towards equivalent thickened ribbon Schur function…
Schur functions satisfy the relative Pl\"ucker relations which describe the projective embedding of the flag varieties and the Hirota bilinear equations for the modified KP hierarchies. These relative Pl\"ucker relations are generalized to…
Bidirected graphs (earlier studied by Edmonds, Johnson and, in equivalent terms of skew-symmetric graphs, by Tutte, Goldberg, Karzanov, and others) proved to be a useful unifying language for describing both flow and matching problems. In…
We define and study sl\_2-categorifications on abelian categories. We show in particular that there is a self-derived (even homotopy) equivalence categorifying the adjoint action of the simple reflection. We construct categorifications for…
Perverse schobers are categorical analogs of perverse sheaves. Examples arise from varieties admitting flops, determined by diagrams of derived categories of coherent sheaves associated to the flop: in this paper we construct mirror…
A $k$-ribbon tiling is a decomposition of a connected skew diagram into disjoint ribbons of size $k$. In this paper, we establish a connection between a subset of $k$-ribbon tilings and Petrie symmetric functions, thus providing a…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
A bridgeless cubic graph $G$ is said to have a 2-bisection if there exists a 2-vertex-colouring of $G$ (not necessarily proper) such that: (i) the colour classes have the same cardinality, and (ii) the monochromatic components are either an…
In this paper, we go into the study of the 2-category SSS_\Sigma of \Sigma-constructible stacks. The notions of constructible stack was introduced by D. Treumann. It is a natural generalization of constructible sheaf. D. Treumann has also…
We show that for any n > 3 there exists an equivalence functor from the category of n-fold connected simple coverings of B^3 x [0, 1] branched over ribbon surface tangles up to certain local ribbon moves, to the category Chb^{3+1} of…
Kronheimer and Mrowka asked whether the difference between the four-dimensional clasp number and the slice genus can be arbitrarily large. This question is answered affirmatively by studying a knot invariant derived from equivariant…
We introduce a new family of symmetric functions, which are $q$-analogues of products of Schur functions defined in terms of ribbon tableaux. These functions can be interpreted in terms of the Fock space representation of the quantum affine…
We use dual equivalence to give a short, combinatorial proof that Stanley symmetric functions are Schur positive. We introduce weak dual equivalence, and use it to give a short, combinatorial proof that Schubert polynomials are key…
We propose the notion of association schemoids generalizing that of association schemes from small categorical points of view. In particular, a generalization of the Bose-Mesner algebra of an association scheme appears as a subalgebra in…
The symmetric difference of two graphs $G_1,G_2$ on the same set of vertices $V$ is the graph on $V$ whose set of edges are all edges that belong to exactly one of the two graphs $G_1,G_2$. For a fixed graph $H$ call a collection ${\cal G}$…
It was recently shown in [24] that the Banach space operator relations Equivalence After Extension (EAE) and Schur Coupling (SC) do not coincide by characterizing these relations for operators acting on essentially incomparable Banach…
We show that if a multigraph $G$ with maximum edge-multiplicity of at most $\frac{\sqrt{n}}{\log^2 n}$, is edge-coloured by $n$ colours such that each colour class is a disjoint union of cliques with at least $2n + o(n)$ vertices, then it…
Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…
A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…
According to Letourmy and Vendramin, a representation of a skew brace is a pair of representations on the same vector space, one for the additive group and the other for the multiplicative group, that satisfies a certain compatibility…
Two Seifert surfaces of links in $S^3$ are said to be twist equivalent if one can be obtained from the other, up to isotopy, by repeatedly performing operations consisting of cutting along an embedded arc, applying a full twist near one…