Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Alexander V. Treier"'
Publikováno v:
Journal of Physics: Conference Series. 1901:012032
In this paper we show that there exist two simple graphs such that they are elementary equivalent but one of them is equationally noetherian and the other one is not. Therefore the equational noethericity property of simple graphs is not first order
Publikováno v:
Journal of Physics: Conference Series. 1546:012099
In this paper we describe equivalence classes generated by finite graphs in the graph theory language without equality predicate. These classes coincide with classes of so called hard extensions of graphs.
Publikováno v:
Journal of Physics: Conference Series. 1260:022009
In this article, we show that the concept of graph compression is important for the study of universal equivalence of simple graphs (not necessarily finite) and graph algebraic structures.
Publikováno v:
Algebra and Logic. 49:43-67
Let R be a ring, which is either a ring of integers or a field of zero characteristic. For every finite graph Γ, we construct an R-arithmetic linear group H(Γ). The group H(Γ) is realized as the factor automorphism group of a partially commutative