What is the maximum number of spheres with same radius that can touch each other in n dimensions.
$begingroup$
For 2 dimensions there can be three circles that can touch each other. In 3 dimensions there can be 4 spheres that can touch each other. What would be the number of hyper-spheres that can touch each other directly in n dimensions?
geometry geometric-topology
$endgroup$
add a comment |
$begingroup$
For 2 dimensions there can be three circles that can touch each other. In 3 dimensions there can be 4 spheres that can touch each other. What would be the number of hyper-spheres that can touch each other directly in n dimensions?
geometry geometric-topology
$endgroup$
$begingroup$
You can get 4 circles all touching one another in 2 dimensions. One will have to be smaller than the others and placed in the middle, though (or larger and put around them). See the two red circles in this image.
$endgroup$
– Arthur
Jan 24 at 11:23
$begingroup$
forgot to add that the circles are of same radius. Will add that in the question.
$endgroup$
– Gajanand Jha
Jan 24 at 11:49
add a comment |
$begingroup$
For 2 dimensions there can be three circles that can touch each other. In 3 dimensions there can be 4 spheres that can touch each other. What would be the number of hyper-spheres that can touch each other directly in n dimensions?
geometry geometric-topology
$endgroup$
For 2 dimensions there can be three circles that can touch each other. In 3 dimensions there can be 4 spheres that can touch each other. What would be the number of hyper-spheres that can touch each other directly in n dimensions?
geometry geometric-topology
geometry geometric-topology
edited Jan 24 at 11:51
Gajanand Jha
asked Jan 24 at 11:18
Gajanand JhaGajanand Jha
32
32
$begingroup$
You can get 4 circles all touching one another in 2 dimensions. One will have to be smaller than the others and placed in the middle, though (or larger and put around them). See the two red circles in this image.
$endgroup$
– Arthur
Jan 24 at 11:23
$begingroup$
forgot to add that the circles are of same radius. Will add that in the question.
$endgroup$
– Gajanand Jha
Jan 24 at 11:49
add a comment |
$begingroup$
You can get 4 circles all touching one another in 2 dimensions. One will have to be smaller than the others and placed in the middle, though (or larger and put around them). See the two red circles in this image.
$endgroup$
– Arthur
Jan 24 at 11:23
$begingroup$
forgot to add that the circles are of same radius. Will add that in the question.
$endgroup$
– Gajanand Jha
Jan 24 at 11:49
$begingroup$
You can get 4 circles all touching one another in 2 dimensions. One will have to be smaller than the others and placed in the middle, though (or larger and put around them). See the two red circles in this image.
$endgroup$
– Arthur
Jan 24 at 11:23
$begingroup$
You can get 4 circles all touching one another in 2 dimensions. One will have to be smaller than the others and placed in the middle, though (or larger and put around them). See the two red circles in this image.
$endgroup$
– Arthur
Jan 24 at 11:23
$begingroup$
forgot to add that the circles are of same radius. Will add that in the question.
$endgroup$
– Gajanand Jha
Jan 24 at 11:49
$begingroup$
forgot to add that the circles are of same radius. Will add that in the question.
$endgroup$
– Gajanand Jha
Jan 24 at 11:49
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
In $n$ dimensions, the maximum is $n+1$.
Two spheres (I'll use that term regardless of dimension) of radius $r$ are tangent to each other if and only if the distance between their centers is $2r$. Thus, $n+1$ spheres are all tangent to each other if and only if the distance between any two of those points is $2r$.
These $n+1$ points thus form a $n$-simplex with all sides equal to $2r$. We wish to show that this figure requires at least $n$ dimensions. Why? Because we can calculate its $n$-volume, and that volume is positive.
The $n$-volume of a $n$-simplex with vertices $z_0,z_1,dots,z_n$ is $frac1{n!}left|detbegin{pmatrix}z_1-z_0&z_2-z_0&cdots&z_n-z_0end{pmatrix}right|$. Or, at least, it is if those vectors are all in $mathbb{R}^n$. Since we're varying the number of dimensions, we need a volume formula that can hold up to that. For example, in $mathbb{R}^3$, the area of a triangle will come from the length of the cross product of two of its side vectors; the cross product serves as a sort of directed area formula.
That matrix $Z$ we took the determinant of in the $mathbb{R}^n$ case still makes sense if all the vectors are in $mathbb{R}^m$ for some other $m$; it just won't be square. So, what can we do? Multiply it by its transpose. The resulting matrix is square, symmetric, and positive semidefinite, so we can take its determinant, and then the square root of that determinant. The volume we seek, if the $z_i$ are points in any $mathbb{R}^m$, is $frac1{n!}sqrt{det(Z^TZ)}$. Writing down the entries of $Z^TZ$, we get
$$Z^TZ = begin{bmatrix}|z_1-z_0|^2&(z_1-z_0)cdot(z_2-z_0)&cdots&(z_1-z_0)cdot(z_n-z_0)\(z_2-z_0)cdot(z_1-z_0)&|z_2-z_0|^2&cdots&(z_2-z_0)cdot(z_n-z_0)\ vdots&vdots&ddots&vdots\ (z_n-z_0)cdot(z_1-z_0)&(z_n-z_0)cdot(z_2-z_0)&cdots&|z_n-z_0|^2end{bmatrix}$$
Those dots are the usual dot product of vectors, of course. Next, we convert all those dot products into a form based entirely on the distances between the points. If $d_{ij}$ is the distance between points $z_i$ and $z_j$, then $(z_i-z_0)cdot (z_j-z_0) = frac12left(d_{0i}^2+d_{0j}^2-d_{ij}^2right)$. Apply this in our case with all the $d_{ij}$ equal to $2r$, and
$$Z^TZ = begin{bmatrix}4r^2&2r^2&cdots&2r^2\2r^2&4r^2&cdots&2r^2\ vdots&vdots&ddots&vdots\2r^2&2r^2&cdots&4r^2end{bmatrix}$$
The determinant of that $ntimes n$ matrix is $2^ncdot r^{2n}cdot (n+1)$, so the $n$-volume is $r^nsqrt{frac{2^n(n+1)}{n!}}$. That's not zero, so we need at least $n$ dimensions to fit our $n+1$ points at equal distances.
As a side note, I prefer working with that determinant formula a bit more. With some clever linear algebra, we can replace $Z^tZ$ with a $(n+2)times (n+2)$ matrix that has just squared distances as entries:
$$V^2=frac{(-1)^{n+1}}{2^n (n!)^2}detbegin{bmatrix}0&1&1&1&1&cdots&1\1&0&d_{10}^2&d_{20}^2&d_{30}^2&cdots&d_{n0}^2\1&d_{01}^2&0&d_{21}^2&d_{31}^2&cdots&d_{n1}^2\1&d_{02}^2&d_{12}^2&0&d_{32}^2&cdots&d_{n2}^2\1&d_{03}^2&d_{13}^2&d_{23}^2&0&cdots&d_{n3}^2\ vdots&vdots&vdots&vdots&vdots&ddots&vdots\ 1&d_{0n}^2&d_{1n}^2&d_{2n}^2&d_{3n}^2&cdots&0end{bmatrix}$$
It wasn't necessary for this problem, but it's a neat one to know - the higher-dimensional generalization of Heron's formula.
$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: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2fmath.stackexchange.com%2fquestions%2f3085758%2fwhat-is-the-maximum-number-of-spheres-with-same-radius-that-can-touch-each-other%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
In $n$ dimensions, the maximum is $n+1$.
Two spheres (I'll use that term regardless of dimension) of radius $r$ are tangent to each other if and only if the distance between their centers is $2r$. Thus, $n+1$ spheres are all tangent to each other if and only if the distance between any two of those points is $2r$.
These $n+1$ points thus form a $n$-simplex with all sides equal to $2r$. We wish to show that this figure requires at least $n$ dimensions. Why? Because we can calculate its $n$-volume, and that volume is positive.
The $n$-volume of a $n$-simplex with vertices $z_0,z_1,dots,z_n$ is $frac1{n!}left|detbegin{pmatrix}z_1-z_0&z_2-z_0&cdots&z_n-z_0end{pmatrix}right|$. Or, at least, it is if those vectors are all in $mathbb{R}^n$. Since we're varying the number of dimensions, we need a volume formula that can hold up to that. For example, in $mathbb{R}^3$, the area of a triangle will come from the length of the cross product of two of its side vectors; the cross product serves as a sort of directed area formula.
That matrix $Z$ we took the determinant of in the $mathbb{R}^n$ case still makes sense if all the vectors are in $mathbb{R}^m$ for some other $m$; it just won't be square. So, what can we do? Multiply it by its transpose. The resulting matrix is square, symmetric, and positive semidefinite, so we can take its determinant, and then the square root of that determinant. The volume we seek, if the $z_i$ are points in any $mathbb{R}^m$, is $frac1{n!}sqrt{det(Z^TZ)}$. Writing down the entries of $Z^TZ$, we get
$$Z^TZ = begin{bmatrix}|z_1-z_0|^2&(z_1-z_0)cdot(z_2-z_0)&cdots&(z_1-z_0)cdot(z_n-z_0)\(z_2-z_0)cdot(z_1-z_0)&|z_2-z_0|^2&cdots&(z_2-z_0)cdot(z_n-z_0)\ vdots&vdots&ddots&vdots\ (z_n-z_0)cdot(z_1-z_0)&(z_n-z_0)cdot(z_2-z_0)&cdots&|z_n-z_0|^2end{bmatrix}$$
Those dots are the usual dot product of vectors, of course. Next, we convert all those dot products into a form based entirely on the distances between the points. If $d_{ij}$ is the distance between points $z_i$ and $z_j$, then $(z_i-z_0)cdot (z_j-z_0) = frac12left(d_{0i}^2+d_{0j}^2-d_{ij}^2right)$. Apply this in our case with all the $d_{ij}$ equal to $2r$, and
$$Z^TZ = begin{bmatrix}4r^2&2r^2&cdots&2r^2\2r^2&4r^2&cdots&2r^2\ vdots&vdots&ddots&vdots\2r^2&2r^2&cdots&4r^2end{bmatrix}$$
The determinant of that $ntimes n$ matrix is $2^ncdot r^{2n}cdot (n+1)$, so the $n$-volume is $r^nsqrt{frac{2^n(n+1)}{n!}}$. That's not zero, so we need at least $n$ dimensions to fit our $n+1$ points at equal distances.
As a side note, I prefer working with that determinant formula a bit more. With some clever linear algebra, we can replace $Z^tZ$ with a $(n+2)times (n+2)$ matrix that has just squared distances as entries:
$$V^2=frac{(-1)^{n+1}}{2^n (n!)^2}detbegin{bmatrix}0&1&1&1&1&cdots&1\1&0&d_{10}^2&d_{20}^2&d_{30}^2&cdots&d_{n0}^2\1&d_{01}^2&0&d_{21}^2&d_{31}^2&cdots&d_{n1}^2\1&d_{02}^2&d_{12}^2&0&d_{32}^2&cdots&d_{n2}^2\1&d_{03}^2&d_{13}^2&d_{23}^2&0&cdots&d_{n3}^2\ vdots&vdots&vdots&vdots&vdots&ddots&vdots\ 1&d_{0n}^2&d_{1n}^2&d_{2n}^2&d_{3n}^2&cdots&0end{bmatrix}$$
It wasn't necessary for this problem, but it's a neat one to know - the higher-dimensional generalization of Heron's formula.
$endgroup$
add a comment |
$begingroup$
In $n$ dimensions, the maximum is $n+1$.
Two spheres (I'll use that term regardless of dimension) of radius $r$ are tangent to each other if and only if the distance between their centers is $2r$. Thus, $n+1$ spheres are all tangent to each other if and only if the distance between any two of those points is $2r$.
These $n+1$ points thus form a $n$-simplex with all sides equal to $2r$. We wish to show that this figure requires at least $n$ dimensions. Why? Because we can calculate its $n$-volume, and that volume is positive.
The $n$-volume of a $n$-simplex with vertices $z_0,z_1,dots,z_n$ is $frac1{n!}left|detbegin{pmatrix}z_1-z_0&z_2-z_0&cdots&z_n-z_0end{pmatrix}right|$. Or, at least, it is if those vectors are all in $mathbb{R}^n$. Since we're varying the number of dimensions, we need a volume formula that can hold up to that. For example, in $mathbb{R}^3$, the area of a triangle will come from the length of the cross product of two of its side vectors; the cross product serves as a sort of directed area formula.
That matrix $Z$ we took the determinant of in the $mathbb{R}^n$ case still makes sense if all the vectors are in $mathbb{R}^m$ for some other $m$; it just won't be square. So, what can we do? Multiply it by its transpose. The resulting matrix is square, symmetric, and positive semidefinite, so we can take its determinant, and then the square root of that determinant. The volume we seek, if the $z_i$ are points in any $mathbb{R}^m$, is $frac1{n!}sqrt{det(Z^TZ)}$. Writing down the entries of $Z^TZ$, we get
$$Z^TZ = begin{bmatrix}|z_1-z_0|^2&(z_1-z_0)cdot(z_2-z_0)&cdots&(z_1-z_0)cdot(z_n-z_0)\(z_2-z_0)cdot(z_1-z_0)&|z_2-z_0|^2&cdots&(z_2-z_0)cdot(z_n-z_0)\ vdots&vdots&ddots&vdots\ (z_n-z_0)cdot(z_1-z_0)&(z_n-z_0)cdot(z_2-z_0)&cdots&|z_n-z_0|^2end{bmatrix}$$
Those dots are the usual dot product of vectors, of course. Next, we convert all those dot products into a form based entirely on the distances between the points. If $d_{ij}$ is the distance between points $z_i$ and $z_j$, then $(z_i-z_0)cdot (z_j-z_0) = frac12left(d_{0i}^2+d_{0j}^2-d_{ij}^2right)$. Apply this in our case with all the $d_{ij}$ equal to $2r$, and
$$Z^TZ = begin{bmatrix}4r^2&2r^2&cdots&2r^2\2r^2&4r^2&cdots&2r^2\ vdots&vdots&ddots&vdots\2r^2&2r^2&cdots&4r^2end{bmatrix}$$
The determinant of that $ntimes n$ matrix is $2^ncdot r^{2n}cdot (n+1)$, so the $n$-volume is $r^nsqrt{frac{2^n(n+1)}{n!}}$. That's not zero, so we need at least $n$ dimensions to fit our $n+1$ points at equal distances.
As a side note, I prefer working with that determinant formula a bit more. With some clever linear algebra, we can replace $Z^tZ$ with a $(n+2)times (n+2)$ matrix that has just squared distances as entries:
$$V^2=frac{(-1)^{n+1}}{2^n (n!)^2}detbegin{bmatrix}0&1&1&1&1&cdots&1\1&0&d_{10}^2&d_{20}^2&d_{30}^2&cdots&d_{n0}^2\1&d_{01}^2&0&d_{21}^2&d_{31}^2&cdots&d_{n1}^2\1&d_{02}^2&d_{12}^2&0&d_{32}^2&cdots&d_{n2}^2\1&d_{03}^2&d_{13}^2&d_{23}^2&0&cdots&d_{n3}^2\ vdots&vdots&vdots&vdots&vdots&ddots&vdots\ 1&d_{0n}^2&d_{1n}^2&d_{2n}^2&d_{3n}^2&cdots&0end{bmatrix}$$
It wasn't necessary for this problem, but it's a neat one to know - the higher-dimensional generalization of Heron's formula.
$endgroup$
add a comment |
$begingroup$
In $n$ dimensions, the maximum is $n+1$.
Two spheres (I'll use that term regardless of dimension) of radius $r$ are tangent to each other if and only if the distance between their centers is $2r$. Thus, $n+1$ spheres are all tangent to each other if and only if the distance between any two of those points is $2r$.
These $n+1$ points thus form a $n$-simplex with all sides equal to $2r$. We wish to show that this figure requires at least $n$ dimensions. Why? Because we can calculate its $n$-volume, and that volume is positive.
The $n$-volume of a $n$-simplex with vertices $z_0,z_1,dots,z_n$ is $frac1{n!}left|detbegin{pmatrix}z_1-z_0&z_2-z_0&cdots&z_n-z_0end{pmatrix}right|$. Or, at least, it is if those vectors are all in $mathbb{R}^n$. Since we're varying the number of dimensions, we need a volume formula that can hold up to that. For example, in $mathbb{R}^3$, the area of a triangle will come from the length of the cross product of two of its side vectors; the cross product serves as a sort of directed area formula.
That matrix $Z$ we took the determinant of in the $mathbb{R}^n$ case still makes sense if all the vectors are in $mathbb{R}^m$ for some other $m$; it just won't be square. So, what can we do? Multiply it by its transpose. The resulting matrix is square, symmetric, and positive semidefinite, so we can take its determinant, and then the square root of that determinant. The volume we seek, if the $z_i$ are points in any $mathbb{R}^m$, is $frac1{n!}sqrt{det(Z^TZ)}$. Writing down the entries of $Z^TZ$, we get
$$Z^TZ = begin{bmatrix}|z_1-z_0|^2&(z_1-z_0)cdot(z_2-z_0)&cdots&(z_1-z_0)cdot(z_n-z_0)\(z_2-z_0)cdot(z_1-z_0)&|z_2-z_0|^2&cdots&(z_2-z_0)cdot(z_n-z_0)\ vdots&vdots&ddots&vdots\ (z_n-z_0)cdot(z_1-z_0)&(z_n-z_0)cdot(z_2-z_0)&cdots&|z_n-z_0|^2end{bmatrix}$$
Those dots are the usual dot product of vectors, of course. Next, we convert all those dot products into a form based entirely on the distances between the points. If $d_{ij}$ is the distance between points $z_i$ and $z_j$, then $(z_i-z_0)cdot (z_j-z_0) = frac12left(d_{0i}^2+d_{0j}^2-d_{ij}^2right)$. Apply this in our case with all the $d_{ij}$ equal to $2r$, and
$$Z^TZ = begin{bmatrix}4r^2&2r^2&cdots&2r^2\2r^2&4r^2&cdots&2r^2\ vdots&vdots&ddots&vdots\2r^2&2r^2&cdots&4r^2end{bmatrix}$$
The determinant of that $ntimes n$ matrix is $2^ncdot r^{2n}cdot (n+1)$, so the $n$-volume is $r^nsqrt{frac{2^n(n+1)}{n!}}$. That's not zero, so we need at least $n$ dimensions to fit our $n+1$ points at equal distances.
As a side note, I prefer working with that determinant formula a bit more. With some clever linear algebra, we can replace $Z^tZ$ with a $(n+2)times (n+2)$ matrix that has just squared distances as entries:
$$V^2=frac{(-1)^{n+1}}{2^n (n!)^2}detbegin{bmatrix}0&1&1&1&1&cdots&1\1&0&d_{10}^2&d_{20}^2&d_{30}^2&cdots&d_{n0}^2\1&d_{01}^2&0&d_{21}^2&d_{31}^2&cdots&d_{n1}^2\1&d_{02}^2&d_{12}^2&0&d_{32}^2&cdots&d_{n2}^2\1&d_{03}^2&d_{13}^2&d_{23}^2&0&cdots&d_{n3}^2\ vdots&vdots&vdots&vdots&vdots&ddots&vdots\ 1&d_{0n}^2&d_{1n}^2&d_{2n}^2&d_{3n}^2&cdots&0end{bmatrix}$$
It wasn't necessary for this problem, but it's a neat one to know - the higher-dimensional generalization of Heron's formula.
$endgroup$
In $n$ dimensions, the maximum is $n+1$.
Two spheres (I'll use that term regardless of dimension) of radius $r$ are tangent to each other if and only if the distance between their centers is $2r$. Thus, $n+1$ spheres are all tangent to each other if and only if the distance between any two of those points is $2r$.
These $n+1$ points thus form a $n$-simplex with all sides equal to $2r$. We wish to show that this figure requires at least $n$ dimensions. Why? Because we can calculate its $n$-volume, and that volume is positive.
The $n$-volume of a $n$-simplex with vertices $z_0,z_1,dots,z_n$ is $frac1{n!}left|detbegin{pmatrix}z_1-z_0&z_2-z_0&cdots&z_n-z_0end{pmatrix}right|$. Or, at least, it is if those vectors are all in $mathbb{R}^n$. Since we're varying the number of dimensions, we need a volume formula that can hold up to that. For example, in $mathbb{R}^3$, the area of a triangle will come from the length of the cross product of two of its side vectors; the cross product serves as a sort of directed area formula.
That matrix $Z$ we took the determinant of in the $mathbb{R}^n$ case still makes sense if all the vectors are in $mathbb{R}^m$ for some other $m$; it just won't be square. So, what can we do? Multiply it by its transpose. The resulting matrix is square, symmetric, and positive semidefinite, so we can take its determinant, and then the square root of that determinant. The volume we seek, if the $z_i$ are points in any $mathbb{R}^m$, is $frac1{n!}sqrt{det(Z^TZ)}$. Writing down the entries of $Z^TZ$, we get
$$Z^TZ = begin{bmatrix}|z_1-z_0|^2&(z_1-z_0)cdot(z_2-z_0)&cdots&(z_1-z_0)cdot(z_n-z_0)\(z_2-z_0)cdot(z_1-z_0)&|z_2-z_0|^2&cdots&(z_2-z_0)cdot(z_n-z_0)\ vdots&vdots&ddots&vdots\ (z_n-z_0)cdot(z_1-z_0)&(z_n-z_0)cdot(z_2-z_0)&cdots&|z_n-z_0|^2end{bmatrix}$$
Those dots are the usual dot product of vectors, of course. Next, we convert all those dot products into a form based entirely on the distances between the points. If $d_{ij}$ is the distance between points $z_i$ and $z_j$, then $(z_i-z_0)cdot (z_j-z_0) = frac12left(d_{0i}^2+d_{0j}^2-d_{ij}^2right)$. Apply this in our case with all the $d_{ij}$ equal to $2r$, and
$$Z^TZ = begin{bmatrix}4r^2&2r^2&cdots&2r^2\2r^2&4r^2&cdots&2r^2\ vdots&vdots&ddots&vdots\2r^2&2r^2&cdots&4r^2end{bmatrix}$$
The determinant of that $ntimes n$ matrix is $2^ncdot r^{2n}cdot (n+1)$, so the $n$-volume is $r^nsqrt{frac{2^n(n+1)}{n!}}$. That's not zero, so we need at least $n$ dimensions to fit our $n+1$ points at equal distances.
As a side note, I prefer working with that determinant formula a bit more. With some clever linear algebra, we can replace $Z^tZ$ with a $(n+2)times (n+2)$ matrix that has just squared distances as entries:
$$V^2=frac{(-1)^{n+1}}{2^n (n!)^2}detbegin{bmatrix}0&1&1&1&1&cdots&1\1&0&d_{10}^2&d_{20}^2&d_{30}^2&cdots&d_{n0}^2\1&d_{01}^2&0&d_{21}^2&d_{31}^2&cdots&d_{n1}^2\1&d_{02}^2&d_{12}^2&0&d_{32}^2&cdots&d_{n2}^2\1&d_{03}^2&d_{13}^2&d_{23}^2&0&cdots&d_{n3}^2\ vdots&vdots&vdots&vdots&vdots&ddots&vdots\ 1&d_{0n}^2&d_{1n}^2&d_{2n}^2&d_{3n}^2&cdots&0end{bmatrix}$$
It wasn't necessary for this problem, but it's a neat one to know - the higher-dimensional generalization of Heron's formula.
answered Jan 24 at 12:48
jmerryjmerry
12.6k1628
12.6k1628
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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%2fmath.stackexchange.com%2fquestions%2f3085758%2fwhat-is-the-maximum-number-of-spheres-with-same-radius-that-can-touch-each-other%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
$begingroup$
You can get 4 circles all touching one another in 2 dimensions. One will have to be smaller than the others and placed in the middle, though (or larger and put around them). See the two red circles in this image.
$endgroup$
– Arthur
Jan 24 at 11:23
$begingroup$
forgot to add that the circles are of same radius. Will add that in the question.
$endgroup$
– Gajanand Jha
Jan 24 at 11:49