How many integer r-tuples are there such that sum of the absolute values of their entries is less than or...












0












$begingroup$


How many r-tuples are there such that sum of absolute values of entries is less than or equal to $n$?



That is, what is the cardinality of the set $ {(x_1,...,x_r): x_i in Z text{ and }mid x_1mid+ ... + mid x_r mid leq n}$?



This should give me the growth function of the group $Z^r$ under the generating set $S={e_1,...,e_r}$ where $ e_i={0, ...,0, 1,0,...,0}$ with $1$ in the $i$-th position. It's known that the answer to this question is: $sum_{k=0}^{r}2^k {r choose k}{n choose k}$. I'm trying to figure it out for myself.




Attempt:
I have been able to figure out that the cardinality of $ {(x_1,...,x_r): x_i in Z^+ text{ and }x_1+ ... + x_r leq n}$ is $n choose k$.



Also I calculated cardinality of $ {(x_1,...,x_k): x_i in Z^+ text{ and } x_1+ ... + x_k = n}$ to be $n-1 choose k-1$ via the stars and bars method.



However, I am a little stuck on combining these results (or otherwise) to figure out the question with the absolute values.






combinatorics discrete-mathematics combinations subgroup-growth







share|cite|improve this question











$endgroup$












  • $begingroup$
    Look at the alternative problem: In how many ways can you divide $n$ $1$'s with $r-1$ separators? Then do it for $1, 2, .., n$. And don't forget about negative numbers.
    $endgroup$
    – EuxhenH
    Jan 10 at 19:46












  • $begingroup$
    @coffeemath you're right, in that case, which is my first step in my attempt, there should be the restriction that the $x_i$ are positive integers. I will reflect that.
    $endgroup$
    – Mike
    Jan 10 at 19:55










  • $begingroup$
    @coffeemath lol, it is stars and bars, I edited it.
    $endgroup$
    – Mike
    Jan 10 at 20:15










  • $begingroup$
    @RossMillikan Thanks for the catch, I converted everything to $k$'s
    $endgroup$
    – Mike
    Jan 10 at 20:16
















0












$begingroup$


How many r-tuples are there such that sum of absolute values of entries is less than or equal to $n$?



That is, what is the cardinality of the set $ {(x_1,...,x_r): x_i in Z text{ and }mid x_1mid+ ... + mid x_r mid leq n}$?



This should give me the growth function of the group $Z^r$ under the generating set $S={e_1,...,e_r}$ where $ e_i={0, ...,0, 1,0,...,0}$ with $1$ in the $i$-th position. It's known that the answer to this question is: $sum_{k=0}^{r}2^k {r choose k}{n choose k}$. I'm trying to figure it out for myself.




Attempt:
I have been able to figure out that the cardinality of $ {(x_1,...,x_r): x_i in Z^+ text{ and }x_1+ ... + x_r leq n}$ is $n choose k$.



Also I calculated cardinality of $ {(x_1,...,x_k): x_i in Z^+ text{ and } x_1+ ... + x_k = n}$ to be $n-1 choose k-1$ via the stars and bars method.



However, I am a little stuck on combining these results (or otherwise) to figure out the question with the absolute values.






combinatorics discrete-mathematics combinations subgroup-growth







share|cite|improve this question











$endgroup$












  • $begingroup$
    Look at the alternative problem: In how many ways can you divide $n$ $1$'s with $r-1$ separators? Then do it for $1, 2, .., n$. And don't forget about negative numbers.
    $endgroup$
    – EuxhenH
    Jan 10 at 19:46












  • $begingroup$
    @coffeemath you're right, in that case, which is my first step in my attempt, there should be the restriction that the $x_i$ are positive integers. I will reflect that.
    $endgroup$
    – Mike
    Jan 10 at 19:55










  • $begingroup$
    @coffeemath lol, it is stars and bars, I edited it.
    $endgroup$
    – Mike
    Jan 10 at 20:15










  • $begingroup$
    @RossMillikan Thanks for the catch, I converted everything to $k$'s
    $endgroup$
    – Mike
    Jan 10 at 20:16














0












0








0


1



$begingroup$


How many r-tuples are there such that sum of absolute values of entries is less than or equal to $n$?



That is, what is the cardinality of the set $ {(x_1,...,x_r): x_i in Z text{ and }mid x_1mid+ ... + mid x_r mid leq n}$?



This should give me the growth function of the group $Z^r$ under the generating set $S={e_1,...,e_r}$ where $ e_i={0, ...,0, 1,0,...,0}$ with $1$ in the $i$-th position. It's known that the answer to this question is: $sum_{k=0}^{r}2^k {r choose k}{n choose k}$. I'm trying to figure it out for myself.




Attempt:
I have been able to figure out that the cardinality of $ {(x_1,...,x_r): x_i in Z^+ text{ and }x_1+ ... + x_r leq n}$ is $n choose k$.



Also I calculated cardinality of $ {(x_1,...,x_k): x_i in Z^+ text{ and } x_1+ ... + x_k = n}$ to be $n-1 choose k-1$ via the stars and bars method.



