Divisibility of sum of multinomialsInteger-valued factorial ratiosPerron number distributionDesign constraint systems over the realsOn “The Average Height of Planted Plane Trees” by Knuth, de Bruijn and Rice (1972)Montgomery's conjecture and lower bound on certain Fourier transform.Distribution of the evaluation (at a non-trivial root of -1) of polynomials with small coefficientsCombinatorialProbabilistic Proof of Stirling's ApproximationGeneralizing Kasteleyn's formula even more?Derive a theoretical bound about coding with a partial eavesdropperTartaglia distribution
Divisibility of sum of multinomials
Integer-valued factorial ratiosPerron number distributionDesign constraint systems over the realsOn “The Average Height of Planted Plane Trees” by Knuth, de Bruijn and Rice (1972)Montgomery's conjecture and lower bound on certain Fourier transform.Distribution of the evaluation (at a non-trivial root of -1) of polynomials with small coefficientsCombinatorialProbabilistic Proof of Stirling's ApproximationGeneralizing Kasteleyn's formula even more?Derive a theoretical bound about coding with a partial eavesdropperTartaglia distribution
$begingroup$
Let $n, m$ and $t$ be positive integers. Define the multi-family of sequences
$$S(n,m,t)=sum_k_1+cdots+k_n=mbinommk_1,dots,k_n^t$$
where the sum runs over non-negative integers $k_1,dots,k_n$. These numbers are related to average distances (from the origin) of uniform unit-step random walks on the plane.
QUESTION. Is it always true that $n$ divides $S(n,m,t)$?
Observe that $S(n,m,1)=n^m$.
nt.number-theory co.combinatorics soft-question
asked 1 hour ago
T. AmdeberhanT. Amdeberhan
18.3k229132
$endgroup$
add a comment |
$begingroup$
Let $n, m$ and $t$ be positive integers. Define the multi-family of sequences
$$S(n,m,t)=sum_k_1+cdots+k_n=mbinommk_1,dots,k_n^t$$
where the sum runs over non-negative integers $k_1,dots,k_n$. These numbers are related to average distances (from the origin) of uniform unit-step random walks on the plane.
QUESTION. Is it always true that $n$ divides $S(n,m,t)$?
Observe that $S(n,m,1)=n^m$.
nt.number-theory co.combinatorics soft-question
asked 1 hour ago
T. AmdeberhanT. Amdeberhan
18.3k229132
$endgroup$
add a comment |
$begingroup$
Let $n, m$ and $t$ be positive integers. Define the multi-family of sequences
$$S(n,m,t)=sum_k_1+cdots+k_n=mbinommk_1,dots,k_n^t$$
where the sum runs over non-negative integers $k_1,dots,k_n$. These numbers are related to average distances (from the origin) of uniform unit-step random walks on the plane.
QUESTION. Is it always true that $n$ divides $S(n,m,t)$?
Observe that $S(n,m,1)=n^m$.
nt.number-theory co.combinatorics soft-question
asked 1 hour ago
T. AmdeberhanT. Amdeberhan
18.3k229132
$endgroup$
Let $n, m$ and $t$ be positive integers. Define the multi-family of sequences
$$S(n,m,t)=sum_k_1+cdots+k_n=mbinommk_1,dots,k_n^t$$
where the sum runs over non-negative integers $k_1,dots,k_n$. These numbers are related to average distances (from the origin) of uniform unit-step random walks on the plane.
QUESTION. Is it always true that $n$ divides $S(n,m,t)$?
Observe that $S(n,m,1)=n^m$.
nt.number-theory co.combinatorics soft-question
nt.number-theory co.combinatorics soft-question
asked 1 hour ago
T. AmdeberhanT. Amdeberhan
18.3k229132
asked 1 hour ago
T. AmdeberhanT. Amdeberhan
18.3k229132
edited 1 hour ago
T. Amdeberhan
asked 1 hour ago
T. AmdeberhanT. Amdeberhan
18.3k229132
asked 1 hour ago
T. AmdeberhanT. Amdeberhan
18.3k229132
asked 1 hour ago
T. AmdeberhanT. Amdeberhan
18.3k229132
18.3k229132
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
We count the number of $t$-tuples $(xi_1,ldots,xi_t)$ of the colorings of $1,ldots,m$ with $n$ given colors, for which any two colorings use the same multisets of colors. If $M$ is the number of such tuples in which 1 is colored red in the coloring $xi_1$ (red is one of our $n$ colors), the total number of $t$-tuples equals $ncdot M$.
answered 31 mins ago
Fedor PetrovFedor Petrov
51.9k6122239
$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: "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',
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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%2fmathoverflow.net%2fquestions%2f327456%2fdivisibility-of-sum-of-multinomials%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$
We count the number of $t$-tuples $(xi_1,ldots,xi_t)$ of the colorings of $1,ldots,m$ with $n$ given colors, for which any two colorings use the same multisets of colors. If $M$ is the number of such tuples in which 1 is colored red in the coloring $xi_1$ (red is one of our $n$ colors), the total number of $t$-tuples equals $ncdot M$.
answered 31 mins ago
Fedor PetrovFedor Petrov
51.9k6122239
$endgroup$
add a comment |
$begingroup$
We count the number of $t$-tuples $(xi_1,ldots,xi_t)$ of the colorings of $1,ldots,m$ with $n$ given colors, for which any two colorings use the same multisets of colors. If $M$ is the number of such tuples in which 1 is colored red in the coloring $xi_1$ (red is one of our $n$ colors), the total number of $t$-tuples equals $ncdot M$.
answered 31 mins ago
Fedor PetrovFedor Petrov
51.9k6122239
$endgroup$
add a comment |
$begingroup$
We count the number of $t$-tuples $(xi_1,ldots,xi_t)$ of the colorings of $1,ldots,m$ with $n$ given colors, for which any two colorings use the same multisets of colors. If $M$ is the number of such tuples in which 1 is colored red in the coloring $xi_1$ (red is one of our $n$ colors), the total number of $t$-tuples equals $ncdot M$.
answered 31 mins ago
Fedor PetrovFedor Petrov
51.9k6122239
$endgroup$
We count the number of $t$-tuples $(xi_1,ldots,xi_t)$ of the colorings of $1,ldots,m$ with $n$ given colors, for which any two colorings use the same multisets of colors. If $M$ is the number of such tuples in which 1 is colored red in the coloring $xi_1$ (red is one of our $n$ colors), the total number of $t$-tuples equals $ncdot M$.
answered 31 mins ago
Fedor PetrovFedor Petrov
51.9k6122239
answered 31 mins ago
Fedor PetrovFedor Petrov
51.9k6122239
answered 31 mins ago
Fedor PetrovFedor Petrov
51.9k6122239
answered 31 mins ago
Fedor PetrovFedor Petrov
51.9k6122239
51.9k6122239
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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%2fmathoverflow.net%2fquestions%2f327456%2fdivisibility-of-sum-of-multinomials%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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
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
