Related papers: On partita doppia
The category of open games, which provides a strongly compositional foundation of economic game theory, is intermediate between symmetric monoidal and compact closed. More precisely it has counits with no corresponding units, and a…
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…
Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent…
We define higher categorical invariants (gerbes) of codimension two algebraic cycles and provide a categorical interpretation of the intersection of divisors on a smooth proper algebraic variety. This generalization of the classical…
Pairwise comparison matrices are widely used in Multicriteria Decision Making. This article applies incomplete pairwise comparison matrices in the area of sport tournaments, namely proposing alternative rankings for the 2010 Chess Olympiad…
The concept of graph powers has been extensively studied in graph theory. Analogous to graph powers, Chandran et al. [3] introduced the notion of bipartite powers for bipartite graphs. In this paper, we show that the class of interval…
This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.
A complete classification of two-dimensional algebras over algebraically closed fields is provided
We provide a canonical decomposition for a class of bipartite grafts known as combs. As every bipartite graft is a recursive combination of combs, our results provides a canonical decomposition for general bipartite grafts. Our new…
Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program…
We introduce the bicategory of bialgebras with coverings (which can be thought of as coalgebra-indexed families of morphisms), and provide a motivating application to the transfer of formulas for primitives and antipode. Additionally, we…
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood and the in-neighbourhood of any vertex induce a semicomplete digraph. In this paper we study various…
Recently, there has been growing interest in bicategorical models of programming languages, which are "proof-relevant" in the sense that they keep distinct account of execution traces leading to the same observable outcomes, while assigning…
Arithmetical structures on a graph were introduced by Lorenzini as some intersection matrices that arise in the study of degenerating curves in algebraic geometry. In this article we study these arithmetical structures, in particular we are…
The cartesian structure possessed by relations, spans, profunctors, and other such morphisms is elegantly expressed by universal properties in double categories. Though cartesian double categories were inspired in part by the older program…
The quadratic rank two Jacobi algebra is identified from the relations obeyed by the bispectral operators of the two variable Jacobi polynomials orthogonal on the triangle. It is seen to admit as subalgebras Racah and Jacobi algebras of…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
A reflection mapping is a singular holomorphic mapping obtained by restricting the quotient mapping of a complex reflection group. We study the analytic structure of double point spaces of reflection mappings. In the case where the image is…
We introduce Backstr\"om pairs and Backstr\"om rings, study their derived categories and construct for them a sort of categorical resolutions. For the latter we define the global dimension, construct a sort of semi-orthogonal decomposition…
Using an algebraic characterization of circle graphs, Bouchet proved in 1999 that if a bipartite graph $G$ is the complement of a circle graph, then $G$ is a circle graph. We give an elementary proof of this result.