Sort with assumptionsvariable sized lists and using lists as variablesRetaining and reusing a one-to-one mapping from a sortSorting a matrix alphanumericallyRearranging a ListHow can I check if one expression implies another?Generating an Array of VectorsImporting, sorting and exporting listsDeleting Lonely Numbers From a ListApplying multiple functions to a single column in a tableFind positions in which list elements are equal

Why didn’t Eve recognize the little cockroach as a living organism?

Strange behavior in TikZ draw command

Why is "la Gestapo" feminine?

Comic-book: Kids find a dead female superhero in the woods

Toggle window scroll bar

How do I lift the insulation blower into the attic?

Weird lines in Microsoft Word

Put the phone down / Put down the phone

Error in master's thesis, I do not know what to do

Why is implicit conversion not ambiguous for non-primitive types?

Can a Knock spell open the door to Mordenkainen's Magnificent Mansion?

When is the exact date for EOL of Ubuntu 14.04 LTS?

Why do Radio Buttons not fill the entire outer circle?

python displays `n` instead of breaking a line

Why doesn't Gödel's incompleteness theorem apply to false statements?

I keep switching characters, how do I stop?

What is this high flying aircraft over Pennsylvania?

What 1968 Moog synthesizer was used in the Movie Apollo 11?

Do native speakers use "ultima" and "proxima" frequently in spoken English?

How do you justify more code being written by following clean code practices?

Can creatures abilities target that creature itself?

Why is indicated airspeed rather than ground speed used during the takeoff roll?

How are passwords stolen from companies if they only store hashes?

Why didn't Voldemort know what Grindelwald looked like?



Sort with assumptions


variable sized lists and using lists as variablesRetaining and reusing a one-to-one mapping from a sortSorting a matrix alphanumericallyRearranging a ListHow can I check if one expression implies another?Generating an Array of VectorsImporting, sorting and exporting listsDeleting Lonely Numbers From a ListApplying multiple functions to a single column in a tableFind positions in which list elements are equal













5












$begingroup$


I have a list which looks like this



list = 0, Subscript[x,7], -Subscript[x,3]-Subscript[x,9], -Subscript[x,9];



and all the $x_i$'s are positive semidefinite (i.e. nonnegative) real numbers. I would like to be able to sort this into



sortedlist = -Subscript[x,3]-Subscript[x,9], -Subscript[x,9], 0, Subscript[x,7]



How do I achieve this? I tried



Assuming[Subscript[x,3] > 0 && Subscript[x,7] > 0 && Subscript[x,9] > 0, Sort[list]]



But this obviously does not work. In general, I'd like to be able to impose more constraints on the $x_i's$ when they're being sorted.










share|improve this question









$endgroup$







  • 1




    $begingroup$
    An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
    $endgroup$
    – mikado
    43 mins ago















5












$begingroup$


I have a list which looks like this



list = 0, Subscript[x,7], -Subscript[x,3]-Subscript[x,9], -Subscript[x,9];



and all the $x_i$'s are positive semidefinite (i.e. nonnegative) real numbers. I would like to be able to sort this into



sortedlist = -Subscript[x,3]-Subscript[x,9], -Subscript[x,9], 0, Subscript[x,7]



How do I achieve this? I tried



Assuming[Subscript[x,3] > 0 && Subscript[x,7] > 0 && Subscript[x,9] > 0, Sort[list]]



But this obviously does not work. In general, I'd like to be able to impose more constraints on the $x_i's$ when they're being sorted.










share|improve this question









$endgroup$







  • 1




    $begingroup$
    An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
    $endgroup$
    – mikado
    43 mins ago













5












5








5


1



$begingroup$


I have a list which looks like this



list = 0, Subscript[x,7], -Subscript[x,3]-Subscript[x,9], -Subscript[x,9];



and all the $x_i$'s are positive semidefinite (i.e. nonnegative) real numbers. I would like to be able to sort this into



sortedlist = -Subscript[x,3]-Subscript[x,9], -Subscript[x,9], 0, Subscript[x,7]



How do I achieve this? I tried



Assuming[Subscript[x,3] > 0 && Subscript[x,7] > 0 && Subscript[x,9] > 0, Sort[list]]



But this obviously does not work. In general, I'd like to be able to impose more constraints on the $x_i's$ when they're being sorted.










share|improve this question









$endgroup$




I have a list which looks like this



list = 0, Subscript[x,7], -Subscript[x,3]-Subscript[x,9], -Subscript[x,9];



and all the $x_i$'s are positive semidefinite (i.e. nonnegative) real numbers. I would like to be able to sort this into



