Skip to main content

All Questions

5 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
2 votes
0 answers
215 views

An approach to the prime number theorem with Rademacher variables and a recursive formula for the prime pi function?

Consider the bipartite graphs defined here: Why is this bipartite graph a partial cube, if it is? We do random walks on them with equal propability and since the graphs are finite and connected the ...
mathoverflowUser's user avatar
1 vote
0 answers
134 views

Number of ways to place 4 kings on nxn chessboard

I have a $n\times n$ chessboard and 4 kings inside it. My goal is to count the number of arrangements where some of them are non-attacking or mutually attacking, for example: In the case where the $4$...
Cardstdani's user avatar
1 vote
0 answers
84 views

Percolative process distribution not equivalent to coupon collector problem distribution

I have a process where; given a $n\times 1$ matrix initially empty, an element is inserted in it at a random position, with the possibility of repeating the insertion at a filled cell. Then, after a ...
Cardstdani's user avatar
0 votes
0 answers
63 views

Arrangements of fixed $k$-polyplets in a $n\times n$ matrix

Recently, I asked a question about the number of arrangements of $k$ elements inside a $n\times n$ matrix with certain restrictions. The one I´m actually interested in for this question is in its 2. ...
Cardstdani's user avatar
0 votes
0 answers
55 views

Counting matrix paths for (n,m>2) matrices

Given a $n\times m$ matrix with $k$ elements inside it, I need to calculate the number of arrangements of those $k$ elements that form at least 1 path from the top to bottom matrix row composed of the ...
Cardstdani's user avatar