What would you call a finite collection of unordered objects that are not necessarily distinct?ENS is an abbreviation of?…Comparison of two sets of 4-tuples using combinatoricsComparison of two collections of 4-tuples using combinatorics - more complicated versionPermutation of numbers from multiple sets [May contain duplicate numbers among other sets], resulting in Non-Duplicate SetPredicting the number of unique elements in the Cartesian product of a set with itselfIs there symbol to denote a combination and permutation?Name for a set in which some of the elements are also contained in other set elements?What would you call this?Is there a name for the set of “unique” combinations of the powerset of $2^n$ modulo permutation?Denoting sets (permutations,tuples?),

Does anycast addressing add additional latency in any way?

Why does the numerical solution of an ODE move away from an unstable equilibrium?

Why won't the ground take my seed?

Zombie diet, why humans?

Transitive action of a discrete group on a compact space

If a high rpm motor is run at lower rpm, will it produce more torque?

How fast can a ship with rotating habitats be accelerated?

Why is the divergence of this series apparently not predicted by the Monotonic Sequence Theorem?

Row to remove the dotted white border around focused button text

Why is the Turkish president's surname spelt in Russian as Эрдоган, with г?

How to write or read powers (math) by words?

How should I behave to assure my friends that I am not after their money?

How would a order of Monks that renounce their names communicate effectively?

Can I travel from Germany to England alone as an unaccompanied minor?

Bash echo $-1 prints hb1. Why?

Are there any vegetarian astronauts?

Why does this fireplace work?

Should I hide continue button until tasks are completed?

Reverse of diffraction

When is it ok to add filler to a story?

Set vertical spacing between two particular items

How well known and how commonly used was Huffman coding in 1979?

What shortcut does ⌦ symbol in Camunda macOS app indicate and how to invoke it?

Was touching your nose a greeting in second millenium Mesopotamia?



What would you call a finite collection of unordered objects that are not necessarily distinct?


ENS is an abbreviation of?…Comparison of two sets of 4-tuples using combinatoricsComparison of two collections of 4-tuples using combinatorics - more complicated versionPermutation of numbers from multiple sets [May contain duplicate numbers among other sets], resulting in Non-Duplicate SetPredicting the number of unique elements in the Cartesian product of a set with itselfIs there symbol to denote a combination and permutation?Name for a set in which some of the elements are also contained in other set elements?What would you call this?Is there a name for the set of “unique” combinations of the powerset of $2^n$ modulo permutation?Denoting sets (permutations,tuples?),






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








10












$begingroup$


I Just want to know the name for this if there is one because I don't think it satisifies any of the formal definitions for sets, n-tuples, sequences, combinations, permutations, or any other enumerated objects I can think of.



For convenience, I will henceforth use the term $mathbf set^*$ with an asterisk to refer to what I described in the title.



As a quick example, let $mathbfA$ and $mathbfB $ be $mathbf set^*$'s where $$mathbfA = 3,3,4,11,4,8$$
$$mathbfB = 4,3,4,8,11,3$$



Then $mathbfA $ and $mathbf B $ are equal.










share|cite|improve this question









