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
Sort with assumptions
How to evaluate the research level of a paper before any publication?
Are there any specific minhagim to celebrate Purim as a family?
How are passwords stolen from companies if they only store hashes?
Derivative of an interpolated function
Boss fired me and is begging for me to come back - how much of a raise is reasonable?
Highest stage count that are used one right after the other?
Do people actually use the word "kaputt" in conversation?
How can I, as DM, avoid the Conga Line of Death occurring when implementing some form of flanking rule?
Started in 1987 vs. Starting in 1987
Why is "la Gestapo" feminine?
What properties make a magic weapon befit a Rogue more than a DEX-based Fighter?
Why didn’t Eve recognize the little cockroach as a living organism?
Strange behavior in TikZ draw command
Did I make a mistake by ccing email to boss to others?
What should be the ideal length of sentences in a blog post for ease of reading?
How do you justify more code being written by following clean code practices?
Is there a distance limit for minecart tracks?
What's the meaning of "what it means for something to be something"?
Taking the numerator and the denominator
categorizing a variable turns it from insignificant to significant
Why does the frost depth increase when the surface temperature warms up?
What is it called when someone votes for an option that's not their first choice?
Not hide and seek
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
$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.
list-manipulation symbolic array sorting
asked 58 mins ago
leastactionleastaction
23229
$endgroup$
add a comment |
$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.
list-manipulation symbolic array sorting
asked 58 mins ago
leastactionleastaction
23229
$endgroup$
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
37 mins ago
add a comment |
$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.
list-manipulation symbolic array sorting
asked 58 mins ago
leastactionleastaction
23229
$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
list-manipulation symbolic array sorting
asked 58 mins ago
leastactionleastaction
23229
asked 58 mins ago
leastactionleastaction
23229
asked 58 mins ago
leastactionleastaction
23229
asked 58 mins ago
leastactionleastaction
23229
asked 58 mins 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
37 mins ago
add a comment |
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
37 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
37 mins ago
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
37 mins ago
add a comment |
4 Answers
4
active
oldest
votes
$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$
answered 33 mins ago
Carl WollCarl Woll
70.8k394184
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
30 mins ago
add a comment |
$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.
answered 40 mins ago
Kuba♦Kuba
106k12209530
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
36 mins ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
36 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
32 mins ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
29 mins ago
add a comment |
$begingroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered 32 mins ago
MarcoBMarcoB
37.6k556113
$endgroup$
add a comment |
$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.
answered 32 mins ago
mikadomikado
6,7071929
$endgroup$
add a comment |
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$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$
answered 33 mins ago
Carl WollCarl Woll
70.8k394184
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
30 mins ago
add a comment |
$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$
answered 33 mins ago
Carl WollCarl Woll
70.8k394184
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
30 mins ago
add a comment |
$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$
answered 33 mins ago
Carl WollCarl Woll
70.8k394184
$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$
answered 33 mins ago
Carl WollCarl Woll
70.8k394184
answered 33 mins ago
Carl WollCarl Woll
70.8k394184
answered 33 mins ago
Carl WollCarl Woll
70.8k394184
answered 33 mins ago
Carl WollCarl Woll
70.8k394184
70.8k394184
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
30 mins ago
add a comment |
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
30 mins ago
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
30 mins ago
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
30 mins ago
add a comment |
$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.
answered 40 mins ago
Kuba♦Kuba
106k12209530
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
36 mins ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
36 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
32 mins ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
29 mins ago
add a comment |
$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.
answered 40 mins ago
Kuba♦Kuba
106k12209530
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
36 mins ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
36 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
32 mins ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
29 mins ago
add a comment |
$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.
answered 40 mins ago
Kuba♦Kuba
106k12209530
$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.
answered 40 mins ago
Kuba♦Kuba
106k12209530
answered 40 mins ago
Kuba♦Kuba
106k12209530
answered 40 mins ago
Kuba♦Kuba
106k12209530
answered 40 mins ago
Kuba♦Kuba
106k12209530
106k12209530
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
36 mins ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
36 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
32 mins ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
29 mins ago
add a comment |
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
36 mins ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1and atOrdering[list /. _Subscript -> 1].
$endgroup$
– Kuba♦
36 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
32 mins ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
29 mins ago
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
36 mins ago
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
36 mins ago
$begingroup$
@leastaction just take a look at
list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].$endgroup$
– Kuba♦
36 mins ago
$begingroup$
@leastaction just take a look at
list /. _Subscript -> 1 and at Ordering[list /. _Subscript -> 1].$endgroup$
– Kuba♦
36 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
32 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
32 mins ago
1
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
29 mins ago
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
29 mins ago
add a comment |
$begingroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered 32 mins ago
MarcoBMarcoB
37.6k556113
$endgroup$
add a comment |
$begingroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered 32 mins ago
MarcoBMarcoB
37.6k556113
$endgroup$
add a comment |
$begingroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered 32 mins ago
MarcoBMarcoB
37.6k556113
$endgroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered 32 mins ago
MarcoBMarcoB
37.6k556113
answered 32 mins ago
MarcoBMarcoB
37.6k556113
answered 32 mins ago
MarcoBMarcoB
37.6k556113
answered 32 mins ago
MarcoBMarcoB
37.6k556113
37.6k556113
add a comment |
add a comment |
$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.
answered 32 mins ago
mikadomikado
6,7071929
$endgroup$
add a comment |
$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.
answered 32 mins ago
mikadomikado
6,7071929
$endgroup$
add a comment |
$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.
answered 32 mins ago
mikadomikado
6,7071929
$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.
answered 32 mins ago
mikadomikado
6,7071929
edited 25 mins ago
answered 32 mins ago
mikadomikado
6,7071929
answered 32 mins ago
mikadomikado
6,7071929
answered 32 mins ago
mikadomikado
6,7071929
6,7071929
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
37 mins ago