sortedlist = -Subscript[x,3]-Subscript[x,9], -Subscript[x,9], 0, Subscript[x,7]



How do I achieve this? I tried



Assuming[Subscript[x,3] > 0 && Subscript[x,7] > 0 && Subscript[x,9] > 0, Sort[list]]



But this obviously does not work. In general, I'd like to be able to impose more constraints on the $x_i's$ when they're being sorted.







list-manipulation symbolic array sorting






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 1 hour ago









leastactionleastaction

23229




23229







  • 1




    $begingroup$
    An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
    $endgroup$
    – mikado
    43 mins ago












  • 1




    $begingroup$
    An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
    $endgroup$
    – mikado
    43 mins ago







1




1




$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
43 mins ago




$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
43 mins ago










4 Answers
4






active

oldest

votes


















3












$begingroup$

Here is a possibility:



sortWithAssumptions[list_, assum_] := Module[order,
order[a_, b_] := Simplify[a < b, assum];
Sort[list, order]
]


For your example:



sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
] //TeXForm



$left-x_3-x_9,-x_9,0,x_7right$




Another example:



sortWithAssumptions[
0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
] //TeXForm



$left-x_3-x_9,-x_9,0,x_7,x_9right$







share|improve this answer









$endgroup$












  • $begingroup$
    Thank you, Carl!
    $endgroup$
    – leastaction
    37 mins ago


















4












$begingroup$

How about:



list[[Ordering[list /. _Subscript -> 1]]]



-Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]




So basically we sort it the way it would be sorted with all subscripts == 1.






share|improve this answer









$endgroup$












  • $begingroup$
    Thanks! Seems to work like a charm, but can you shed some light on why?
    $endgroup$
    – leastaction
    43 mins ago










  • $begingroup$
    @leastaction just take a look at list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].
    $endgroup$
    – Kuba
    42 mins ago










  • $begingroup$
    I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
    $endgroup$
    – leastaction
    39 mins ago






  • 1




    $begingroup$
    @leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
    $endgroup$
    – Kuba
    36 mins ago


















3












$begingroup$

Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]

(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)





share|improve this answer









