Return to Answer

^{(terminology)} _{Needless to say, saying 'partitioned' here is not quite rigorous, since there are issues about sets of Lebesque-measure zero, which are of course irrelevant to this context. Of course, the OP did not even mention whether their 'tetrahedra' are open or closed point-sets. I will gloss over this.}

^{(terminology)} _{Needless to say, saying 'partitioned' here is not quite rigorous, since there are issues about sets of Lebesgue-measure zero, which are of course irrelevant to this context. Of course, the OP did not even mention whether their 'tetrahedra' are open or closed point-sets. I will gloss over this.}

Let us first carefully consider what the OP is actually asking.

• the fact that this can be combined with recent discoveries of what is called 'perfect parallelepipeds'^{(terminological suggestion)='non-cube parallelepipeds such that all three edge-lengths, and all three minor-face-diagonal-lengths, and all three major-face-diagonal-lengths, and all four body diagonal-lengths are positive integers.}

The first published specification of such a perfect parallelepiped appears to be:

Jorge F. Sawyer, Clifford A. Reiter: Perfect parallelepipeds exist. Mathematics of Computation Vol. 80, Number 274, 1037-1040

wherein one finds

and I would like to point out to the OP that

because of the above-mentioned 'partition' of perfect parallelepipeds into integer-edge-length tetrahedra, each perfect parallelepiped is a source of 6-tuples of the kind you are requesting.

To make the central argument of the present suggestion explicit:

The property that all edges and diagonals of a perfect parallelepiped have integer lengths implies that the above decomposition into tetrahedra does not incur any tetrahedron with a non-integer edge-length.

For example, the theorem of Sawyer and Reiter reproduced and color-coded above seems to correspond to a perfect parallelepiped of which the following picture is a not-to-scale representation

( _{The colors in the above picture correspond to the color-coding in the excerpt further above.} )

Moreover, it seems that you will be able to obtain infinitely-more than the "thirty" 6-tuples you request by

• carefully studying

Benjamin D. Sokolowsky, Amy G. VanHooft, Rachel M. Volkert and Clifford A. Reiter: An infinite family of perfect parallelepipeds.Math. Comp. 83 (2014), 2441-2454

• using the decomposition I mentioned above

• making it very clear in whatever you are writing that the notion of 'dissimilar' used in op. cit. suitably translates into a notion of 'dissimilarity' among the tetrahedra my proposal gives you (I did not look into that)

Please note that opening sentence

A rational parallelepiped is determined by three edge vectors $\vec{u}$, $\vec{v}$, $\vec{W}$. [emphasis added]

of the second section of op. cit. would be flat-out wrong (to see this: flatten the skeleton) if the word 'rational' were erased, since the skeleton of a cube is not even a locally-rigid framework, let alone a globally-rigid one^{(further reading on frameworks)}

Finally, facile^(facile) skepticist warnings

• the verification of whether the parallelepipeds specified by Sokolowsky--VanHooft--Volkert--Reiter actually do have all the properties claimed neither seems to have been done by any human being, nor seems to be doable in reasonable time by a human being,

• said verification seems to have been delegated to Mathematica,

• only few people seem to be allowed to look under the hood of the marvellous machine that it Mathematica,

• even if one is allowed to look under hoods of large machines, it is very very difficult to be sure whether they work as expected

• so in the unlikely case that you are thinking about using these 6-tuples for some critical application, you should think twice.

To summarize,

• this answer suggests to the OP to make use of the fact that currently more thought and energy is going into finding someting stronger than what they are asking for (namely: stepparallelepipeds),

• this answer suggests that the OP could usefully try to contact the authors of op. cit. about their problem,

• I do not know 'how complete' the method is that I am proposing here (i.e.: to procure the integer-edge-length-tetrahedra from steppable parallelepipeds), i.e., whether any integer-edge-lenght tetrahedron can be so obtained, but I strongly doubt it and expect it to be trivial to show that not all can be so obtained, but will have to leave the subject now.

• While personally I would prefer not to even know what you need these 6-tuples for, I would very much like to understand what 'stance' you are planning to take towards the 6-tuples you get from various sources. How, if at all, do you plan to verify whether a given integer 6-tuple is indeed realization by a tetrahedron in Euclidean 3-space? Also: what is known about the complexity-theoretic status of this problem in general, i.e., how complex is it to decide, given $a\in\omega^6$, whether there exists a perfect parallelepiped with these edge-lengths?

^(facile) _{It is facile because it is so easy to simply doubt anything, and since I know what an extremely well-discussed topic this is, for decades already. I am mentioning this to remind the OP that the references I give seem (0) not to contain humanly comprehensible proofs (more technically: a relevant satisfaction-relation seems not be checkable by human intuition), (1) seem to have only be checked with a software which is amazingly good, yet not formally verified. To be fair to both op. cit. and Mathematics, one should point out that, in a sense, they don't need each other: the kind of computations in op. cit. could easily be implemented in many other systems; the power of the mentioned package resides elsewhere. Moreover, I now the 'but-there-may-equally-well-be-a-bug-in-one's-brain' objection to insistence on intuitive surveyability, and I don't have an answer to that. Moreover, I do not mean to imply that op. cit. is not a proof, but I think it is not a traditional proof relative to any of the respected proof systems; more technically speaking, these proofs contain atomic sentences involving a new-fangled equality symbol $=_{\tiny\text{CAS}}$, in addition to the usual $=_{\tiny{\text{HumanIntuition}}}$, with 'CAS' standing for 'computer algebra system', and for which the satisfaction-relation $\vDash$ becomes interestingly problematic in the sense that a claim of the form ' $\mathrm{World}$ $\vDash (A=_{\tiny\mathrm{CAS}}B) $ ' cannot be checked by human intuition.}

^{(further reading on frameworks)} _{The most recent publication on the topic of rigid frameworks, at least spiritually relevant to the OP, is: Jessica Sidman, Audrey St. John: The Rigidity of Frameworks: Theory and Applications Notices of the AMS, October 2017}

^{(terminology)} _{Needless to say, saying 'partitioned' here is not quite rigorous, since there are issues about sets of Lebesque-measure zero, which are of course irrelevant to this context. Of course, the OP did not even mention whether their 'tetrahedra' are open or closed point-sets. I will gloss over this.}

(terminological suggestion)_{Personally I find the term 'perfect parallelepiped' very unfortunate and unimaginative. In particular, it seems to have nothing to do with 'perfect numbers'. My suggestion would be to rename this class of parallelepipeds 'steppable parallelepipeds', maybe even portmanteaued to 'stepparellipiped'. These would make for more neutral and more informative art terms, for obvious reasons: all relevant lengths (i.e. the blue, the yellow, the green, and the red ones in the above picture) of stepparellepipeds can be constructed by a machine which is only allowed (0) arbitrary rotations in space (while staying put), and (1) unit-length steps.}

Let us first consider what the OP is actually asking.

• the fact that this can be combined with recent discoveries of what is called^{(terminological suggestion)} 'perfect parallelepipeds'$=$ 'non-cube parallelepipeds such that all three edge-lengths, and all three minor-face-diagonal-lengths, and all three major-face-diagonal-lengths, and all four body diagonal-lengths are positive integers.'

The first published specification of such a perfect parallelepiped appears to be:

Jorge F. Sawyer, Clifford A. Reiter: Perfect parallelepipeds exist. Mathematics of Computation Vol. 80 (2010), Number 274, 1037-1040

wherein one finds

and I would like to point out to the OP that

because of the above-mentioned 'partition' of perfect parallelepipeds into integer-edge-length tetrahedra, each perfect parallelepiped is a source of 6-tuples of the kind you are requesting.

To make the central argument of the present suggestion explicit:

The property that all edges and diagonals of a perfect parallelepiped have integer lengths implies that the above decomposition into tetrahedra does not incur any tetrahedron with a non-integer edge-length.

For example, the theorem of Sawyer and Reiter reproduced and color-coded above seems to correspond to a perfect parallelepiped of which the following picture is a not-to-scale representation

( _{The colors in the above picture correspond to the color-coding in the excerpt further above.} )

Moreover, it seems that you will be able to obtain infinitely-more than the "thirty" 6-tuples you request by

• studying

Benjamin D. Sokolowsky, Amy G. VanHooft, Rachel M. Volkert and Clifford A. Reiter: An infinite family of perfect parallelepipeds.Math. Comp. 83 (2014), 2441-2454

• using the decomposition I mentioned above

• making it very clear in whatever you are writing that the notion of 'dissimilar' used in op. cit. suitably translates into a notion of 'dissimilarity' among the tetrahedra my proposal gives you (I did not look into that)

Please note that the opening sentence

A rational parallelepiped is determined by three edge vectors $\vec{u}$, $\vec{v}$, $\vec{W}$. [emphasis added]

of the second section of op. cit. would be flat-out wrong (to see this: flatten the skeleton) if the word 'rational' were erased, since the skeleton of a cube is not even a locally-rigid framework, let alone a globally-rigid one^{(further reading on frameworks)}

More precisely, the first sentence in the second section of op. cit. implies that

if you have a parallelepiped with all its edge-lengths, all its face-diagonal-lengths and all its body-diagonal-lengths rational (and infinitely-many dissimilar such exist), then each and every of its (evidently existing) 'rigid-motions' will necessarily cause at least one of the aforementioned lengths to become irrational.

which I find quite surprising. It is a sense of 'higher rigidity of parallelepipeds' (though only of a very special subclass of such parallelepipeds): while the structure is not rigid at all, a naturally associated 'configuration space' which has all the aforementioned lengths built into it explicitly would, when intersected with the rational numbers, be rigid.

Finally, facile^(facile) skepticist warnings

• the verification of whether the parallelepipeds specified by Sokolowsky--VanHooft--Volkert--Reiter actually do have all the properties claimed neither seems to have been done by any human being, nor seems to be doable in reasonable time by a human being,

• said verification seems to have been delegated to Mathematica,

• only few people seem to be allowed to look under the hood of the marvellous machine that is Mathematica,

• even if one is allowed to look under hoods of large machines, it is very very difficult to be sure whether they work as expected

• so in the unlikely case that you are thinking about using these 6-tuples for some critical application, you should think twice.

To summarize,

• this answer suggests to the OP to make use of the fact that currently more thought and energy is going into finding someting stronger than what they are asking for (namely: stepparallelepipeds),

• this answer suggests that the OP could usefully try to contact the authors of op. cit. about their problem,

• I do not know 'how complete' the method is that I am proposing here (i.e.: to procure the integer-edge-length-tetrahedra from steppable parallelepipeds), i.e., whether any integer-edge-lenght tetrahedron can be so obtained, but I strongly doubt it and expect it to be trivial to show that not all can be so obtained, but will have to leave the subject now.

• While personally I would prefer not to even know what you need these 6-tuples for, I would very much like to understand what 'stance' you are planning to take towards the 6-tuples you get from various sources. How, if at all, do you plan to verify whether a given integer 6-tuple is indeed realization by a tetrahedron in Euclidean 3-space? Also: what is known about the complexity-theoretic status of this problem in general, i.e., how complex is it to decide, given $a\in\omega^6$, whether there exists a perfect parallelepiped with these edge-lengths?

^(facile) _{It is facile because it is so easy to simply doubt anything, and since I know what an extremely well-discussed topic this is, for decades already. I am mentioning this to remind the OP that the references I give seem (0) not to contain humanly comprehensible proofs (more technically: a relevant satisfaction-relation seems not be checkable by human intuition), (1) seem to have only be checked with a software which is amazingly good, yet not formally verified. To be fair to both op. cit. and Mathematica, one should point out that, in a sense, they don't need each other: the kind of computations in op. cit. could easily be implemented in many other systems; the power of the mentioned package resides elsewhere. Moreover, I know the 'but-there-may-equally-well-be-a-bug-in-one's-mind' objection to insistence on intuitive surveyability, and I don't have an answer to that. Moreover, I do not mean to imply that op. cit. is not a proof, but I think it is not a traditional proof relative to any of the respected proof systems; more technically speaking, these proofs contain atomic sentences involving a new-fangled equality symbol $=_{\scriptsize\text{CAS}}$, in addition to the usual $=_{\scriptsize{\text{HumanIntuition}}}$, with 'CAS' standing for 'computer algebra system', and for which the satisfaction-relation $\vDash$ becomes interestingly problematic in the sense that a claim of the form ' $\mathrm{World}$ $\vDash (A=_{\scriptsize\mathrm{CAS}}B) $ ' cannot be checked by human intuition.}

^{(further reading on frameworks)} _{The most recent publication on the topic of rigid frameworks, at least spiritually relevant to the OP, is: Jessica Sidman, Audrey St. John: The Rigidity of Frameworks: Theory and Applications. Notices of the AMS, October 2017.}

^{(terminology)} _{Needless to say, saying 'partitioned' here is not quite rigorous, since there are issues about sets of Lebesque-measure zero, which are of course irrelevant to this context. Of course, the OP did not even mention whether their 'tetrahedra' are open or closed point-sets. I will gloss over this.}

^{(terminological suggestion)} _{Personally I find the term 'perfect parallelepiped' very unfortunate and unimaginative. In particular, it seems to have nothing to do with 'perfect numbers'. My suggestion would be to rename this class of parallelepipeds 'steppable parallelepipeds', maybe even portmanteaued to 'stepparellipiped'. These would make for more neutral and more informative art terms, for obvious reasons: all relevant lengths (i.e. the blue, the yellow, the green, and the red ones in the above picture) of stepparellepipeds can be constructed by a machine which is only allowed (0) arbitrary rotations in space (while staying put), and (1) unit-length steps.}

• The answer to the question in the title is practically-certain to be negative. There does not exist anything worthy of the name 'database' for these 6-tuples. There do exist scattered results. The whole topic seems frustratingly difficult.

• The answer to the first question in the body of the OP

Is there a collection of lists of six integer edge lengths that form a tetrahedron?

is positive. An answer of Igor Rivin has identified such a 'collection'. An answer of M. Winter has identified another way to obtain some such 6-tuples. It seems to me that none of these answer, at least not evidently gives the OP what they are requesting with

I need to find approximately thirty such tetrahedral combinations.

unless one assumes that $\approx 10$ is the same as $\approx 30$.

• the fact that this can be combined with recent discoveries of what is called 'perfect parallelepipeds'^{(terminological suggestion)='non-cube parallelepipeds such that all three edge-lengths, and all three minor-face-diagonal-lengths, and all three major-face-diagonal-lengths, and all four body diagonal-lengths are positive integers.}

The first published specification of such a perfect parallelepiped appears to be:

Jorge F. Sawyer, Clifford A. Reiter: Perfect parallelepipeds exist. Mathematics of Computation Vol. 80, Number 274, 1037-1040

wherein one finds

and I would like to point out to the OP that

because of the above-mentioned 'partition' of perfect parallelepipeds into integer-edge-length tetrahedra, each perfect parallelepiped is a source of 6-tuples of the kind you are requesting.

To make the central argument of the present suggestion explicit:

The property that all edges and diagonals of a perfect parallelepiped have integer lengths implies that the above decomposition into tetrahedra does not incur any tetrahedron with a non-integer edge-length.

For example, the theorem of Sawyer and Reiter reproduced and color-coded above seems to correspond to a perfect parallelepiped of which the following picture is an inadequate^(inadequate) representation

( _{The colors in the above picture correspond to the color-coding in the excerpt further above.} )

Moreover, it seems that you will be able to obtain infinitely-more than the "thirty" 6-tuples you request by

• carefully studying

Benjamin D. Sokolowsky, Amy G. VanHooft, Rachel M. Volkert and Clifford A. Reiter: An infinite family of perfect parallelepipeds.Math. Comp. 83 (2014), 2441-2454

• using the decomposition I mentioned above

• making it very clear in whatever you are writing that the notion of 'dissimilar' used in op. cit. suitably translates into a notion of 'dissimilarity' among the tetrahedra my proposal gives you (I did not look into that)

Please note that opening sentence

A rational parallelepiped is determined by three edge vectors $\vec{u}$, $\vec{v}$, $\vec{W}$. [emphasis added]

of the second section of op. cit. would be flat-out wrong (to see this: flatten the skeleton) if the word 'rational' were erased, since the skeleton of a cube is not even a locally-rigid framework, let alone a globally-rigid one^{(further reading on frameworks)}

Finally, facile^(facile) skepticist warnings

• the verification of whether the parallelepipeds specified by Sokolowsky--VanHooft--Volkert--Reiter actually do have all the properties claimed neither seems to have been done by any human being, nor seems to be doable in reasonable time by a human being,

• said verification seems to have been delegated to Mathematica,

• only few people seem to be allowed to look under the hood of the marvellous machine that it Mathematica,

• even if one is allowed to look under hoods of large machines, it is very very difficult to be sure whether they work as expected

• so in the unlikely case that you are thinking about using these 6-tuples for some critical application, you should think twice.

To summarize,

• this answer suggests to the OP to make use of the fact that currently more thought and energy is going into finding someting stronger than what they are asking for (namely: stepparallelepipeds),

• this answer suggests that the OP could usefully try to contact the authors of op. cit. about their problem,

• I do not know 'how complete' the method is that I am proposing here (i.e.: to procure the integer-edge-length-tetrahedra from steppable parallelepipeds), i.e., whether any integer-edge-lenght tetrahedron can be so obtained, but I strongly doubt it and expect it to be trivial to show that not all can be so obtained, but will have to leave the subject now.

• While personally I would prefer not to even know what you need these 6-tuples for, I would very much like to understand what 'stance' you are planning to take towards the 6-tuples you get from various sources. How, if at all, do you plan to verify whether a given integer 6-tuple is indeed realization by a tetrahedron in Euclidean 3-space? Also: do you know something about the complexity-theoretic status of this problem?

^(facile) _{It is facile because it is so easy to simply doubt anything, and since I know what an extremely well-discussed topic this is, for decades already. I am mentioning this to remind the OP that the references I give seem (0) not to contain humanly comprehensible proofs (more technically: a relevant satisfaction-relation seems not be checkable by human intuition), (1) seem to have only be checked with a software which is amazingly good, yet not formally verified. To be fair to both op. cit. and Mathematics, one should point out that, in a sense, they don't need each other: the kind of computations in op. cit. could easily be implemented in many other systems; the power of the mentioned package resides elsewhere. Moreover, I now the 'but-there-may-equally-well-be-a-bug-in-one's-brain' objection to insistence on intuitive surveyability, and I don't have an answer to that. Moreover, I do not mean to imply that op. cit. is not a proof, but I think it is not a traditional proof relative to any of the respected proof systems; more technically speaking, these proofs contain atomic sentences involving a new-fangled equality symbol $=_{\tiny\text{CAS}}$, in addition to the usual $=_{\tiny{\text{HumanIntuition}}}$, with 'CAS' standing for 'computer algebra system', and for which the satisfaction-relation $\vDash$ becomes interestingly problematic in the sense that a claim of the form ' $\mathrm{World}$ $\vDash (A=_{\tiny\mathrm{CAS}}B) $ ' cannot be checked by human intuition.}

^{(further reading on frameworks)} _{The most recent publication on the topic of rigid frameworks, at least spiritually relevant to the OP, is: Jessica Sidman, Audrey St. John: The Rigidity of Frameworks: Theory and Applications Notices of the AMS, October 2017}

^(inadequate) _{I accidentally made this with a tool unsuitable for making the local corrections which would be needed to give a to-scale rendition of the example in op. cit.}

I don't know whether I will get round to give this another go.

I here reproduce an ill-fated attempt at giving all the data, which, again, is inadequate:

^{(terminology)} _{Needless to say, saying 'partitioned' here is not quite rigorous, since there are issues about sets of Lebesque-measure zero, which are of course irrelevant to this context. Of course, the OP did not even mention whether their 'tetrahedra' are open or closed point-sets. I will gloss over this.}

(terminological suggestion)

• The answer to the question in the title is practically-certain to be negative. There does not exist anything worthy of the name 'database' for these 6-tuples. There do exist scattered results. The whole topic seems frustratingly difficult. There seems to be a controversy around whether it has been proved that a perfect parallelepiped with all angles right angles does not exist.

• The answer to the first question in the body of the OP

Is there a collection of lists of six integer edge lengths that form a tetrahedron?

is positive. An answer of Igor Rivin has identified such a 'collection'. An answer of M. Winter has identified another way to obtain some such 6-tuples.

• the fact that this can be combined with recent discoveries of what is called 'perfect parallelepipeds'^{(terminological suggestion)='non-cube parallelepipeds such that all three edge-lengths, and all three minor-face-diagonal-lengths, and all three major-face-diagonal-lengths, and all four body diagonal-lengths are positive integers.}

The first published specification of such a perfect parallelepiped appears to be:

Jorge F. Sawyer, Clifford A. Reiter: Perfect parallelepipeds exist. Mathematics of Computation Vol. 80, Number 274, 1037-1040

wherein one finds

and I would like to point out to the OP that

because of the above-mentioned 'partition' of perfect parallelepipeds into integer-edge-length tetrahedra, each perfect parallelepiped is a source of 6-tuples of the kind you are requesting.

To make the central argument of the present suggestion explicit:

The property that all edges and diagonals of a perfect parallelepiped have integer lengths implies that the above decomposition into tetrahedra does not incur any tetrahedron with a non-integer edge-length.

For example, the theorem of Sawyer and Reiter reproduced and color-coded above seems to correspond to a perfect parallelepiped of which the following picture is a not-to-scale representation

( _{The colors in the above picture correspond to the color-coding in the excerpt further above.} )

Moreover, it seems that you will be able to obtain infinitely-more than the "thirty" 6-tuples you request by

• carefully studying

Benjamin D. Sokolowsky, Amy G. VanHooft, Rachel M. Volkert and Clifford A. Reiter: An infinite family of perfect parallelepipeds.Math. Comp. 83 (2014), 2441-2454

• using the decomposition I mentioned above

• making it very clear in whatever you are writing that the notion of 'dissimilar' used in op. cit. suitably translates into a notion of 'dissimilarity' among the tetrahedra my proposal gives you (I did not look into that)

Please note that opening sentence

A rational parallelepiped is determined by three edge vectors $\vec{u}$, $\vec{v}$, $\vec{W}$. [emphasis added]

of the second section of op. cit. would be flat-out wrong (to see this: flatten the skeleton) if the word 'rational' were erased, since the skeleton of a cube is not even a locally-rigid framework, let alone a globally-rigid one^{(further reading on frameworks)}

Finally, facile^(facile) skepticist warnings

• the verification of whether the parallelepipeds specified by Sokolowsky--VanHooft--Volkert--Reiter actually do have all the properties claimed neither seems to have been done by any human being, nor seems to be doable in reasonable time by a human being,

• said verification seems to have been delegated to Mathematica,

• only few people seem to be allowed to look under the hood of the marvellous machine that it Mathematica,

• even if one is allowed to look under hoods of large machines, it is very very difficult to be sure whether they work as expected

• so in the unlikely case that you are thinking about using these 6-tuples for some critical application, you should think twice.

To summarize,

• this answer suggests to the OP to make use of the fact that currently more thought and energy is going into finding someting stronger than what they are asking for (namely: stepparallelepipeds),

• this answer suggests that the OP could usefully try to contact the authors of op. cit. about their problem,

• I do not know 'how complete' the method is that I am proposing here (i.e.: to procure the integer-edge-length-tetrahedra from steppable parallelepipeds), i.e., whether any integer-edge-lenght tetrahedron can be so obtained, but I strongly doubt it and expect it to be trivial to show that not all can be so obtained, but will have to leave the subject now.

• While personally I would prefer not to even know what you need these 6-tuples for, I would very much like to understand what 'stance' you are planning to take towards the 6-tuples you get from various sources. How, if at all, do you plan to verify whether a given integer 6-tuple is indeed realization by a tetrahedron in Euclidean 3-space? Also: what is known about the complexity-theoretic status of this problem in general, i.e., how complex is it to decide, given $a\in\omega^6$, whether there exists a perfect parallelepiped with these edge-lengths?

^(facile) _{It is facile because it is so easy to simply doubt anything, and since I know what an extremely well-discussed topic this is, for decades already. I am mentioning this to remind the OP that the references I give seem (0) not to contain humanly comprehensible proofs (more technically: a relevant satisfaction-relation seems not be checkable by human intuition), (1) seem to have only be checked with a software which is amazingly good, yet not formally verified. To be fair to both op. cit. and Mathematics, one should point out that, in a sense, they don't need each other: the kind of computations in op. cit. could easily be implemented in many other systems; the power of the mentioned package resides elsewhere. Moreover, I now the 'but-there-may-equally-well-be-a-bug-in-one's-brain' objection to insistence on intuitive surveyability, and I don't have an answer to that. Moreover, I do not mean to imply that op. cit. is not a proof, but I think it is not a traditional proof relative to any of the respected proof systems; more technically speaking, these proofs contain atomic sentences involving a new-fangled equality symbol $=_{\tiny\text{CAS}}$, in addition to the usual $=_{\tiny{\text{HumanIntuition}}}$, with 'CAS' standing for 'computer algebra system', and for which the satisfaction-relation $\vDash$ becomes interestingly problematic in the sense that a claim of the form ' $\mathrm{World}$ $\vDash (A=_{\tiny\mathrm{CAS}}B) $ ' cannot be checked by human intuition.}

^{(further reading on frameworks)} _{The most recent publication on the topic of rigid frameworks, at least spiritually relevant to the OP, is: Jessica Sidman, Audrey St. John: The Rigidity of Frameworks: Theory and Applications Notices of the AMS, October 2017}

^{(terminology)} _{Needless to say, saying 'partitioned' here is not quite rigorous, since there are issues about sets of Lebesque-measure zero, which are of course irrelevant to this context. Of course, the OP did not even mention whether their 'tetrahedra' are open or closed point-sets. I will gloss over this.}

(terminological suggestion)