A. Grinblat

activity

20152019

most citedOn Realizability Of Gauss Diagrams And Constructions Of Meanders

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing 2019Show all

1 paper · 1 filter

math.RA2019

Bipartite Graphs as Polynomials, and Polynomials as Bipartite Graphs (with a view towards dividing in $N [x],$ $N [x, y]$ )

Andrey Grinblat, Viktor Lopatkin

The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \in N [x]$ , and any directed finite bipartite graph can be…

Bipartite Graphs as Polynomials, and Polynomials as Bipartite Graphs (with a view towards dividing in N[x], N[x,y])

Bipartite Graphs as Polynomials, and Polynomials as Bipartite Graphs (with a view towards dividing in $N [x],$ $N [x, y]$ )