$endgroup$




















    3












    $begingroup$

    In this case, we can use RankedMin and FullSimplify to get the answer you seek



    Assuming[
    Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
    FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
    (* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)


    This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.






    share|improve this answer











    $endgroup$












      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: "387"
      ;
      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: false,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: null,
      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
      ,
      onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );













      draft saved

      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f193600%2fsort-with-assumptions%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









      3












      $begingroup$

      Here is a possibility:



      sortWithAssumptions[list_, assum_] := Module[order,
      order[a_, b_] := Simplify[a < b, assum];
      Sort[list, order]
      ]


      For your example:



      sortWithAssumptions[
      0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
      Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
      ] //TeXForm



      $left-x_3-x_9,-x_9,0,x_7right$




      Another example:



      sortWithAssumptions[
      0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
      Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
      ] //TeXForm



      $left-x_3-x_9,-x_9,0,x_7,x_9right$







      share|improve this answer









      $endgroup$












      • $begingroup$
        Thank you, Carl!
        $endgroup$
        – leastaction
        37 mins ago















      3












      $begingroup$

      Here is a possibility:



      sortWithAssumptions[list_, assum_] := Module[order,
      order[a_, b_] := Simplify[a < b, assum];
      Sort[list, order]
      ]


      For your example:



      sortWithAssumptions[
      0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
      Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
      ] //TeXForm



      $left-x_3-x_9,-x_9,0,x_7right$




      Another example:



      sortWithAssumptions[
      0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
      Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
      ] //TeXForm



      $left-x_3-x_9,-x_9,0,x_7,x_9right$







      share|improve this answer









      $endgroup$












      • $begingroup$
        Thank you, Carl!
        $endgroup$
        – leastaction
        37 mins ago













      3












      3








      3





      $begingroup$

      Here is a possibility:



      sortWithAssumptions[list_, assum_] := Module[order,
      order[a_, b_] := Simplify[a < b, assum];
      Sort[list, order]
      ]


      For your example:



      sortWithAssumptions[
      0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
      Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
      ] //TeXForm



      $left-x_3-x_9,-x_9,0,x_7right$




      Another example:



      sortWithAssumptions[
      0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
      Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
      ] //TeXForm



      $left-x_3-x_9,-x_9,0,x_7,x_9right$







      share|improve this answer









      $endgroup$



      Here is a possibility:



      sortWithAssumptions[list_, assum_] := Module[order,
      order[a_, b_] := Simplify[a < b, assum];
      Sort[list, order]
      ]


      For your example:



      sortWithAssumptions[
      0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9],
      Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0
      ] //TeXForm



      $left-x_3-x_9,-x_9,0,x_7right$




      Another example:



      sortWithAssumptions[
      0,Subscript[x,7],-Subscript[x,3]-Subscript[x,9],-Subscript[x,9], Subscript[x,9],
      Subscript[x,3]>0&&Subscript[x,7]>0&&Subscript[x,9]>0&&Subscript[x,7]<Subscript[x,9]
      ] //TeXForm



      $left-x_3-x_9,-x_9,0,x_7,x_9right$








      share|improve this answer












      share|improve this answer



      share|improve this answer










      answered 39 mins ago









      Carl WollCarl Woll

      70.8k394184




      70.8k394184











      • $begingroup$
        Thank you, Carl!
        $endgroup$
        – leastaction
        37 mins ago
















      • $begingroup$
        Thank you, Carl!
        $endgroup$
        – leastaction
        37 mins ago















      $begingroup$
      Thank you, Carl!
      $endgroup$
      – leastaction
      37 mins ago




      $begingroup$
      Thank you, Carl!
      $endgroup$
      – leastaction
      37 mins ago











      4












      $begingroup$

      How about:



      list[[Ordering[list /. _Subscript -> 1]]]



      -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]




      So basically we sort it the way it would be sorted with all subscripts == 1.






      share|improve this answer









      $endgroup$












      • $begingroup$
        Thanks! Seems to work like a charm, but can you shed some light on why?
        $endgroup$
        – leastaction
        43 mins ago










      • $begingroup$
        @leastaction just take a look at list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].
        $endgroup$
        – Kuba
        42 mins ago










      • $begingroup$
        I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
        $endgroup$
        – leastaction
        39 mins ago






      • 1




        $begingroup$
        @leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
        $endgroup$
        – Kuba
        36 mins ago















      4












      $begingroup$

      How about:



      list[[Ordering[list /. _Subscript -> 1]]]



      -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]




      So basically we sort it the way it would be sorted with all subscripts == 1.






      share|improve this answer









      $endgroup$












      • $begingroup$
        Thanks! Seems to work like a charm, but can you shed some light on why?
        $endgroup$
        – leastaction
        43 mins ago










      • $begingroup$
        @leastaction just take a look at list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].
        $endgroup$
        – Kuba
        42 mins ago










      • $begingroup$
        I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
        $endgroup$
        – leastaction
        39 mins ago






      • 1




        $begingroup$
        @leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
        $endgroup$
        – Kuba
        36 mins ago













      4












      4








      4





      $begingroup$

      How about:



      list[[Ordering[list /. _Subscript -> 1]]]



      -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]




      So basically we sort it the way it would be sorted with all subscripts == 1.






      share|improve this answer









      $endgroup$



      How about:



      list[[Ordering[list /. _Subscript -> 1]]]



      -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7]




      So basically we sort it the way it would be sorted with all subscripts == 1.







      share|improve this answer












      share|improve this answer



      share|improve this answer










      answered 47 mins ago









      KubaKuba

      106k12209530




      106k12209530











      • $begingroup$
        Thanks! Seems to work like a charm, but can you shed some light on why?
        $endgroup$
        – leastaction
        43 mins ago










      • $begingroup$
        @leastaction just take a look at list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].
        $endgroup$
        – Kuba
        42 mins ago










      • $begingroup$
        I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
        $endgroup$
        – leastaction
        39 mins ago






      • 1




        $begingroup$
        @leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
        $endgroup$
        – Kuba
        36 mins ago
















      • $begingroup$
        Thanks! Seems to work like a charm, but can you shed some light on why?
        $endgroup$
        – leastaction
        43 mins ago










      • $begingroup$
        @leastaction just take a look at list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].
        $endgroup$
        – Kuba
        42 mins ago










      • $begingroup$
        I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
        $endgroup$
        – leastaction
        39 mins ago






      • 1




        $begingroup$
        @leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
        $endgroup$
        – Kuba
        36 mins ago















      $begingroup$
      Thanks! Seems to work like a charm, but can you shed some light on why?
      $endgroup$
      – leastaction
      43 mins ago




      $begingroup$
      Thanks! Seems to work like a charm, but can you shed some light on why?
      $endgroup$
      – leastaction
      43 mins ago












      $begingroup$
      @leastaction just take a look at list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].
      $endgroup$
      – Kuba
      42 mins ago




      $begingroup$
      @leastaction just take a look at list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].
      $endgroup$
      – Kuba
      42 mins ago












      $begingroup$
      I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
      $endgroup$
      – leastaction
      39 mins ago




      $begingroup$
      I see, so you basically assigned the value $x_i = 1$ to each $x_i$. It works in this case, but generically, $x_i$'s may be different.
      $endgroup$
      – leastaction
      39 mins ago




      1




      1




      $begingroup$
      @leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
      $endgroup$
      – Kuba
      36 mins ago




      $begingroup$
      @leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
      $endgroup$
      – Kuba
      36 mins ago











      3












      $begingroup$

      Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]

      (* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)





      share|improve this answer









      $endgroup$

















        3












        $begingroup$

        Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]

        (* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)





        share|improve this answer









        $endgroup$















          3












          3








          3





          $begingroup$

          Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]

          (* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)





          share|improve this answer









          $endgroup$



          Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]

          (* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)






          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 39 mins ago









          MarcoBMarcoB

          37.6k556113




          37.6k556113





















              3












              $begingroup$

              In this case, we can use RankedMin and FullSimplify to get the answer you seek



              Assuming[
              Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
              FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
              (* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)


              This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.






              share|improve this answer











              $endgroup$

















                3












                $begingroup$

                In this case, we can use RankedMin and FullSimplify to get the answer you seek



                Assuming[
                Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
                FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
                (* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)


                This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.






                share|improve this answer











                $endgroup$















                  3












                  3








                  3





                  $begingroup$

                  In this case, we can use RankedMin and FullSimplify to get the answer you seek



                  Assuming[
                  Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
                  FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
                  (* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)


                  This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.






                  share|improve this answer











                  $endgroup$



                  In this case, we can use RankedMin and FullSimplify to get the answer you seek



                  Assuming[
                  Subscript[x, 3] > 0 && Subscript[x, 7] > 0 && Subscript[x, 9] > 0,
                  FullSimplify[Table[RankedMin[list, i], i, 1, Length[list]]]]
                  (* -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)


                  This has the advantage of not returning a (potentially) wrong answer if the sort order is uncertain.







                  share|improve this answer














                  share|improve this answer



                  share|improve this answer








                  edited 31 mins ago

























                  answered 38 mins ago









                  mikadomikado

                  6,7071929




                  6,7071929



























                      draft saved

                      draft discarded
















































                      Thanks for contributing an answer to Mathematica 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%2fmathematica.stackexchange.com%2fquestions%2f193600%2fsort-with-assumptions%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

                      Oświęcim Innehåll Historia | Källor | Externa länkar | Navigeringsmeny50°2′18″N 19°13′17″Ö / 50.03833°N 19.22139°Ö / 50.03833; 19.2213950°2′18″N 19°13′17″Ö / 50.03833°N 19.22139°Ö / 50.03833; 19.221393089658Nordisk familjebok, AuschwitzInsidan tro och existensJewish Community i OświęcimAuschwitz Jewish Center: MuseumAuschwitz Jewish Center

                      Valle di Casies Indice Geografia fisica | Origini del nome | Storia | Società | Amministrazione | Sport | Note | Bibliografia | Voci correlate | Altri progetti | Collegamenti esterni | Menu di navigazione46°46′N 12°11′E / 46.766667°N 12.183333°E46.766667; 12.183333 (Valle di Casies)46°46′N 12°11′E / 46.766667°N 12.183333°E46.766667; 12.183333 (Valle di Casies)Sito istituzionaleAstat Censimento della popolazione 2011 - Determinazione della consistenza dei tre gruppi linguistici della Provincia Autonoma di Bolzano-Alto Adige - giugno 2012Numeri e fattiValle di CasiesDato IstatTabella dei gradi/giorno dei Comuni italiani raggruppati per Regione e Provincia26 agosto 1993, n. 412Heraldry of the World: GsiesStatistiche I.StatValCasies.comWikimedia CommonsWikimedia CommonsValle di CasiesSito ufficialeValle di CasiesMM14870458910042978-6

                      Typsetting diagram chases (with TikZ?) Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)How to define the default vertical distance between nodes?Draw edge on arcNumerical conditional within tikz keys?TikZ: Drawing an arc from an intersection to an intersectionDrawing rectilinear curves in Tikz, aka an Etch-a-Sketch drawingLine up nested tikz enviroments or how to get rid of themHow to place nodes in an absolute coordinate system in tikzCommutative diagram with curve connecting between nodesTikz with standalone: pinning tikz coordinates to page cmDrawing a Decision Diagram with Tikz and layout manager