Certain matrices of interesting determinant











up vote
4
down vote

favorite












Let $M_n$ be the $ntimes n$ matrix with entries
$$binom{i}{2j}+binom{j}{2i}, qquad text{for $1leq i,jleq n$}.$$




QUESTION. Is this true? There is some evidence. The determinant $det(M_{2n+1})=0$ and
$$det(M_{2n})=(-1)^nbinom{2n}n^22^{n(n-3)}.$$







linear-algebra determinants elementary-proofs







share|cite|improve this question


















  • 5




    The odd case is easy because $M_{2n-1}$ has an $n times n$ block of zeros at bottom right. In the even case, $M_{2n}$ still has that $n times n$ block of zeros, so its determinant is $(-1)^n$ times the product of the determinants of the $n times n$ blocks at top right and bottom left, which are equal because they are each other's transpose. So it comes down to a determinant of $i choose 2j$ for $i in [n-1,2n]$ and $j in [1,n]$, which must be known.
    – Noam D. Elkies
    4 hours ago






  • 1




    @NoamD.Elkies typo: $iin [n+1,2n]$
    – Fedor Petrov
    3 hours ago















up vote
4
down vote

favorite












Let $M_n$ be the $ntimes n$ matrix with entries
$$binom{i}{2j}+binom{j}{2i}, qquad text{for $1leq i,jleq n$}.$$




QUESTION. Is this true? There is some evidence. The determinant $det(M_{2n+1})=0$ and
$$det(M_{2n})=(-1)^nbinom{2n}n^22^{n(n-3)}.$$







linear-algebra determinants elementary-proofs







share|cite|improve this question


















  • 5




    The odd case is easy because $M_{2n-1}$ has an $n times n$ block of zeros at bottom right. In the even case, $M_{2n}$ still has that $n times n$ block of zeros, so its determinant is $(-1)^n$ times the product of the determinants of the $n times n$ blocks at top right and bottom left, which are equal because they are each other's transpose. So it comes down to a determinant of $i choose 2j$ for $i in [n-1,2n]$ and $j in [1,n]$, which must be known.
    – Noam D. Elkies
    4 hours ago






  • 1




    @NoamD.Elkies typo: $iin [n+1,2n]$
    – Fedor Petrov
    3 hours ago













up vote
4
down vote

favorite









up vote
4
down vote

favorite











Let $M_n$ be the $ntimes n$ matrix with entries
$$binom{i}{2j}+binom{j}{2i}, qquad text{for $1leq i,jleq n$}.$$




QUESTION. Is this true? There is some evidence. The determinant $det(M_{2n+1})=0$ and
$$det(M_{2n})=(-1)^nbinom{2n}n^22^{n(n-3)}.$$







linear-algebra determinants elementary-proofs







share|cite|improve this question













Let $M_n$ be the $ntimes n$ matrix with entries
$$binom{i}{2j}+binom{j}{2i}, qquad text{for $1leq i,jleq n$}.$$




QUESTION. Is this true? There is some evidence. The determinant $det(M_{2n+1})=0$ and
$$det(M_{2n})=(-1)^nbinom{2n}n^22^{n(n-3)}.$$







linear-algebra determinants elementary-proofs




linear-algebra determinants elementary-proofs






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 4 hours ago









T. Amdeberhan

16.9k228124




16.9k228124








  • 5




    The odd case is easy because $M_{2n-1}$ has an $n times n$ block of zeros at bottom right. In the even case, $M_{2n}$ still has that $n times n$ block of zeros, so its determinant is $(-1)^n$ times the product of the determinants of the $n times n$ blocks at top right and bottom left, which are equal because they are each other's transpose. So it comes down to a determinant of $i choose 2j$ for $i in [n-1,2n]$ and $j in [1,n]$, which must be known.
    – Noam D. Elkies
    4 hours ago






  • 1




    @NoamD.Elkies typo: $iin [n+1,2n]$
    – Fedor Petrov
    3 hours ago














  • 5




    The odd case is easy because $M_{2n-1}$ has an $n times n$ block of zeros at bottom right. In the even case, $M_{2n}$ still has that $n times n$ block of zeros, so its determinant is $(-1)^n$ times the product of the determinants of the $n times n$ blocks at top right and bottom left, which are equal because they are each other's transpose. So it comes down to a determinant of $i choose 2j$ for $i in [n-1,2n]$ and $j in [1,n]$, which must be known.
    – Noam D. Elkies
    4 hours ago






  • 1




    @NoamD.Elkies typo: $iin [n+1,2n]$
    – Fedor Petrov
    3 hours ago








