What would you call a finite collection of unordered objects that are not necessarily distinct? Unicorn Meta Zoo #1: Why another podcast? Announcing the arrival of Valued Associate #679: Cesar ManaraDefinition of correspondenceName for variations of elements from several setsComparison 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?

How did Elite on the NES work?

Is it accepted to use working hours to read general interest books?

What is the definining line between a helicopter and a drone a person can ride in?

How can I wire a 9-position switch so that each position turns on one more LED than the one before?

Is it OK if I do not take the receipt in Germany?

Bright yellow or light yellow?

Processing ADC conversion result: DMA vs Processor Registers

Why is arima in R one time step off?

Is Bran literally the world's memory?

How would you suggest I follow up with coworkers about our deadline that's today?

TV series episode where humans nuke aliens before decrypting their message that states they come in peace

What helicopter has the most rotor blades?

How long can a nation maintain a technological edge over the rest of the world?

My admission is revoked after accepting the admission offer

Does using the Inspiration rules for character defects encourage My Guy Syndrome?

Is there a verb for listening stealthily?

Was Objective-C really a hindrance to Apple software development?

Arriving in Atlanta after US Preclearance in Dublin. Will I go through TSA security in Atlanta to transfer to a connecting flight?

"Working on a knee"

/bin/ls sorts differently than just ls

Could a cockatrice have parasitic embryos?

What happened to Viserion in Season 7?

What were wait-states, and why was it only an issue for PCs?

How would it unbalance gameplay to rule that Weapon Master allows for picking a fighting style?



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



Unicorn Meta Zoo #1: Why another podcast?
Announcing the arrival of Valued Associate #679: Cesar ManaraDefinition of correspondenceName for variations of elements from several setsComparison 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?










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

      3791313




      3791313




















          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

                      22.9k23059




                      22.9k23059





















                          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

                              16.8k11144




                              16.8k11144





















                                  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

                                      104k545136




                                      104k545136





















                                          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,4342619




                                              7,4342619



























                                                  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

                                                  He _____ here since 1970 . Answer needed [closed]What does “since he was so high” mean?Meaning of “catch birds for”?How do I ensure “since” takes the meaning I want?“Who cares here” meaningWhat does “right round toward” mean?the time tense (had now been detected)What does the phrase “ring around the roses” mean here?Correct usage of “visited upon”Meaning of “foiled rail sabotage bid”It was the third time I had gone to Rome or It is the third time I had been to Rome

                                                  Bunad

                                                  Færeyskur hestur Heimild | Tengill | Tilvísanir | LeiðsagnarvalRossið - síða um færeyska hrossið á færeyskuGott ár hjá færeyska hestinum