Conditions when a permutation matrix is symmetric Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Symmetric Permutation Matrixeigendecomposition of a symmetric singular matrix and definition of unitary matrixNot getting the right answer for a matrix in reduced column echelon form.Prove or disprove that trace of matrix $X$ is zeroSpectral radius of the product of a right stochastic matrix and hermitian matrixReducible matrices and strongly connected graphsEigenvalues and eigenspaces in a symmetric matrixbinary indexing matrixMatrix permutation-similarity invariantsMaximal diagonalization of a matrix by permutation matricesA very interesting property of symmetric positive definite matrix. Need proof! (Citation needed)

Conditions when a permutation matrix is symmetric

Getting prompted for verification code but where do I put it in?

How can I prevent/balance waiting and turtling as a response to cooldown mechanics

What does this say in Elvish?

Is multiple magic items in one inherently imbalanced?

Tannaka duality for semisimple groups

Co-worker has annoying ringtone

Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?

Semigroups with no morphisms between them

How were pictures turned from film to a big picture in a picture frame before digital scanning?

How does Belgium enforce obligatory attendance in elections?

What is the chair depicted in Cesare Maccari's 1889 painting "Cicerone denuncia Catilina"?

If the probability of a dog barking one or more times in a given hour is 84%, then what is the probability of a dog barking in 30 minutes?

macOS: Name for app shortcut screen found by pinching with thumb and three fingers

Crossing US/Canada Border for less than 24 hours

Deconstruction is ambiguous

Sum letters are not two different

How does light 'choose' between wave and particle behaviour?

Drawing spherical mirrors

How often does castling occur in grandmaster games?

What would you call this weird metallic apparatus that allows you to lift people?

How did Fremen produce and carry enough thumpers to use Sandworms as de facto Ubers?

How many morphisms from 1 to 1+1 can there be?

Do I really need to have a message in a novel to appeal to readers?



Conditions when a permutation matrix is symmetric



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Symmetric Permutation Matrixeigendecomposition of a symmetric singular matrix and definition of unitary matrixNot getting the right answer for a matrix in reduced column echelon form.Prove or disprove that trace of matrix $X$ is zeroSpectral radius of the product of a right stochastic matrix and hermitian matrixReducible matrices and strongly connected graphsEigenvalues and eigenspaces in a symmetric matrixbinary indexing matrixMatrix permutation-similarity invariantsMaximal diagonalization of a matrix by permutation matricesA very interesting property of symmetric positive definite matrix. Need proof! (Citation needed)










1












$begingroup$


I am now playing with permutation matrices, http://mathworld.wolfram.com/PermutationMatrix.html.



Also, there is a similar discussion: Symmetric Permutation Matrix.
I want to ask more details than this one.



As we know, a permutation matrix is orthogonal, i.e., $E^T=E^-1$. I am interested in when it is symmetric, i.e., $E^T=E^-1 = E$



Suppose



  1. Start from an identity matrix $I_n$.


  2. $n$ can be even or odd number.

  3. Pick $(i,j)$, where $0<i,jleq n$ and $i, j$ are integer. Exchange $i$-th and $j$-th columns of $I_n$ (identity matrix) and get $E$. Then $E$ is symmetric. This is because $E_ii=E_jj=0$ and $E_ij=E_ji=1$.

  4. Based on 3., if I pick a number of sets $(i,j)$, $(k,l)$, $(q,r), ldots$, without repeated index in each $(cdot,cdot)$, and permute columns of $I_n$ according to these sets, then the resulting permutation matrix $E$ is symmetric.

One key thing here is "without repeated index in each $(cdot,cdot)$". This is because if I do $(1,2)$ and $(2,3)$ for $I_3$ for example, I get



$$beginbmatrix0 & 0 & 1 \ 1 & 0 & 0 \ 0 & 1 & 0 endbmatrix,$$



which is not symmetric. In this case, I repeat $2$ in each suit.