However, I am a little stuck on combining these results (or otherwise) to figure out the question with the absolute values.






combinatorics discrete-mathematics combinations subgroup-growth







share|cite|improve this question











$endgroup$




How many r-tuples are there such that sum of absolute values of entries is less than or equal to $n$?



That is, what is the cardinality of the set $ {(x_1,...,x_r): x_i in Z text{ and }mid x_1mid+ ... + mid x_r mid leq n}$?



This should give me the growth function of the group $Z^r$ under the generating set $S={e_1,...,e_r}$ where $ e_i={0, ...,0, 1,0,...,0}$ with $1$ in the $i$-th position. It's known that the answer to this question is: $sum_{k=0}^{r}2^k {r choose k}{n choose k}$. I'm trying to figure it out for myself.




Attempt:
I have been able to figure out that the cardinality of $ {(x_1,...,x_r): x_i in Z^+ text{ and }x_1+ ... + x_r leq n}$ is $n choose k$.



Also I calculated cardinality of $ {(x_1,...,x_k): x_i in Z^+ text{ and } x_1+ ... + x_k = n}$ to be $n-1 choose k-1$ via the stars and bars method.



However, I am a little stuck on combining these results (or otherwise) to figure out the question with the absolute values.






combinatorics discrete-mathematics combinations subgroup-growth




combinatorics discrete-mathematics combinations subgroup-growth






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 10 at 20:14







Mike

















asked Jan 10 at 19:22









MikeMike

700414




700414












  • $begingroup$
    Look at the alternative problem: In how many ways can you divide $n$ $1$'s with $r-1$ separators? Then do it for $1, 2, .., n$. And don't forget about negative numbers.
    $endgroup$
    – EuxhenH
    Jan 10 at 19:46












  • $begingroup$
    @coffeemath you're right, in that case, which is my first step in my attempt, there should be the restriction that the $x_i$ are positive integers. I will reflect that.
    $endgroup$
    – Mike
    Jan 10 at 19:55










  • $begingroup$
    @coffeemath lol, it is stars and bars, I edited it.
    $endgroup$
    – Mike
    Jan 10 at 20:15










  • $begingroup$
    @RossMillikan Thanks for the catch, I converted everything to $k$'s
    $endgroup$
    – Mike
    Jan 10 at 20:16


















  • $begingroup$
    Look at the alternative problem: In how many ways can you divide $n$ $1$'s with $r-1$ separators? Then do it for $1, 2, .., n$. And don't forget about negative numbers.
    $endgroup$
    – EuxhenH
    Jan 10 at 19:46












  • $begingroup$
    @coffeemath you're right, in that case, which is my first step in my attempt, there should be the restriction that the $x_i$ are positive integers. I will reflect that.
    $endgroup$
    – Mike
    Jan 10 at 19:55










  • $begingroup$
    @coffeemath lol, it is stars and bars, I edited it.
    $endgroup$
    – Mike
    Jan 10 at 20:15










  • $begingroup$
    @RossMillikan Thanks for the catch, I converted everything to $k$'s
    $endgroup$
    – Mike
    Jan 10 at 20:16
















$begingroup$
Look at the alternative problem: In how many ways can you divide $n$ $1$'s with $r-1$ separators? Then do it for $1, 2, .., n$. And don't forget about negative numbers.
$endgroup$
– EuxhenH
Jan 10 at 19:46






$begingroup$
Look at the alternative problem: In how many ways can you divide $n$ $1$'s with $r-1$ separators? Then do it for $1, 2, .., n$. And don't forget about negative numbers.
$endgroup$
– EuxhenH
Jan 10 at 19:46














$begingroup$
@coffeemath you're right, in that case, which is my first step in my attempt, there should be the restriction that the $x_i$ are positive integers. I will reflect that.
$endgroup$
– Mike
Jan 10 at 19:55




$begingroup$
@coffeemath you're right, in that case, which is my first step in my attempt, there should be the restriction that the $x_i$ are positive integers. I will reflect that.
$endgroup$
– Mike
Jan 10 at 19:55












$begingroup$
@coffeemath lol, it is stars and bars, I edited it.
$endgroup$
– Mike
Jan 10 at 20:15




$begingroup$
@coffeemath lol, it is stars and bars, I edited it.
$endgroup$
– Mike
Jan 10 at 20:15












$begingroup$
@RossMillikan Thanks for the catch, I converted everything to $k$'s
$endgroup$
– Mike
Jan 10 at 20:16




$begingroup$
@RossMillikan Thanks for the catch, I converted everything to $k$'s
$endgroup$
– Mike
Jan 10 at 20:16










1 Answer
1






active

oldest

votes


















1












$begingroup$

Start from your result that the number of ways to sum $k$ positive numbers to $n$ or less is $n choose k$.



To get the number of ways to sum $k$ positive numbers and $r-k$ zeros to get $n$ or less you choose the positions of the zeros in $r choose k$ ways then choose the positive numbers in $n choose k$ ways, so the number of ways to sum $k$ positives and $r-k$ zeros to $n$ or less is ${r choose k}{n choose k}$.