$endgroup$


















    10












    $begingroup$


    I Just want to know the name for this if there is one because I don't think it satisifies any of the formal definitions for sets, n-tuples, sequences, combinations, permutations, or any other enumerated objects I can think of.



    For convenience, I will henceforth use the term $mathbf set^*$ with an asterisk to refer to what I described in the title.



    As a quick example, let $mathbfA$ and $mathbfB $ be $mathbf set^*$'s where $$mathbfA = 3,3,4,11,4,8$$
    $$mathbfB = 4,3,4,8,11,3$$



    Then $mathbfA $ and $mathbf B $ are equal.










    share|cite|improve this question









    $endgroup$














      10












      10








      10


      2



      $begingroup$


      I Just want to know the name for this if there is one because I don't think it satisifies any of the formal definitions for sets, n-tuples, sequences, combinations, permutations, or any other enumerated objects I can think of.



      For convenience, I will henceforth use the term $mathbf set^*$ with an asterisk to refer to what I described in the title.



      As a quick example, let $mathbfA$ and $mathbfB $ be $mathbf set^*$'s where $$mathbfA = 3,3,4,11,4,8$$
      $$mathbfB = 4,3,4,8,11,3$$



      Then $mathbfA $ and $mathbf B $ are equal.










      share|cite|improve this question









      $endgroup$




      I Just want to know the name for this if there is one because I don't think it satisifies any of the formal definitions for sets, n-tuples, sequences, combinations, permutations, or any other enumerated objects I can think of.



      For convenience, I will henceforth use the term $mathbf set^*$ with an asterisk to refer to what I described in the title.



      As a quick example, let $mathbfA$ and $mathbfB $ be $mathbf set^*$'s where $$mathbfA = 3,3,4,11,4,8$$
      $$mathbfB = 4,3,4,8,11,3$$



      Then $mathbfA $ and $mathbf B $ are equal.







      combinatorics elementary-set-theory notation permutations definition






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 25 at 11:20









      Nicholas CousarNicholas Cousar

      3841 gold badge3 silver badges13 bronze badges




      3841 gold badge3 silver badges13 bronze badges




















          4 Answers
          4






          active

          oldest

          votes


















          36












          $begingroup$

          If you're looking for something like a set which may have repeated elements, standard terms are multiset or bag. See multiset on wikipedia.






          share|cite|improve this answer









          $endgroup$




















            7












            $begingroup$

            The common term is multiset. For a formal definition, you can for instance define the set of multisets of size $n$ of a given set $A$ as $A^n/mathfrakS_n$ where $mathfrakS_n$ acts by permutation of the factors; or if you don't want to be bothered by size you can define it as a map $f: Ato mathbbN$ where $f(a)$ is supposed to represent the number of times $a$ appears in the multiset.



            These are two interesting models for different situations, and there are probably more.






            share|cite|improve this answer









            $endgroup$




















              4












              $begingroup$

              In this context you can identify what you call a $mathbf set^*$ with a function that has a finite domain and has $mathbb N=1,2,3cdots$ as codomain.



              $A$ and $B$ in your question can both be identified with function: $$langle3,2rangle,langle4,2rangle,langle8,1rangle,langle11,1rangle$$Domain of the function in this case is the set $3,4,8,11$.






              share|cite|improve this answer









              $endgroup$




















                1












                $begingroup$

                If two objects can be distinguished by the number of times an element appears in them, that is called "multiplicity". So the more mathy version of "finite collection of unordered objects that are not necessarily distinct" would be "unordered finite collection with multiplicity" or "finite collection with multiplicity but not order".



                The single-word term for unordered collections with multiplicity is "multi-set", but I don't think there's any single-word term for finite multi-sets. Googling "math collection multiplicity no order" returns http://mathworld.wolfram.com/Set.html and https://en.wikipedia.org/wiki/Multiplicity_(mathematics) , both of which mention multisets.



                Another term that is used in the context of eigenvalues is "spectrum": the multiplicity of the eigenvalues is important, but there is no canonical order (other than the normal order of the real numbers, but that doesn't apply if they are complex). When you diagonalize or take the Jordan canonical form of a matrix, it matters how many times each eigenvalue appears, but putting the eigenvalues in a different order results in the same matrix, up to similarity.






                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%2f3161647%2fwhat-would-you-call-a-finite-collection-of-unordered-objects-that-are-not-necess%23new-answer', 'question_page');

                  );

                  Post as a guest















                  Required, but never shown

























                  4 Answers
                  4






                  active

                  oldest

                  votes








                  4 Answers
                  4






                  active

                  oldest

                  votes









                  active

                  oldest

                  votes






                  active

                  oldest

                  votes









                  36












                  $begingroup$

                  If you're looking for something like a set which may have repeated elements, standard terms are multiset or bag. See multiset on wikipedia.






                  share|cite|improve this answer









                  $endgroup$

















                    36












                    $begingroup$

                    If you're looking for something like a set which may have repeated elements, standard terms are multiset or bag. See multiset on wikipedia.






                    share|cite|improve this answer









                    $endgroup$















                      36












                      36








                      36





                      $begingroup$

                      If you're looking for something like a set which may have repeated elements, standard terms are multiset or bag. See multiset on wikipedia.






                      share|cite|improve this answer









                      $endgroup$



                      If you're looking for something like a set which may have repeated elements, standard terms are multiset or bag. See multiset on wikipedia.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Mar 25 at 11:24









                      Especially LimeEspecially Lime

                      23.3k2 gold badges31 silver badges59 bronze badges




                      23.3k2 gold badges31 silver badges59 bronze badges























                          7












                          $begingroup$

                          The common term is multiset. For a formal definition, you can for instance define the set of multisets of size $n$ of a given set $A$ as $A^n/mathfrakS_n$ where $mathfrakS_n$ acts by permutation of the factors; or if you don't want to be bothered by size you can define it as a map $f: Ato mathbbN$ where $f(a)$ is supposed to represent the number of times $a$ appears in the multiset.



                          These are two interesting models for different situations, and there are probably more.






                          share|cite|improve this answer









                          $endgroup$

















                            7












                            $begingroup$

                            The common term is multiset. For a formal definition, you can for instance define the set of multisets of size $n$ of a given set $A$ as $A^n/mathfrakS_n$ where $mathfrakS_n$ acts by permutation of the factors; or if you don't want to be bothered by size you can define it as a map $f: Ato mathbbN$ where $f(a)$ is supposed to represent the number of times $a$ appears in the multiset.



                            These are two interesting models for different situations, and there are probably more.






                            share|cite|improve this answer









                            $endgroup$















                              7












                              7








                              7





                              $begingroup$

                              The common term is multiset. For a formal definition, you can for instance define the set of multisets of size $n$ of a given set $A$ as $A^n/mathfrakS_n$ where $mathfrakS_n$ acts by permutation of the factors; or if you don't want to be bothered by size you can define it as a map $f: Ato mathbbN$ where $f(a)$ is supposed to represent the number of times $a$ appears in the multiset.



                              These are two interesting models for different situations, and there are probably more.






                              share|cite|improve this answer









                              $endgroup$



                              The common term is multiset. For a formal definition, you can for instance define the set of multisets of size $n$ of a given set $A$ as $A^n/mathfrakS_n$ where $mathfrakS_n$ acts by permutation of the factors; or if you don't want to be bothered by size you can define it as a map $f: Ato mathbbN$ where $f(a)$ is supposed to represent the number of times $a$ appears in the multiset.



                              These are two interesting models for different situations, and there are probably more.







                              share|cite|improve this answer












                              share|cite|improve this answer



                              share|cite|improve this answer










                              answered Mar 25 at 11:27









                              MaxMax

                              19.6k1 gold badge12 silver badges46 bronze badges




                              19.6k1 gold badge12 silver badges46 bronze badges





















                                  4












                                  $begingroup$

                                  In this context you can identify what you call a $mathbf set^*$ with a function that has a finite domain and has $mathbb N=1,2,3cdots$ as codomain.



                                  $A$ and $B$ in your question can both be identified with function: $$langle3,2rangle,langle4,2rangle,langle8,1rangle,langle11,1rangle$$Domain of the function in this case is the set $3,4,8,11$.






                                  share|cite|improve this answer









                                  $endgroup$

















                                    4












                                    $begingroup$

                                    In this context you can identify what you call a $mathbf set^*$ with a function that has a finite domain and has $mathbb N=1,2,3cdots$ as codomain.



                                    $A$ and $B$ in your question can both be identified with function: $$langle3,2rangle,langle4,2rangle,langle8,1rangle,langle11,1rangle$$Domain of the function in this case is the set $3,4,8,11$.






                                    share|cite|improve this answer









                                    $endgroup$















                                      4












                                      4








                                      4





                                      $begingroup$

                                      In this context you can identify what you call a $mathbf set^*$ with a function that has a finite domain and has $mathbb N=1,2,3cdots$ as codomain.



                                      $A$ and $B$ in your question can both be identified with function: $$langle3,2rangle,langle4,2rangle,langle8,1rangle,langle11,1rangle$$Domain of the function in this case is the set $3,4,8,11$.






                                      share|cite|improve this answer









                                      $endgroup$



                                      In this context you can identify what you call a $mathbf set^*$ with a function that has a finite domain and has $mathbb N=1,2,3cdots$ as codomain.



                                      $A$ and $B$ in your question can both be identified with function: $$langle3,2rangle,langle4,2rangle,langle8,1rangle,langle11,1rangle$$Domain of the function in this case is the set $3,4,8,11$.







                                      share|cite|improve this answer












                                      share|cite|improve this answer



                                      share|cite|improve this answer










                                      answered Mar 25 at 11:33









                                      drhabdrhab

                                      108k5 gold badges49 silver badges138 bronze badges




                                      108k5 gold badges49 silver badges138 bronze badges





















                                          1












                                          $begingroup$

                                          If two objects can be distinguished by the number of times an element appears in them, that is called "multiplicity". So the more mathy version of "finite collection of unordered objects that are not necessarily distinct" would be "unordered finite collection with multiplicity" or "finite collection with multiplicity but not order".



                                          The single-word term for unordered collections with multiplicity is "multi-set", but I don't think there's any single-word term for finite multi-sets. Googling "math collection multiplicity no order" returns http://mathworld.wolfram.com/Set.html and https://en.wikipedia.org/wiki/Multiplicity_(mathematics) , both of which mention multisets.



                                          Another term that is used in the context of eigenvalues is "spectrum": the multiplicity of the eigenvalues is important, but there is no canonical order (other than the normal order of the real numbers, but that doesn't apply if they are complex). When you diagonalize or take the Jordan canonical form of a matrix, it matters how many times each eigenvalue appears, but putting the eigenvalues in a different order results in the same matrix, up to similarity.






                                          share|cite|improve this answer









                                          $endgroup$

















                                            1












                                            $begingroup$

                                            If two objects can be distinguished by the number of times an element appears in them, that is called "multiplicity". So the more mathy version of "finite collection of unordered objects that are not necessarily distinct" would be "unordered finite collection with multiplicity" or "finite collection with multiplicity but not order".



                                            The single-word term for unordered collections with multiplicity is "multi-set", but I don't think there's any single-word term for finite multi-sets. Googling "math collection multiplicity no order" returns http://mathworld.wolfram.com/Set.html and https://en.wikipedia.org/wiki/Multiplicity_(mathematics) , both of which mention multisets.



                                            Another term that is used in the context of eigenvalues is "spectrum": the multiplicity of the eigenvalues is important, but there is no canonical order (other than the normal order of the real numbers, but that doesn't apply if they are complex). When you diagonalize or take the Jordan canonical form of a matrix, it matters how many times each eigenvalue appears, but putting the eigenvalues in a different order results in the same matrix, up to similarity.






                                            share|cite|improve this answer









                                            $endgroup$















                                              1












                                              1








                                              1





                                              $begingroup$

                                              If two objects can be distinguished by the number of times an element appears in them, that is called "multiplicity". So the more mathy version of "finite collection of unordered objects that are not necessarily distinct" would be "unordered finite collection with multiplicity" or "finite collection with multiplicity but not order".



                                              The single-word term for unordered collections with multiplicity is "multi-set", but I don't think there's any single-word term for finite multi-sets. Googling "math collection multiplicity no order" returns http://mathworld.wolfram.com/Set.html and https://en.wikipedia.org/wiki/Multiplicity_(mathematics) , both of which mention multisets.



                                              Another term that is used in the context of eigenvalues is "spectrum": the multiplicity of the eigenvalues is important, but there is no canonical order (other than the normal order of the real numbers, but that doesn't apply if they are complex). When you diagonalize or take the Jordan canonical form of a matrix, it matters how many times each eigenvalue appears, but putting the eigenvalues in a different order results in the same matrix, up to similarity.






                                              share|cite|improve this answer









                                              $endgroup$



                                              If two objects can be distinguished by the number of times an element appears in them, that is called "multiplicity". So the more mathy version of "finite collection of unordered objects that are not necessarily distinct" would be "unordered finite collection with multiplicity" or "finite collection with multiplicity but not order".



                                              The single-word term for unordered collections with multiplicity is "multi-set", but I don't think there's any single-word term for finite multi-sets. Googling "math collection multiplicity no order" returns http://mathworld.wolfram.com/Set.html and https://en.wikipedia.org/wiki/Multiplicity_(mathematics) , both of which mention multisets.



                                              Another term that is used in the context of eigenvalues is "spectrum": the multiplicity of the eigenvalues is important, but there is no canonical order (other than the normal order of the real numbers, but that doesn't apply if they are complex). When you diagonalize or take the Jordan canonical form of a matrix, it matters how many times each eigenvalue appears, but putting the eigenvalues in a different order results in the same matrix, up to similarity.







                                              share|cite|improve this answer












                                              share|cite|improve this answer



                                              share|cite|improve this answer










                                              answered Mar 25 at 15:50









                                              AcccumulationAcccumulation

                                              7,7742 gold badges6 silver badges20 bronze badges




                                              7,7742 gold badges6 silver badges20 bronze badges



























                                                  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%2f3161647%2fwhat-would-you-call-a-finite-collection-of-unordered-objects-that-are-not-necess%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

                                                  Kamusi Yaliyomo Aina za kamusi | Muundo wa kamusi | Faida za kamusi | Dhima ya picha katika kamusi | Marejeo | Tazama pia | Viungo vya nje | UrambazajiKuhusu kamusiGo-SwahiliWiki-KamusiKamusi ya Kiswahili na Kiingerezakuihariri na kuongeza habari

                                                  SQL error code 1064 with creating Laravel foreign keysForeign key constraints: When to use ON UPDATE and ON DELETEDropping column with foreign key Laravel error: General error: 1025 Error on renameLaravel SQL Can't create tableLaravel Migration foreign key errorLaravel php artisan migrate:refresh giving a syntax errorSQLSTATE[42S01]: Base table or view already exists or Base table or view already exists: 1050 Tableerror in migrating laravel file to xampp serverSyntax error or access violation: 1064:syntax to use near 'unsigned not null, modelName varchar(191) not null, title varchar(191) not nLaravel cannot create new table field in mysqlLaravel 5.7:Last migration creates table but is not registered in the migration table

                                                  은진 송씨 목차 역사 본관 분파 인물 조선 왕실과의 인척 관계 집성촌 항렬자 인구 같이 보기 각주 둘러보기 메뉴은진 송씨세종실록 149권, 지리지 충청도 공주목 은진현