2 citations · 2 across the 4 of their papers we have counts for
4 papers
Bipartite Graphs as Polynomials, and Polynomials as Bipartite Graphs (with a view towards dividing in )
Andrey Grinblat, Viktor Lopatkin
The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial , and any directed finite bipartite graph can be…
On Realizability Of Gauss Diagrams And Constructions Of Meanders
Andrey Grinblat, Viktor Lopatkin
The problem of which Gauss diagram can be realized by plane curves is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. W…
On Realizability of Gauss Diagrams
Andrey Grinblat, Viktor Lopatkin
The problem of which Gauss diagram can be realized by knots is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show…
Petri Nets and its Polynomials
Andrey Grinblat, Viktor Lopatkin
For every finite Petri net, we construct a commutative polynomial in two variables and with coefficients from the semiring of natural numbers. We also present an inverse constructi…