Because of your absolute values we can choose the sign of the nonzero numbers in $2^k$ ways, so the number of ways to sum the absolute values of $k$ nonzero numbers and $r-k$ zeros is $2^k{r choose k}{n choose k}$.



Now we just sum over $k$ from $0$ to $r$, getting the desired result $$sum_{k=0}^r2^k{r choose k}{n choose k}$$



Added: Alpha gives a closed form using a hypergometric function
$$_2F_1(-n,-r;1;2)$$






share|cite|improve this answer











$endgroup$













    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
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3069074%2fhow-many-integer-r-tuples-are-there-such-that-sum-of-the-absolute-values-of-thei%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









    1












    $begingroup$

    Start from your result that the number of ways to sum $k$ positive numbers to $n$ or less is $n choose k$.



    To get the number of ways to sum $k$ positive numbers and $r-k$ zeros to get $n$ or less you choose the positions of the zeros in $r choose k$ ways then choose the positive numbers in $n choose k$ ways, so the number of ways to sum $k$ positives and $r-k$ zeros to $n$ or less is ${r choose k}{n choose k}$.



    Because of your absolute values we can choose the sign of the nonzero numbers in $2^k$ ways, so the number of ways to sum the absolute values of $k$ nonzero numbers and $r-k$ zeros is $2^k{r choose k}{n choose k}$.



    Now we just sum over $k$ from $0$ to $r$, getting the desired result $$sum_{k=0}^r2^k{r choose k}{n choose k}$$



    Added: Alpha gives a closed form using a hypergometric function
    $$_2F_1(-n,-r;1;2)$$






    share|cite|improve this answer











    $endgroup$


















      1












      $begingroup$

      Start from your result that the number of ways to sum $k$ positive numbers to $n$ or less is $n choose k$.



      To get the number of ways to sum $k$ positive numbers and $r-k$ zeros to get $n$ or less you choose the positions of the zeros in $r choose k$ ways then choose the positive numbers in $n choose k$ ways, so the number of ways to sum $k$ positives and $r-k$ zeros to $n$ or less is ${r choose k}{n choose k}$.



      Because of your absolute values we can choose the sign of the nonzero numbers in $2^k$ ways, so the number of ways to sum the absolute values of $k$ nonzero numbers and $r-k$ zeros is $2^k{r choose k}{n choose k}$.



      Now we just sum over $k$ from $0$ to $r$, getting the desired result $$sum_{k=0}^r2^k{r choose k}{n choose k}$$



      Added: Alpha gives a closed form using a hypergometric function
      $$_2F_1(-n,-r;1;2)$$






      share|cite|improve this answer











      $endgroup$
















        1












        1








        1





        $begingroup$

        Start from your result that the number of ways to sum $k$ positive numbers to $n$ or less is $n choose k$.



        To get the number of ways to sum $k$ positive numbers and $r-k$ zeros to get $n$ or less you choose the positions of the zeros in $r choose k$ ways then choose the positive numbers in $n choose k$ ways, so the number of ways to sum $k$ positives and $r-k$ zeros to $n$ or less is ${r choose k}{n choose k}$.



        Because of your absolute values we can choose the sign of the nonzero numbers in $2^k$ ways, so the number of ways to sum the absolute values of $k$ nonzero numbers and $r-k$ zeros is $2^k{r choose k}{n choose k}$.



        Now we just sum over $k$ from $0$ to $r$, getting the desired result $$sum_{k=0}^r2^k{r choose k}{n choose k}$$



        Added: Alpha gives a closed form using a hypergometric function
        $$_2F_1(-n,-r;1;2)$$






        share|cite|improve this answer











        $endgroup$



        Start from your result that the number of ways to sum $k$ positive numbers to $n$ or less is $n choose k$.



        To get the number of ways to sum $k$ positive numbers and $r-k$ zeros to get $n$ or less you choose the positions of the zeros in $r choose k$ ways then choose the positive numbers in $n choose k$ ways, so the number of ways to sum $k$ positives and $r-k$ zeros to $n$ or less is ${r choose k}{n choose k}$.



        Because of your absolute values we can choose the sign of the nonzero numbers in $2^k$ ways, so the number of ways to sum the absolute values of $k$ nonzero numbers and $r-k$ zeros is $2^k{r choose k}{n choose k}$.



        Now we just sum over $k$ from $0$ to $r$, getting the desired result $$sum_{k=0}^r2^k{r choose k}{n choose k}$$



        Added: Alpha gives a closed form using a hypergometric function
        $$_2F_1(-n,-r;1;2)$$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 12 at 6:52

























        answered Jan 10 at 20:23









        Ross MillikanRoss Millikan

        293k23197371




        293k23197371






























            draft saved

            draft discarded




















































            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3069074%2fhow-many-integer-r-tuples-are-there-such-that-sum-of-the-absolute-values-of-thei%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

            Mario Kart Wii

            Image
            Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro...
            Read more

            The Binding of Isaac: Rebirth/Afterbirth

            Image
            Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me...
            Read more

            What does “Dominus providebit” mean?

            Image
            5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1 ...
            Read more