pith. sign in

arxiv: 1903.10386 · v1 · pith:K6A5RMC2new · submitted 2019-03-25 · 🧮 math.RT

Lipschitz property for systems of linear mappings and bilinear forms

classification 🧮 math.RT
keywords directedlinearvectorbilinearclosecorrespondingedgeisomorphic
0
0 comments X
read the original abstract

Let G be a graph with undirected and directed edges. Its representation is given by assigning a vector space to each vertex, a bilinear form on the corresponding vector spaces to each directed edge, and a linear map to each directed edge. Two representations A and A' of G are called isomorphic if there is a system of linear bijections between the vector spaces corresponding to the same vertices that transforms A to A'. We prove that if two representations are isomorphic and close to each other, then their isomorphism can be chosen close to the identity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.