Geometric series of binary relation











up vote
1
down vote

favorite












Let $rhosubset Xtimes X$ be a symmetric binary relation on a finite set $X$. Let $overline{rho}subset Xtimes X$ be its transitive closure :
$$
overline{rho}=bigcup_{i=0}^infty rho^{circ i}.
$$

If we choose a labeling $sigma:{1,dots,n}xrightarrowsim X$ of the elements of $X$ and consider the associated matrix $overline{M}=(overline{m}_{ij})$ whose entries are in ${0,1}$ and satisfy
$$
overline{m}_{ij}=begin{cases}
1 & text{if }(sigma(i),sigma(j))inoverline{rho},\
0 & text{if }(sigma(i),sigma(j))notinoverline{rho}
end{cases}
$$

then we get that if $L$ is the cardinality of the largest equivalence class in $overline{rho}$, and there are $c$ such equivalence classes, then
$$mathrm{Tr}(overline{M}^k)simeq cL^{k+1}$$




Question. Is there a procedure to extract $c$ and $L$ straight from $rho$ and its associated symmetric matrix ?











share|cite|improve this question


























    up vote
    1
    down vote

    favorite












    Let $rhosubset Xtimes X$ be a symmetric binary relation on a finite set $X$. Let $overline{rho}subset Xtimes X$ be its transitive closure :
    $$
    overline{rho}=bigcup_{i=0}^infty rho^{circ i}.
    $$

    If we choose a labeling $sigma:{1,dots,n}xrightarrowsim X$ of the elements of $X$ and consider the associated matrix $overline{M}=(overline{m}_{ij})$ whose entries are in ${0,1}$ and satisfy
    $$
    overline{m}_{ij}=begin{cases}
    1 & text{if }(sigma(i),sigma(j))inoverline{rho},\
    0 & text{if }(sigma(i),sigma(j))notinoverline{rho}
    end{cases}
    $$

    then we get that if $L$ is the cardinality of the largest equivalence class in $overline{rho}$, and there are $c$ such equivalence classes, then
    $$mathrm{Tr}(overline{M}^k)simeq cL^{k+1}$$




    Question. Is there a procedure to extract $c$ and $L$ straight from $rho$ and its associated symmetric matrix ?











    share|cite|improve this question
























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      Let $rhosubset Xtimes X$ be a symmetric binary relation on a finite set $X$. Let $overline{rho}subset Xtimes X$ be its transitive closure :
      $$
      overline{rho}=bigcup_{i=0}^infty rho^{circ i}.
      $$

      If we choose a labeling $sigma:{1,dots,n}xrightarrowsim X$ of the elements of $X$ and consider the associated matrix $overline{M}=(overline{m}_{ij})$ whose entries are in ${0,1}$ and satisfy
      $$
      overline{m}_{ij}=begin{cases}
      1 & text{if }(sigma(i),sigma(j))inoverline{rho},\
      0 & text{if }(sigma(i),sigma(j))notinoverline{rho}
      end{cases}
      $$

      then we get that if $L$ is the cardinality of the largest equivalence class in $overline{rho}$, and there are $c$ such equivalence classes, then
      $$mathrm{Tr}(overline{M}^k)simeq cL^{k+1}$$




      Question. Is there a procedure to extract $c$ and $L$ straight from $rho$ and its associated symmetric matrix ?











      share|cite|improve this question













      Let $rhosubset Xtimes X$ be a symmetric binary relation on a finite set $X$. Let $overline{rho}subset Xtimes X$ be its transitive closure :
      $$
      overline{rho}=bigcup_{i=0}^infty rho^{circ i}.
      $$

      If we choose a labeling $sigma:{1,dots,n}xrightarrowsim X$ of the elements of $X$ and consider the associated matrix $overline{M}=(overline{m}_{ij})$ whose entries are in ${0,1}$ and satisfy
      $$
      overline{m}_{ij}=begin{cases}
      1 & text{if }(sigma(i),sigma(j))inoverline{rho},\
      0 & text{if }(sigma(i),sigma(j))notinoverline{rho}
      end{cases}
      $$

      then we get that if $L$ is the cardinality of the largest equivalence class in $overline{rho}$, and there are $c$ such equivalence classes, then
      $$mathrm{Tr}(overline{M}^k)simeq cL^{k+1}$$




      Question. Is there a procedure to extract $c$ and $L$ straight from $rho$ and its associated symmetric matrix ?








      symmetric-matrices spectral-graph-theory






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked yesterday









      Olivier Bégassat

      13.2k12272




      13.2k12272



























          active

          oldest

          votes











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "69"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














           

          draft saved


          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005033%2fgeometric-series-of-binary-relation%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















           

          draft saved


          draft discarded



















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005033%2fgeometric-series-of-binary-relation%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

          Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

          A Topological Invariant for $pi_3(U(n))$