2,834 research outputs found

    Remarks on Graphons

    Get PDF
    The notion of the graphon (a symmetric measurable fuzzy set of [0,1]2[0, 1]^2) was introduced by L. Lov\'asz and B. Szegedy in 2006 to describe limit objects of convergent sequences of dense graphs. In their investigation the integral t(F,W)=[0,1]kijE(F)W(xi,xj)dx1dx2dxkt(F,W)=\int _{[0, 1]^k}\prod _{ij\in E(F)}W(x_i,x_j)dx_1dx_2\cdots dx_k plays an important role in which WW is a graphon and E(F)E(F) denotes the set of all edges of a kk-labelled simple graph FF. In our present paper we show that the set of all fuzzy sets of [0,1]2[0, 1]^2 is a right regular band with respect to the operation \circ defined by (fg)(s,t)=(x,y)[0,1]2(f(x,y)g(s,t));(s,t)[0,1]2,(f\circ g)(s,t)=\vee _{(x,y)\in [0, 1]^2}(f(x,y)\wedge g(s,t));\quad (s, t)\in [0, 1]^2, and the set of all graphons is a left ideal of this band. We prove that, if WW is an arbitrary graphon and ff is a fuzzy set of [0,1]2[0, 1]^2, then t(F;W)t(F;fW)E(F)(sup(W)sup(f))Δ({W>sup(f)})|t(F; W)-t(F; f\circ W)|\leq |E(F)|(\sup(W)-\sup(f))\Delta (\{W> \sup(f)\} ) for arbitrary finite simple graphs FF, where Δ({W>sup(f)})\Delta (\{W> \sup(f)\}) denotes the area of the set {W>sup(f)}\{W>\sup(f)\} of all (x,y)[0,1]2(x, y)\in [0, 1]^2 satisfying W(x,y)>sup(f)W(x,y)>\sup(f).Comment: 11 page

    Remarks on the paper "M. Kolibiar, On a construction of semigroups"

    Get PDF
    In his paper "On a construction of semigroups", M. Kolibiar gives a construction for a semigroup TT (beginning from a semigroup SS) which is said to be derived from the semigroup SS by a θ\theta-construction. He asserted that every semigroup TT can be derived from the factor semigroup T/θ(T)T/\theta (T) by a θ\theta-construction, where θ(T)\theta (T) is the congruence on TT defined by: (a,b)θ(T)(a, b)\in \theta (T) if and only if xa=xbxa=xb for all xTx\in T. Unfortunately, the paper contains some incorrect part. In our present paper we give a revision of the paper.Comment: Version v5 differs from the published and the earlier versions in the following: some part of the proof of Theorem 2 are clarified, and some typing errors are correcte

    The Algebraic View of Computation

    Full text link
    We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.Comment: 13 pages, final version will be published elsewher
    corecore