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
Air travel with refrigerated insulin
Why does the frost depth increase when the surface temperature warms up?
Connection Between Knot Theory and Number Theory
categorizing a variable turns it from insignificant to significant
What do the positive and negative (+/-) transmit and receive pins mean on Ethernet cables?
Put the phone down / Put down the phone
Why is participating in the European Parliamentary elections used as a threat?
Mortal danger in mid-grade literature
Is there a POSIX way to shutdown a UNIX machine?
Rendered textures different to 3D View
How do I lift the insulation blower into the attic?
How to test the sharpness of a knife?
Why does a 97 / 92 key piano exist by Bosendorfer?
What (if any) is the reason to buy in small local stores?
What is the tangent at a sharp point on a curve?
Why can't I get pgrep output right to variable on bash script?
Should I warn a new PhD Student?
Why is implicit conversion not ambiguous for non-primitive types?
Why didn’t Eve recognize the little cockroach as a living organism?
Did I make a mistake by ccing email to boss to others?
Why doesn't Gödel's incompleteness theorem apply to false statements?
How to preserve electronics (computers, ipads, phones) for hundreds of years?
Make a Bowl of Alphabet Soup
What is it called when someone votes for an option that's not their first choice?
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
$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
$endgroup$
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
6 hours 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
$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 7 hours ago
leastactionleastaction
23729
23729
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
6 hours 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
6 hours ago
1
1
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
6 hours ago
$begingroup$
An interesting idea, but a symbolic list where you have an ordering for all the elements is rare
$endgroup$
– mikado
6 hours 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$
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
6 hours 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.
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
6 hours ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1
and atOrdering[list /. _Subscript -> 1]
.
$endgroup$
– Kuba♦
6 hours 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
6 hours ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
6 hours 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] *)
$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.
$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$
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
6 hours 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$
$endgroup$
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
6 hours 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$
$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 6 hours ago
Carl WollCarl Woll
70.8k394184
70.8k394184
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
6 hours ago
add a comment |
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
6 hours ago
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
6 hours ago
$begingroup$
Thank you, Carl!
$endgroup$
– leastaction
6 hours 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.
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
6 hours ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1
and atOrdering[list /. _Subscript -> 1]
.
$endgroup$
– Kuba♦
6 hours 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
6 hours ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
6 hours 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.
$endgroup$
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
6 hours ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1
and atOrdering[list /. _Subscript -> 1]
.
$endgroup$
– Kuba♦
6 hours 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
6 hours ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
6 hours 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.
$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 6 hours ago
Kuba♦Kuba
106k12209530
106k12209530
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
6 hours ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1
and atOrdering[list /. _Subscript -> 1]
.
$endgroup$
– Kuba♦
6 hours 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
6 hours ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
6 hours ago
add a comment |
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
6 hours ago
$begingroup$
@leastaction just take a look atlist /. _Subscript -> 1
and atOrdering[list /. _Subscript -> 1]
.
$endgroup$
– Kuba♦
6 hours 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
6 hours ago
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
6 hours ago
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
6 hours ago
$begingroup$
Thanks! Seems to work like a charm, but can you shed some light on why?
$endgroup$
– leastaction
6 hours ago
$begingroup$
@leastaction just take a look at
list /. _Subscript -> 1
and at Ordering[list /. _Subscript -> 1]
.$endgroup$
– Kuba♦
6 hours ago
$begingroup$
@leastaction just take a look at
list /. _Subscript -> 1
and at Ordering[list /. _Subscript -> 1]
.$endgroup$
– Kuba♦
6 hours 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
6 hours 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
6 hours ago
1
1
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
6 hours ago
$begingroup$
@leastaction sure, which means there isn't one correct answer so every valid within constraints is correct?
$endgroup$
– Kuba♦
6 hours 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] *)
$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] *)
$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] *)
$endgroup$
Sort[list, TrueQ@Simplify[#1 < #2, _Subscript > 0] &]
(* Out: -Subscript[x, 3] - Subscript[x, 9], -Subscript[x, 9], 0, Subscript[x, 7] *)
answered 6 hours ago
MarcoBMarcoB
37.7k556113
37.7k556113
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.
$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.
$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.
$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.
edited 6 hours ago
answered 6 hours ago
mikadomikado
6,7171929
6,7171929
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
6 hours ago