Related papers: Partial duality of hypermaps
We recapture Kuperberg's numerical invariant of 3-manifolds associated to a semisimple and cosemisimple Hopf algebra through a `planar algebra construction'. A result of possibly independent interest, used during the proof, which relates…
Huggett and Moffatt characterized all bipartite partial duals of a plane graph in terms of all-crossing directions of its medial graph. Then Metsidik and Jin characterized all Eulerian partial duals of a plane graph in terms of…
Delta-matroid theory is often thought of as a generalization of topological graph theory. It is well-known that an orientable embedded graph is bipartite if and only if its Petrie dual is orientable. In this paper, we first introduce the…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We describe two extensions of the notion of a self-dual connection in a vector bundle over a manifold M from dim M=4 to higher dimensions. The first extension, Omega-self-duality, is based on the existence of an appropriate 4-form Omega on…
The well-known twenty types of 2-uniform tilings of the plane give rise infinitely many doubly semi-equivelar maps on the torus. In this article, we show that every such doubly semi-equivelar map on the torus contains a Hamiltonian cycle.…
Persistent homology is a fundamental tool in Topological Data Analysis. The associated algebraic structure is the persistence module, a sequence of vector spaces connected by linear maps. Persistence modules admit a complete and…
In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
We use sign-reversing involutions to solve two computational problems that arise naturally in the geometry of moduli spaces of curves. In particular, we give an explicit combinatorial formula for arbitrary $\psi$ class intersection products…
We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…
We elucidate the vector space (twisted relative cohomology) that is Poincar\'e dual to the vector space of Feynman integrals (twisted cohomology) in general spacetime dimension. The pairing between these spaces - an algebraic invariant…
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that ``neighbouring'' hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour,…
We introduce holomorphic Riemannian maps between almost Hermitian manifolds as a generalization of holomorphic submanifolds and holomorphic submersions, give examples and obtain a geometric characterization of harmonic holomorphic…
We define Poincar\'{e} profiles of Dirichlet type for graphs of bounded degree, in analogy with the Poincar\'{e} profiles (of Neumann type) defined in [HMT19]. The obvious first definition yields nothing of interest, but an alternative…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…
A geometric extension algebra is an extension algebra of a semi-simple perverse sheaf (allowing shifts), e.g. a push-forward of the constant sheaf under a projective map. Particular nice situations arise for collapsings of homogeneous…
Normals with unknown parameters (NUP) can be used to convert nontrivial model-based estimation problems into iterations of linear least-squares or Gaussian estimation problems. In this paper, we extend this approach by augmenting factor…