5




5




The odd case is easy because $M_{2n-1}$ has an $n times n$ block of zeros at bottom right. In the even case, $M_{2n}$ still has that $n times n$ block of zeros, so its determinant is $(-1)^n$ times the product of the determinants of the $n times n$ blocks at top right and bottom left, which are equal because they are each other's transpose. So it comes down to a determinant of $i choose 2j$ for $i in [n-1,2n]$ and $j in [1,n]$, which must be known.
– Noam D. Elkies
4 hours ago




The odd case is easy because $M_{2n-1}$ has an $n times n$ block of zeros at bottom right. In the even case, $M_{2n}$ still has that $n times n$ block of zeros, so its determinant is $(-1)^n$ times the product of the determinants of the $n times n$ blocks at top right and bottom left, which are equal because they are each other's transpose. So it comes down to a determinant of $i choose 2j$ for $i in [n-1,2n]$ and $j in [1,n]$, which must be known.
– Noam D. Elkies
4 hours ago




1




1




@NoamD.Elkies typo: $iin [n+1,2n]$
– Fedor Petrov
3 hours ago




@NoamD.Elkies typo: $iin [n+1,2n]$
– Fedor Petrov
3 hours ago










1 Answer
1






active

oldest

votes

















up vote
2
down vote













Noam Elkies in the comments reduces the problem to evaluating the determinant of $binom{(n+1)+i}{2j+2}$, $i,j=0,1,dots,n-1$. It looks that in general the determinant $binom{N+i}{c_j+j}$, $i,j=0,dots,n-1$ for integers $0leqslant c_0leqslant c_1leqslant dots leqslant c_{n-1}$ may be calculated by the following trick.



Consider the Young diagrams $lambda,mu$ with rows length $c_0leqslant c_1leqslant dots leqslant c_{n-1}$ and $N,N,dots,N$ ($n$ rows in total)respectively. Count the skew Young tableaux of the shape $musetminus lambda$. On one hand, the number of such tableaux is known (see Okounkov, A., Olshanski, G.: Shifted Schur functions. St. Petersburg Math. J. 9(2), 73–146 (1997), Theorem 8.1) to be equal to $$frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N+i)!}cdot prod_{i=0}^{n-1} (c_i+i)!cdot detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}.$$
On the other hand, it is the same as the number of usual Young tableaux of the shape $(N-c_0,dots,N-c_{n-1})$, which may be evaluated by Hook Length Formula as
$$
frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
$$
Therefore
$$
detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}=\
prod_{i=0}^{n-1}frac{(N+i)!}{(c_i+i)!(N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
$$
It remains to substitute $N=n+1$ and $c_i=i+2$.
We get $$prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i<j}(j-i)=prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i=0}^{n-1} i!$$
and the answer rewrites as
$$
frac{1!2!dots (n-1)! (n+1)!dots (2n)!}
{2!4!dots (2n)! 2! 4!dots (2n-2)!}2^{n(n-1)/2}.
$$
Replace $2!4!dots (2n)!$ to $$2cdot 1!cdot 4cdot 3!cdot 6cdot 5!cdot ldotscdot (2n)cdot(2n-1)!=\=2^nn! 1!3!dots (2n-1)!.$$ We get $frac{(2n)!}{n!n!} 2^{n(n-3)/2}$
as supposed.






