Related papers: On partita doppia
The paper explores the concept of the rank of a bicomplex matrix, delving into four distinct types of ranks and investigating conditions under which these ranks are equivalent. It also defines and analyzes the concept of idempotent row…
Any nonempty, compact, semi-algebraic set in [0, 1] n is the projection of the set of mixed equilibria of a finite game with 2 actions per player on its first n coordinates. A similar result follows for sets of equilibrium payoffs. The…
The goal of this article is to understand some interesting features of sequences of arbitrage operations, which look relevant to various processes in Economics and Finances. In the second part of the paper, analysis of sequences of…
Let $D$ be a connected component of a possibly disconnected reductive group $G$ over an algebraic closed field. We define a partition of $D$ into finitely many Strata each of which is a union of $G^0$-conjugacy classes of fixed dimension.…
Argument graphs provide an abstract representation of an argumentative situation. A bipolar argument graph is a directed graph where each node denotes an argument, and each arc denotes the influence of one argument on another. Here we…
For a couple of associative algebras we define the notion of their double and give a set of examples. Also, we discuss applications of such doubles to representation theory of certain quantum algebras and to a new type of Noncommutative…
The analysis of games played on graph-like structures is of increasing importance due to the prevalence of social networks, both virtual and physical, in our daily life. As well as being relevant in computer science, mathematical analysis…
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.
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…
We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…
Let $\gamma_1,\gamma_2$ be a pair of constant-degree irreducible algebraic curves in $\mathbb{R}^d$. Assume that $\gamma_i$ is neither contained in a hyperplane nor in a quadric surface in $\mathbb{R}^d$, for each $i=1,2$. We show that for…
We show that the points of a global function field, whose classes are 2-divisible in the Picard group, form a connected graph, with the incidence relation generalizing the well known quadratic reciprocity law. We prove that for every global…
We show how one can do algebraic geometry with respect to the category of simplicial objects in an exact category. As a biproduct, we get a theory of derived analytic geometry.
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…
This is an expository paper extending the tutorial talk at the MATRIX Workshop on Uniqueness and Discernment in Graph Polynomials in October 2023. The explanation is mainly based on the paper "Partial Duality of Hypermaps" by S.Chmutov and…
The article presents an algebra to represent two dimensional patterns using reciprocals of polynomials. Such a representation will be useful in neural network training and it provides a method of training patterns that is much more…
We describe an analogue of the notion of a perverse sheaf in the setting of the derived category of coherent sheaves on an algebraic stack. Under strong additional assumptions the construction of coherent "intersection cohomology" complexes…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
It is proved that association schemes with bipartite basis graphs are exactly 2-schemes. This result follows from a characterization of p-schemes for an arbitrary prime p in terms of basis digraphs.
This paper is devoted to the presentation of combinatorial bialgebras whose coproduct is defined with the help of a commutative semigroup. We consider this setting in order to give a general framework which admits as special cases the…