Is the above correct? Or I miss some key assumptions?










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    Yes, in general the permutation is idempotent when is a disjoint product of fix points and cycles of length $2.$
    $endgroup$
    – Phicar
    4 hours ago






  • 1




    $begingroup$
    Yes, it's correct. A permutation matrix describes a permutation $pi$. You want $E^2 = I$, so $picircpi = id$.
    $endgroup$
    – amsmath
    4 hours ago















1












$begingroup$


I am now playing with permutation matrices, http://mathworld.wolfram.com/PermutationMatrix.html.



Also, there is a similar discussion: Symmetric Permutation Matrix.
I want to ask more details than this one.



As we know, a permutation matrix is orthogonal, i.e., $E^T=E^-1$. I am interested in when it is symmetric, i.e., $E^T=E^-1 = E$



Suppose



  1. Start from an identity matrix $I_n$.


  2. $n$ can be even or odd number.

  3. Pick $(i,j)$, where $0<i,jleq n$ and $i, j$ are integer. Exchange $i$-th and $j$-th columns of $I_n$ (identity matrix) and get $E$. Then $E$ is symmetric. This is because $E_ii=E_jj=0$ and $E_ij=E_ji=1$.

  4. Based on 3., if I pick a number of sets $(i,j)$, $(k,l)$, $(q,r), ldots$, without repeated index in each $(cdot,cdot)$, and permute columns of $I_n$ according to these sets, then the resulting permutation matrix $E$ is symmetric.

One key thing here is "without repeated index in each $(cdot,cdot)$". This is because if I do $(1,2)$ and $(2,3)$ for $I_3$ for example, I get



$$beginbmatrix0 & 0 & 1 \ 1 & 0 & 0 \ 0 & 1 & 0 endbmatrix,$$



which is not symmetric. In this case, I repeat $2$ in each suit.



Is the above correct? Or I miss some key assumptions?










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    Yes, in general the permutation is idempotent when is a disjoint product of fix points and cycles of length $2.$
    $endgroup$
    – Phicar
    4 hours ago






  • 1




    $begingroup$
    Yes, it's correct. A permutation matrix describes a permutation $pi$. You want $E^2 = I$, so $picircpi = id$.
    $endgroup$
    – amsmath
    4 hours ago













1












1








1





$begingroup$


I am now playing with permutation matrices, http://mathworld.wolfram.com/PermutationMatrix.html.



Also, there is a similar discussion: Symmetric Permutation Matrix.
I want to ask more details than this one.



As we know, a permutation matrix is orthogonal, i.e., $E^T=E^-1$. I am interested in when it is symmetric, i.e., $E^T=E^-1 = E$



Suppose



  1. Start from an identity matrix $I_n$.


  2. $n$ can be even or odd number.

  3. Pick $(i,j)$, where $0<i,jleq n$ and $i, j$ are integer. Exchange $i$-th and $j$-th columns of $I_n$ (identity matrix) and get $E$. Then $E$ is symmetric. This is because $E_ii=E_jj=0$ and $E_ij=E_ji=1$.

  4. Based on 3., if I pick a number of sets $(i,j)$, $(k,l)$, $(q,r), ldots$, without repeated index in each $(cdot,cdot)$, and permute columns of $I_n$ according to these sets, then the resulting permutation matrix $E$ is symmetric.

One key thing here is "without repeated index in each $(cdot,cdot)$". This is because if I do $(1,2)$ and $(2,3)$ for $I_3$ for example, I get



$$beginbmatrix0 & 0 & 1 \ 1 & 0 & 0 \ 0 & 1 & 0 endbmatrix,$$



which is not symmetric. In this case, I repeat $2$ in each suit.



Is the above correct? Or I miss some key assumptions?










share|cite|improve this question









$endgroup$




I am now playing with permutation matrices, http://mathworld.wolfram.com/PermutationMatrix.html.



Also, there is a similar discussion: Symmetric Permutation Matrix.
I want to ask more details than this one.



As we know, a permutation matrix is orthogonal, i.e., $E^T=E^-1$. I am interested in when it is symmetric, i.e., $E^T=E^-1 = E$



