English
Related papers

Related papers: Grid diagram for singular links

200 papers

In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…

Logic in Computer Science · Computer Science 2017-01-11 Francois Lamarche , Lutz Strassburger

We give an overview on the tt*-geometry defined for isolated hypersurface singularities and tame functions via Brieskorn lattices. We discuss nilpotent orbits in this context, as well as classifying spaces of Brieskorn lattices and (limits…

Algebraic Geometry · Mathematics 2008-07-15 Claus Hertling , Christian Sevenheck

We investigate a structural generalisation of treewidth we call $\mathcal{A}$-blind-treewidth where $\mathcal{A}$ denotes an annotated graph class. This width parameter is defined by evaluating only the size of those bags $B$ of…

Combinatorics · Mathematics 2024-10-03 J. Pascal Gollin , Sebastian Wiederrecht

Connections on a trivial bundle MxG can be identified with their holonomy maps, i.e. with homomorphisms of a groupoid of paths in M into the gauge group G. For a connected compact G, various algebras depending on the set of the smooth…

Mathematical Physics · Physics 2015-06-26 Maria Cristina Abbati , Alessandro Mania`

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…

Combinatorics · Mathematics 2026-02-03 Peter J. Cameron

It is known that there are infinitely many exceptional sequences of quiver representations for Euclidean quivers. In this paper we study those of type $\tilde{\mathbb{A}}_n$ and classify them into finitely many parametrized families. We…

Representation Theory · Mathematics 2023-06-02 Ray Maresca

We introduce a new class of graphical models that generalizes Lauritzen-Wermuth-Frydenberg chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to two edges are allowed…

Machine Learning · Statistics 2018-03-02 Jose M. Peña

We characterise the slices of the category of graphs that are algebraically universal in terms of the structure of the slicing graph. In particular, we show that algebraic universality is obtained if, and only if, the slicing graph contains…

Combinatorics · Mathematics 2023-10-06 Ioannis Eleftheriadis

In this paper we build an abstract description of vertex algebras from their basic axioms. Starting with Borcherds' notion of a vertex group, we naturally construct a family of multilinear singular maps parameterised by trees. These…

Quantum Algebra · Mathematics 2007-05-23 Craig T. Snydal

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…

Combinatorics · Mathematics 2026-05-18 Oliver Bernardi , Jonathan J. Fang

The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…

Combinatorics · Mathematics 2026-04-07 Xiaodi Song , Cristina Dalfó , Miquel Àngel Fiol , Mercè Mora , Shenggui Zhang

The total domination number of a graph $G$ without isolated vertices is the minimum number of vertices that dominate all vertices in $G$. The total bondage number $b_t(G)$ of $G$ is the minimum number of edges whose removal enlarges the…

Combinatorics · Mathematics 2011-09-20 Fu-Tao Hu , You Lu , Jun-Ming Xu

For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…

Combinatorics · Mathematics 2024-03-12 S. R. Musawi , S. H. Jafari

We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…

Combinatorics · Mathematics 2017-04-12 Nikolaos Apostolakis , Kerry Ojakian

A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…

Combinatorics · Mathematics 2012-02-06 Michael H. Albert , M. D. Atkinson , Mathilde Bouvel , Nik Ruškuc , Vincent Vatter

A generalised Legendrian rack is a rack equipped with a Legendrian structure, which is a pair of maps encoding the information of Legendrian Reidemeister moves together with up and down cusps in the front diagram of an oriented Legendrian…

Geometric Topology · Mathematics 2025-10-15 Biswadeep Karmakar , Deepanshi Saraf , Mahender Singh

We study braid varieties and their relation to open positroid varieties. We discuss four different types of braids associated to open positroid strata and show that their associated Legendrian links are all Legendrian isotopic. In…

Algebraic Geometry · Mathematics 2026-01-22 Roger Casals , Eugene Gorsky , Mikhail Gorsky , José Simental

We consider spaces of plane curves in the setting of algebraic geometry and of singularity theory. On one hand there are the complete linear systems, on the other we consider unfolding spaces of bivariate polynomials of Brieskorn-Pham type.…

Algebraic Geometry · Mathematics 2010-07-08 Michael Lönne

In the paper we give an exhaustive arithmetic criterion of adjacency in prime graph $GK(G)$ for every finite nonabelian simple group $G$. By using this criterion for all finite simple groups an independence set with the maximal number of…

Group Theory · Mathematics 2018-10-30 Anrei V. Vasilév , Evgeny P. Vdovin

We introduce braided Lie bialgebras as the infinitesimal version of braided groups. They are Lie algebras and Lie coalgebras with the coboundary of the Lie cobracket an infinitesimal braiding. We provide theorems of transmutation, Lie…

q-alg · Mathematics 2008-02-03 S. Majid