Related papers: Handle slides for delta-matroids
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…
Any irreducible Dynkin diagram $\Delta$ is obtained from an irreducible Dynkin diagram $\Delta_h$ of type $\mathrm{ADE}$ by folding via graph automorphisms. For any simple complex Lie group $G$ with Dynkin diagram $\Delta$ and compact…
In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…
Inspired by the seminal result that a graph and an associated rotation system uniquely determine the topology of a closed manifold, we propose a combinatorial method for reconstruction of surfaces from points. Our method constructs a…
Consider the network of elements connected by adjacency in atomic number and periodic table column. If all elements except H-He are connected by identical springs and constrained to a z-spiral in 2D, a map sans spring-crossing results for…
A G-gain graph is a graph whose oriented edges are labeled invertibly from a group G. Zaslavsky proposed two matroids of G-gain graphs, called frame matroids and lift matroids, and investigated linear representations of them. Each matroid…
We consider orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Sigma)$, where $\Sigma$ denotes a compact connected surface embedded in $S^3$. In a previous paper, we considered the case of closed, necessarily orientable…
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix…
In this short note we make a few remarks on a class of generalized incidence matrices whose matroids do not depend on the orientation of the underlying graph and natural commutative algebras associated to such matrices.
This paper presents a new type of distributed dexterous manipulator: delta arrays. Our delta array setup consists of 64 linearly-actuated delta robots with 3D-printed compliant linkages. Through the design of the individual delta robots,…
A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed…
This paper is the first part in a 2 part study of an elementary functorial construction from the category of finite non-abelian groups to a category of singular compact, oriented 2-manifolds. After a desingularization process this…
We characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists of rotations and translations. Along the way, we use tropical…
In this paper we present the construction of a skeletal diagram category, which we call the square with bands category. This category extends the Temperley-Lieb (TL) category, where morphisms now include diagrams of embedded curves on…
We study stable immersed capillary hypersurfaces in a domain $\mathcal B$ which is either a half-space or a slab in the Euclidean space $\Bbb R^{n+1}.$ We prove that such a hypersurface $\Sigma$ is rotationally symmetric in the following…
The framed little 2-discs operad is homotopy equivalent to a cyclic operad. We show that the derived modular envelope of this cyclic operad (i.e., the modular operad freely generated in a homotopy invariant sense) is homotopy equivalent to…
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
For a continuous map on a topological graph containing a loop $S$ it is possible to define the degree (with respect to the loop $S$) and, for a map of degree $1$, rotation numbers. We study the rotation set of these maps and the periods of…
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…