Suppose



  1. Start from an identity matrix $I_n$.


  2. $n$ can be even or odd number.

  3. Pick $(i,j)$, where $0<i,jleq n$ and $i, j$ are integer. Exchange $i$-th and $j$-th columns of $I_n$ (identity matrix) and get $E$. Then $E$ is symmetric. This is because $E_ii=E_jj=0$ and $E_ij=E_ji=1$.

  4. Based on 3., if I pick a number of sets $(i,j)$, $(k,l)$, $(q,r), ldots$, without repeated index in each $(cdot,cdot)$, and permute columns of $I_n$ according to these sets, then the resulting permutation matrix $E$ is symmetric.

One key thing here is "without repeated index in each $(cdot,cdot)$". This is because if I do $(1,2)$ and $(2,3)$ for $I_3$ for example, I get



$$beginbmatrix0 & 0 & 1 \ 1 & 0 & 0 \ 0 & 1 & 0 endbmatrix,$$



which is not symmetric. In this case, I repeat $2$ in each suit.



Is the above correct? Or I miss some key assumptions?







linear-algebra matrices permutations






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 4 hours ago









sleeve chensleeve chen

3,20042256




3,20042256







  • 1




    $begingroup$
    Yes, in general the permutation is idempotent when is a disjoint product of fix points and cycles of length $2.$
    $endgroup$
    – Phicar
    4 hours ago






  • 1




    $begingroup$
    Yes, it's correct. A permutation matrix describes a permutation $pi$. You want $E^2 = I$, so $picircpi = id$.
    $endgroup$
    – amsmath
    4 hours ago












  • 1




    $begingroup$
    Yes, in general the permutation is idempotent when is a disjoint product of fix points and cycles of length $2.$
    $endgroup$
    – Phicar
    4 hours ago






  • 1




    $begingroup$
    Yes, it's correct. A permutation matrix describes a permutation $pi$. You want $E^2 = I$, so $picircpi = id$.
    $endgroup$
    – amsmath
    4 hours ago







1




1




$begingroup$
Yes, in general the permutation is idempotent when is a disjoint product of fix points and cycles of length $2.$
$endgroup$
– Phicar
4 hours ago




$begingroup$
Yes, in general the permutation is idempotent when is a disjoint product of fix points and cycles of length $2.$
$endgroup$
– Phicar
4 hours ago




1




1




$begingroup$
Yes, it's correct. A permutation matrix describes a permutation $pi$. You want $E^2 = I$, so $picircpi = id$.
$endgroup$
– amsmath
4 hours ago




$begingroup$
Yes, it's correct. A permutation matrix describes a permutation $pi$. You want $E^2 = I$, so $picircpi = id$.
$endgroup$
– amsmath
4 hours ago










2 Answers
2






active

oldest

votes


















2












$begingroup$

You’re correct!



We can think of the action of $E$ on the set of $n$ standard basis vectors as a permutation $sigma$ on $1,dots,n$ and vice versa.



Let $E$ be symmetric, and let $i$ be the only nonzero entry in the first row. This means that $e_1i=e_i1$ by symmetry. Thus $E$ swaps the first and the $i^th$ standard basis vectors, so $(1~i)$ is a cycle in the cycle decomposition of $sigma$. This argument applies to the rest of the rows to show that $sigma$ is a product of disjoint transpositions.






share|cite|improve this answer