share|cite|improve this answer























    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: "504"
    };
    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',
    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
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f318826%2fcertain-matrices-of-interesting-determinant%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








    up vote
    2
    down vote













    Noam Elkies in the comments reduces the problem to evaluating the determinant of $binom{(n+1)+i}{2j+2}$, $i,j=0,1,dots,n-1$. It looks that in general the determinant $binom{N+i}{c_j+j}$, $i,j=0,dots,n-1$ for integers $0leqslant c_0leqslant c_1leqslant dots leqslant c_{n-1}$ may be calculated by the following trick.



    Consider the Young diagrams $lambda,mu$ with rows length $c_0leqslant c_1leqslant dots leqslant c_{n-1}$ and $N,N,dots,N$ ($n$ rows in total)respectively. Count the skew Young tableaux of the shape $musetminus lambda$. On one hand, the number of such tableaux is known (see Okounkov, A., Olshanski, G.: Shifted Schur functions. St. Petersburg Math. J. 9(2), 73–146 (1997), Theorem 8.1) to be equal to $$frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N+i)!}cdot prod_{i=0}^{n-1} (c_i+i)!cdot detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}.$$
    On the other hand, it is the same as the number of usual Young tableaux of the shape $(N-c_0,dots,N-c_{n-1})$, which may be evaluated by Hook Length Formula as
    $$
    frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
    $$
    Therefore
    $$
    detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}=\
    prod_{i=0}^{n-1}frac{(N+i)!}{(c_i+i)!(N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
    $$
    It remains to substitute $N=n+1$ and $c_i=i+2$.
    We get $$prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i<j}(j-i)=prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i=0}^{n-1} i!$$
    and the answer rewrites as
    $$
    frac{1!2!dots (n-1)! (n+1)!dots (2n)!}
    {2!4!dots (2n)! 2! 4!dots (2n-2)!}2^{n(n-1)/2}.
    $$
    Replace $2!4!dots (2n)!$ to $$2cdot 1!cdot 4cdot 3!cdot 6cdot 5!cdot ldotscdot (2n)cdot(2n-1)!=\=2^nn! 1!3!dots (2n-1)!.$$ We get $frac{(2n)!}{n!n!} 2^{n(n-3)/2}$
    as supposed.






    share|cite|improve this answer



























      up vote
      2
      down vote













      Noam Elkies in the comments reduces the problem to evaluating the determinant of $binom{(n+1)+i}{2j+2}$, $i,j=0,1,dots,n-1$. It looks that in general the determinant $binom{N+i}{c_j+j}$, $i,j=0,dots,n-1$ for integers $0leqslant c_0leqslant c_1leqslant dots leqslant c_{n-1}$ may be calculated by the following trick.



      Consider the Young diagrams $lambda,mu$ with rows length $c_0leqslant c_1leqslant dots leqslant c_{n-1}$ and $N,N,dots,N$ ($n$ rows in total)respectively. Count the skew Young tableaux of the shape $musetminus lambda$. On one hand, the number of such tableaux is known (see Okounkov, A., Olshanski, G.: Shifted Schur functions. St. Petersburg Math. J. 9(2), 73–146 (1997), Theorem 8.1) to be equal to $$frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N+i)!}cdot prod_{i=0}^{n-1} (c_i+i)!cdot detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}.$$
      On the other hand, it is the same as the number of usual Young tableaux of the shape $(N-c_0,dots,N-c_{n-1})$, which may be evaluated by Hook Length Formula as
      $$
      frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
      $$
      Therefore
      $$
      detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}=\
      prod_{i=0}^{n-1}frac{(N+i)!}{(c_i+i)!(N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
      $$
      It remains to substitute $N=n+1$ and $c_i=i+2$.
      We get $$prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i<j}(j-i)=prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i=0}^{n-1} i!$$
      and the answer rewrites as
      $$
      frac{1!2!dots (n-1)! (n+1)!dots (2n)!}
      {2!4!dots (2n)! 2! 4!dots (2n-2)!}2^{n(n-1)/2}.
      $$
      Replace $2!4!dots (2n)!$ to $$2cdot 1!cdot 4cdot 3!cdot 6cdot 5!cdot ldotscdot (2n)cdot(2n-1)!=\=2^nn! 1!3!dots (2n-1)!.$$ We get $frac{(2n)!}{n!n!} 2^{n(n-3)/2}$
      as supposed.






      share|cite|improve this answer

























        up vote
        2
        down vote










        up vote
        2
        down vote









        Noam Elkies in the comments reduces the problem to evaluating the determinant of $binom{(n+1)+i}{2j+2}$, $i,j=0,1,dots,n-1$. It looks that in general the determinant $binom{N+i}{c_j+j}$, $i,j=0,dots,n-1$ for integers $0leqslant c_0leqslant c_1leqslant dots leqslant c_{n-1}$ may be calculated by the following trick.



        Consider the Young diagrams $lambda,mu$ with rows length $c_0leqslant c_1leqslant dots leqslant c_{n-1}$ and $N,N,dots,N$ ($n$ rows in total)respectively. Count the skew Young tableaux of the shape $musetminus lambda$. On one hand, the number of such tableaux is known (see Okounkov, A., Olshanski, G.: Shifted Schur functions. St. Petersburg Math. J. 9(2), 73–146 (1997), Theorem 8.1) to be equal to $$frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N+i)!}cdot prod_{i=0}^{n-1} (c_i+i)!cdot detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}.$$
        On the other hand, it is the same as the number of usual Young tableaux of the shape $(N-c_0,dots,N-c_{n-1})$, which may be evaluated by Hook Length Formula as
        $$
        frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
        $$
        Therefore
        $$
        detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}=\
        prod_{i=0}^{n-1}frac{(N+i)!}{(c_i+i)!(N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
        $$
        It remains to substitute $N=n+1$ and $c_i=i+2$.
        We get $$prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i<j}(j-i)=prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i=0}^{n-1} i!$$
        and the answer rewrites as
        $$
        frac{1!2!dots (n-1)! (n+1)!dots (2n)!}
        {2!4!dots (2n)! 2! 4!dots (2n-2)!}2^{n(n-1)/2}.
        $$
        Replace $2!4!dots (2n)!$ to $$2cdot 1!cdot 4cdot 3!cdot 6cdot 5!cdot ldotscdot (2n)cdot(2n-1)!=\=2^nn! 1!3!dots (2n-1)!.$$ We get $frac{(2n)!}{n!n!} 2^{n(n-3)/2}$
        as supposed.






        share|cite|improve this answer














        Noam Elkies in the comments reduces the problem to evaluating the determinant of $binom{(n+1)+i}{2j+2}$, $i,j=0,1,dots,n-1$. It looks that in general the determinant $binom{N+i}{c_j+j}$, $i,j=0,dots,n-1$ for integers $0leqslant c_0leqslant c_1leqslant dots leqslant c_{n-1}$ may be calculated by the following trick.



        Consider the Young diagrams $lambda,mu$ with rows length $c_0leqslant c_1leqslant dots leqslant c_{n-1}$ and $N,N,dots,N$ ($n$ rows in total)respectively. Count the skew Young tableaux of the shape $musetminus lambda$. On one hand, the number of such tableaux is known (see Okounkov, A., Olshanski, G.: Shifted Schur functions. St. Petersburg Math. J. 9(2), 73–146 (1997), Theorem 8.1) to be equal to $$frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N+i)!}cdot prod_{i=0}^{n-1} (c_i+i)!cdot detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}.$$
        On the other hand, it is the same as the number of usual Young tableaux of the shape $(N-c_0,dots,N-c_{n-1})$, which may be evaluated by Hook Length Formula as
        $$
        frac{(Ncdot n-sum c_i)!}{prod_{i=0}^{n-1} (N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
        $$
        Therefore
        $$
        detleft(binom{N+i}{c_j+j}right)_{i,j=0}^{n-1}=\
        prod_{i=0}^{n-1}frac{(N+i)!}{(c_i+i)!(N-c_{n-i-1}+i)!}cdot prod_{i<j} (c_j+j-c_i-i).
        $$
        It remains to substitute $N=n+1$ and $c_i=i+2$.
        We get $$prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i<j}(j-i)=prod_{i<j} (c_j+j-c_i-i)=2^{n(n-1)/2}prod_{i=0}^{n-1} i!$$
        and the answer rewrites as
        $$
        frac{1!2!dots (n-1)! (n+1)!dots (2n)!}
        {2!4!dots (2n)! 2! 4!dots (2n-2)!}2^{n(n-1)/2}.
        $$
        Replace $2!4!dots (2n)!$ to $$2cdot 1!cdot 4cdot 3!cdot 6cdot 5!cdot ldotscdot (2n)cdot(2n-1)!=\=2^nn! 1!3!dots (2n-1)!.$$ We get $frac{(2n)!}{n!n!} 2^{n(n-3)/2}$
        as supposed.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 23 mins ago

























        answered 2 hours ago









        Fedor Petrov

        46.9k5110217




        46.9k5110217






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to MathOverflow!


            • 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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f318826%2fcertain-matrices-of-interesting-determinant%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            flock() on closed filehandle LOCK_FILE at /usr/bin/apt-mirror

            Image
            0 I recently upgraded an Ubuntu 16.04 virtual machine to 18.04. I regularly use this VM to run apt-mirror at school on their high-speed internet, then rsync these files to my rack-mount server at home for updating multiple computers at home without wasting the tiny amount of bandwidth I have there. Since updating I can't get apt-mirror to run on my VM. It keeps giving the error: flock() on closed filehandle LOCK_FILE at /usr/bin/apt-mirror line 214 immediately followed by: apt-mirror is already running, exiting at /usr/bin/apt-mirror line 217 apt-mirror is NOT running, and does not have a cron job. I've tried rebooting, and even looked for the old-style lockfile to delete, but I guess that method is no longer used. Is there some way to force unlock this so I can run apt-mirror? UPDATE: So... I f...
            Read more

            Mangá

            Image
              Nota:  Não confundir com Manga. Mangás e Animes Mangá Mangaká • Tankōbon Film comic La nouvelle manga Mangá original em inglês Anime História Animação influenciada por animes • Filler • OVA • Seiyū Públicos Kodomo • Shōjo • Shōnen Josei • Seinen Gêneros Mahō shōjo • Mecha • Harém Ecchi • Hentai ( Yaoi • Yuri Futanari • Shotacon • Lolicon Toddlercon ) Termos Bishōjo • Chibi • Fan service Gaiden • Kawaii • Kaitō • Light novel Mahō shōnen • Moe (antropomorfismo • Kemonomimi Nekomimi ) • Super deformed Omake • Tsundere • Yonkoma Listas Mangás • Animes • Ecchi • Mangaka • Estúdios • Revistas Fãs ( otaku ) Anime Music Video Convenções • Cosplay Dōjinshi • Fansub • Fandub • Fujoshi OS-tan • Scanlation Portal de Anime e mangá v d e O mangá (português brasileiro) ou manga (português europeu) [ 1 ] (em japonês: 漫画 , manga ? , lit. “história em quadrinhos”) , é a ...
            Read more

            Eduardo VII do Reino Unido

            Image
            Eduardo VII Rei do Reino Unido da Grã-Bretanha e Irlanda e dos Domínios Britânicos de Além-mar Imperador da Índia Rei do Reino Unido e Imperador da Índia Reinado 22 de janeiro de 1901 a 6 de maio de 1910 Coroação 9 de agosto de 1902 Delhi Durbar 1 de janeiro de 1903 Predecessora Vitória Sucessor Jorge V   Esposa Alexandra da Dinamarca Descendência Alberto Vitor, Duque de Clarence e Avondale Jorge V do Reino Unido Luísa, Princesa Real Vitória de Gales Maud de Gales Alexandre João de Gales Casa Saxe-Coburgo-Gota Nome completo Alberto Eduardo Nascimento 9 de novembro de 1841   Palácio de Buckingham, Londres, Reino Unido Morte 6 de maio de 1910 (68 anos)   Palácio de Buckingham, Londres, Reino Unido Enterro Capela de São Jorge, Windsor, Berkshire, Reino Unido 20 de maio de 1910 Pai Alberto de Saxe-Coburgo-Gota Mãe Vitória do Reino Unido Assinatura ...
            Read more