$endgroup$




















    2












    $begingroup$

    As you have noted condition for a permutation matrix $E$ to be symmetric
    is that $E^-1=E$, and this condition can be expressed as $E^2=I$.



    Interpreting the last condition as repeating the permutation is identity. So this represents a permutation that is its own inverse. That is if $E$ sends a basis vector $v$ to $W$ $E^2=I$ implies $Ew=v$. (possible that $v=w$)



    So this corresponds to a permutation where an element is fixed, or if it sends $x$ to $y$ then it has to send $y$ to $x$. Thus this consists of many disjoint swaps (and possibly some fixed points).



    In group theory it is a permutation of cycle type corresponding to the partition of $n$ into $2$'s and $1$'s. For example $9=2+2+2+ 1^6 $ (that is 1 repeated six times).






    share|cite|improve this answer









    $endgroup$













      Your Answer








      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',
      autoActivateHeartbeat: false,
      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%2f3194162%2fconditions-when-a-permutation-matrix-is-symmetric%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2












      $begingroup$

      You’re correct!



      We can think of the action of $E$ on the set of $n$ standard basis vectors as a permutation $sigma$ on $1,dots,n$ and vice versa.



      Let $E$ be symmetric, and let $i$ be the only nonzero entry in the first row. This means that $e_1i=e_i1$ by symmetry. Thus $E$ swaps the first and the $i^th$ standard basis vectors, so $(1~i)$ is a cycle in the cycle decomposition of $sigma$. This argument applies to the rest of the rows to show that $sigma$ is a product of disjoint transpositions.






      share|cite|improve this answer









      $endgroup$

















        2












        $begingroup$

        You’re correct!



        We can think of the action of $E$ on the set of $n$ standard basis vectors as a permutation $sigma$ on $1,dots,n$ and vice versa.



        Let $E$ be symmetric, and let $i$ be the only nonzero entry in the first row. This means that $e_1i=e_i1$ by symmetry. Thus $E$ swaps the first and the $i^th$ standard basis vectors, so $(1~i)$ is a cycle in the cycle decomposition of $sigma$. This argument applies to the rest of the rows to show that $sigma$ is a product of disjoint transpositions.






        share|cite|improve this answer









        $endgroup$















          2












          2








          2





          $begingroup$

          You’re correct!



          We can think of the action of $E$ on the set of $n$ standard basis vectors as a permutation $sigma$ on $1,dots,n$ and vice versa.



          Let $E$ be symmetric, and let $i$ be the only nonzero entry in the first row. This means that $e_1i=e_i1$ by symmetry. Thus $E$ swaps the first and the $i^th$ standard basis vectors, so $(1~i)$ is a cycle in the cycle decomposition of $sigma$. This argument applies to the rest of the rows to show that $sigma$ is a product of disjoint transpositions.






          share|cite|improve this answer









          $endgroup$



          You’re correct!



          We can think of the action of $E$ on the set of $n$ standard basis vectors as a permutation $sigma$ on $1,dots,n$ and vice versa.



          Let $E$ be symmetric, and let $i$ be the only nonzero entry in the first row. This means that $e_1i=e_i1$ by symmetry. Thus $E$ swaps the first and the $i^th$ standard basis vectors, so $(1~i)$ is a cycle in the cycle decomposition of $sigma$. This argument applies to the rest of the rows to show that $sigma$ is a product of disjoint transpositions.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 2 hours ago









          Santana AftonSantana Afton

          3,1922730




          3,1922730





















              2












              $begingroup$

              As you have noted condition for a permutation matrix $E$ to be symmetric
              is that $E^-1=E$, and this condition can be expressed as $E^2=I$.



              Interpreting the last condition as repeating the permutation is identity. So this represents a permutation that is its own inverse. That is if $E$ sends a basis vector $v$ to $W$ $E^2=I$ implies $Ew=v$. (possible that $v=w$)



              So this corresponds to a permutation where an element is fixed, or if it sends $x$ to $y$ then it has to send $y$ to $x$. Thus this consists of many disjoint swaps (and possibly some fixed points).



              In group theory it is a permutation of cycle type corresponding to the partition of $n$ into $2$'s and $1$'s. For example $9=2+2+2+ 1^6 $ (that is 1 repeated six times).






              share|cite|improve this answer









              $endgroup$

















                2












                $begingroup$

                As you have noted condition for a permutation matrix $E$ to be symmetric
                is that $E^-1=E$, and this condition can be expressed as $E^2=I$.



                Interpreting the last condition as repeating the permutation is identity. So this represents a permutation that is its own inverse. That is if $E$ sends a basis vector $v$ to $W$ $E^2=I$ implies $Ew=v$. (possible that $v=w$)



                So this corresponds to a permutation where an element is fixed, or if it sends $x$ to $y$ then it has to send $y$ to $x$. Thus this consists of many disjoint swaps (and possibly some fixed points).



                In group theory it is a permutation of cycle type corresponding to the partition of $n$ into $2$'s and $1$'s. For example $9=2+2+2+ 1^6 $ (that is 1 repeated six times).






                share|cite|improve this answer









                $endgroup$















                  2












                  2








                  2





                  $begingroup$

                  As you have noted condition for a permutation matrix $E$ to be symmetric
                  is that $E^-1=E$, and this condition can be expressed as $E^2=I$.



                  Interpreting the last condition as repeating the permutation is identity. So this represents a permutation that is its own inverse. That is if $E$ sends a basis vector $v$ to $W$ $E^2=I$ implies $Ew=v$. (possible that $v=w$)



                  So this corresponds to a permutation where an element is fixed, or if it sends $x$ to $y$ then it has to send $y$ to $x$. Thus this consists of many disjoint swaps (and possibly some fixed points).



                  In group theory it is a permutation of cycle type corresponding to the partition of $n$ into $2$'s and $1$'s. For example $9=2+2+2+ 1^6 $ (that is 1 repeated six times).






                  share|cite|improve this answer









                  $endgroup$



                  As you have noted condition for a permutation matrix $E$ to be symmetric
                  is that $E^-1=E$, and this condition can be expressed as $E^2=I$.



                  Interpreting the last condition as repeating the permutation is identity. So this represents a permutation that is its own inverse. That is if $E$ sends a basis vector $v$ to $W$ $E^2=I$ implies $Ew=v$. (possible that $v=w$)



                  So this corresponds to a permutation where an element is fixed, or if it sends $x$ to $y$ then it has to send $y$ to $x$. Thus this consists of many disjoint swaps (and possibly some fixed points).



                  In group theory it is a permutation of cycle type corresponding to the partition of $n$ into $2$'s and $1$'s. For example $9=2+2+2+ 1^6 $ (that is 1 repeated six times).







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 2 hours ago









                  P VanchinathanP Vanchinathan

                  15.7k12236




                  15.7k12236



























                      draft saved

                      draft discarded
















































                      Thanks for contributing an answer to Mathematics Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid


                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.

                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3194162%2fconditions-when-a-permutation-matrix-is-symmetric%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

                      Францішак Багушэвіч Змест Сям'я | Біяграфія | Творчасць | Мова Багушэвіча | Ацэнкі дзейнасці | Цікавыя факты | Спадчына | Выбраная бібліяграфія | Ушанаванне памяці | У філатэліі | Зноскі | Літаратура | Спасылкі | НавігацыяЛяхоўскі У. Рупіўся дзеля Бога і людзей: Жыццёвы шлях Лявона Вітан-Дубейкаўскага // Вольскі і Памідораў з песняй пра немца Адвакат, паэт, народны заступнік Ашмянскі веснікВ Минске появится площадь Богушевича и улица Сырокомли, Белорусская деловая газета, 19 июля 2001 г.Айцец беларускай нацыянальнай ідэі паўстаў у бронзе Сяргей Аляксандравіч Адашкевіч (1918, Мінск). 80-я гады. Бюст «Францішак Багушэвіч».Яўген Мікалаевіч Ціхановіч. «Партрэт Францішка Багушэвіча»Мікола Мікалаевіч Купава. «Партрэт зачынальніка новай беларускай літаратуры Францішка Багушэвіча»Уладзімір Іванавіч Мелехаў. На помніку «Змагарам за родную мову» Барэльеф «Францішак Багушэвіч»Памяць пра Багушэвіча на Віленшчыне Страчаная сталіца. Беларускія шыльды на вуліцах Вільні«Krynica». Ideologia i przywódcy białoruskiego katolicyzmuФранцішак БагушэвічТворы на knihi.comТворы Францішка Багушэвіча на bellib.byСодаль Уладзімір. Францішак Багушэвіч на Лідчыне;Луцкевіч Антон. Жыцьцё і творчасьць Фр. Багушэвіча ў успамінах ягоных сучасьнікаў // Запісы Беларускага Навуковага таварыства. Вільня, 1938. Сшытак 1. С. 16-34.Большая российская1188761710000 0000 5537 633Xn9209310021619551927869394п

                      Беларусь Змест Назва Гісторыя Геаграфія Сімволіка Дзяржаўны лад Палітычныя партыі Міжнароднае становішча і знешняя палітыка Адміністрацыйны падзел Насельніцтва Эканоміка Культура і грамадства Сацыяльная сфера Узброеныя сілы Заўвагі Літаратура Спасылкі НавігацыяHGЯOiТоп-2011 г. (па версіі ej.by)Топ-2013 г. (па версіі ej.by)Топ-2016 г. (па версіі ej.by)Топ-2017 г. (па версіі ej.by)Нацыянальны статыстычны камітэт Рэспублікі БеларусьШчыльнасць насельніцтва па краінахhttp://naviny.by/rubrics/society/2011/09/16/ic_articles_116_175144/А. Калечыц, У. Ксяндзоў. Спробы засялення краю неандэртальскім чалавекам.І ў Менску былі мамантыА. Калечыц, У. Ксяндзоў. Старажытны каменны век (палеаліт). Першапачатковае засяленне тэрыторыіГ. Штыхаў. Балты і славяне ў VI—VIII стст.М. Клімаў. Полацкае княства ў IX—XI стст.Г. Штыхаў, В. Ляўко. Палітычная гісторыя Полацкай зямліГ. Штыхаў. Дзяржаўны лад у землях-княствахГ. Штыхаў. Дзяржаўны лад у землях-княствахБеларускія землі ў складзе Вялікага Княства ЛітоўскагаЛюблінская унія 1569 г."The Early Stages of Independence"Zapomniane prawdy25 гадоў таму было аб'яўлена, што Язэп Пілсудскі — беларус (фота)Наша вадаДакументы ЧАЭС: Забруджванне тэрыторыі Беларусі « ЧАЭС Зона адчужэнняСведения о политических партиях, зарегистрированных в Республике Беларусь // Министерство юстиции Республики БеларусьСтатыстычны бюлетэнь „Полаўзроставая структура насельніцтва Рэспублікі Беларусь на 1 студзеня 2012 года і сярэднегадовая колькасць насельніцтва за 2011 год“Индекс человеческого развития Беларуси — не было бы нижеБеларусь занимает первое место в СНГ по индексу развития с учетом гендерного факцёраНацыянальны статыстычны камітэт Рэспублікі БеларусьКанстытуцыя РБ. Артыкул 17Трансфармацыйныя задачы БеларусіВыйсце з крызісу — далейшае рэфармаванне Беларускі рубель — сусветны лідар па дэвальвацыяхПра змену коштаў у кастрычніку 2011 г.Бядней за беларусаў у СНД толькі таджыкіСярэдні заробак у верасні дасягнуў 2,26 мільёна рублёўЭканомікаГаласуем за ТОП-100 беларускай прозыСучасныя беларускія мастакіАрхитектура Беларуси BELARUS.BYА. Каханоўскі. Культура Беларусі ўсярэдзіне XVII—XVIII ст.Анталогія беларускай народнай песні, гуказапісы спеваўБеларускія Музычныя IнструментыБеларускі рок, які мы страцілі. Топ-10 гуртоў«Мясцовы час» — нязгаслая легенда беларускай рок-музыкіСЯРГЕЙ БУДКІН. МЫ НЯ ЗНАЕМ СВАЁЙ МУЗЫКІМ. А. Каладзінскі. НАРОДНЫ ТЭАТРМагнацкія культурныя цэнтрыПублічная дыскусія «Беларуская новая пьеса: без беларускай мовы ці беларуская?»Беларускія драматургі па-ранейшаму лепш ставяцца за мяжой, чым на радзіме«Працэс незалежнага кіно пайшоў, і дзяржаву турбуе яго непадкантрольнасць»Беларускія філосафы ў пошуках прасторыВсе идём в библиотекуАрхіваванаАб Нацыянальнай праграме даследавання і выкарыстання касмічнай прасторы ў мірных мэтах на 2008—2012 гадыУ космас — разам.У суседнім з Барысаўскім раёне пабудуюць Камандна-вымяральны пунктСвяты і абрады беларусаў«Мірныя бульбашы з малой краіны» — 5 непраўдзівых стэрэатыпаў пра БеларусьМ. Раманюк. Беларускае народнае адзеннеУ Беларусі скарачаецца колькасць злачынстваўЛукашэнка незадаволены мінскімі ўладамі Крадзяжы складаюць у Мінску каля 70% злачынстваў Узровень злачыннасці ў Мінскай вобласці — адзін з самых высокіх у краіне Генпракуратура аналізуе стан са злачыннасцю ў Беларусі па каэфіцыенце злачыннасці У Беларусі стабілізавалася крымінагеннае становішча, лічыць генпракурорЗамежнікі сталі здзяйсняць у Беларусі больш злачынстваўМУС Беларусі турбуе рост рэцыдыўнай злачыннасціЯ з ЖЭСа. Дазволіце вас абкрасці! Рэйтынг усіх службаў і падраздзяленняў ГУУС Мінгарвыканкама вырасАб КДБ РБГісторыя Аператыўна-аналітычнага цэнтра РБГісторыя ДКФРТаможняagentura.ruБеларусьBelarus.by — Афіцыйны сайт Рэспублікі БеларусьСайт урада БеларусіRadzima.org — Збор архітэктурных помнікаў, гісторыя Беларусі«Глобус Беларуси»Гербы и флаги БеларусиАсаблівасці каменнага веку на БеларусіА. Калечыц, У. Ксяндзоў. Старажытны каменны век (палеаліт). Першапачатковае засяленне тэрыторыіУ. Ксяндзоў. Сярэдні каменны век (мезаліт). Засяленне краю плямёнамі паляўнічых, рыбакоў і збіральнікаўА. Калечыц, М. Чарняўскі. Плямёны на тэрыторыі Беларусі ў новым каменным веку (неаліце)А. Калечыц, У. Ксяндзоў, М. Чарняўскі. Гаспадарчыя заняткі ў каменным векуЭ. Зайкоўскі. Духоўная культура ў каменным векуАсаблівасці бронзавага веку на БеларусіФарміраванне супольнасцей ранняга перыяду бронзавага векуФотографии БеларусиРоля беларускіх зямель ва ўтварэнні і ўмацаванні ВКЛВ. Фадзеева. З гісторыі развіцця беларускай народнай вышыўкіDMOZGran catalanaБольшая российскаяBritannica (анлайн)Швейцарскі гістарычны15325917611952699xDA123282154079143-90000 0001 2171 2080n9112870100577502ge128882171858027501086026362074122714179пппппп

                      ValueError: Expected n_neighbors <= n_samples, but n_samples = 1, n_neighbors = 6 (SMOTE) The 2019 Stack Overflow Developer Survey Results Are InCan SMOTE be applied over sequence of words (sentences)?ValueError when doing validation with random forestsSMOTE and multi class oversamplingLogic behind SMOTE-NC?ValueError: Error when checking target: expected dense_1 to have shape (7,) but got array with shape (1,)SmoteBoost: Should SMOTE be ran individually for each iteration/tree in the boosting?solving multi-class imbalance classification using smote and OSSUsing SMOTE for Synthetic Data generation to improve performance on unbalanced dataproblem of entry format for a simple model in KerasSVM SMOTE fit_resample() function runs forever with no result