All Questions
Tagged with co.combinatorics experimental-mathematics
10 questions
15
votes
3
answers
1k
views
Does anyone remember what happened to the experimental search for polynomial identities for $\pi$?
So a while back I was on the internet and had encountered a website containing an experimental search for identities for $\pi$. My memory was that the page belonged to either Jonathan Sondow or ...
- 2,689
4
votes
1
answer
294
views
Why should we expect this odd behavior of negative binomial distributions?
In independent Bernoulli trials with probability $p$ of success on each trial, let $X$ be the number of failures before the $n$th success. Then
$$
\Pr(X=x) = \binom{-n}{\phantom{+}x} (-q)^x p^n \text{ ...
2
votes
1
answer
240
views
What is wrong with the experimental evidence against the semi strong perfect graph theorem?
We got experimental evidence against the semi strong perfect graph theorem
and would like to learn what is wrong with it.
From Recognizing the P4-structure of bipartite graph
The P4-structure of a ...
- 25.4k
7
votes
0
answers
429
views
Dynamics of a curious bijection of $\mathbb N$
The two sequences A48680 and A48679 of the OEIS define two mutually inverse bijections on the set of all strictly positive natural numbers given (for the comfort of the reader) as follows:
Given an ...
- 17.9k
1
vote
0
answers
375
views
The Knuth-Stolarsky conjecture in addition chains
I would like some general feedback on an experiment I have run in the field of addition chains.
An addition chain for target integer $n$ is defined as:
$$1=a_0<a_1<\cdots<a_r=n \text{ with } ...
- 97
3
votes
0
answers
303
views
Growth functions of finite group - computation, typical behaviour, surveys?
Looking on the growth function for Rubik's group and symmetric group, one sees rather different behaviour:
Rubik's growth in LOG scale (see MO322877):
S_n n=9 growth and nice fit by normal ...
- 24.9k
18
votes
3
answers
785
views
Automated search for bijective proofs
In enumerative combinatorics, a bijective proof that $|A_n| = |B_n|$ (where $A_n$ and $B_n$ are finite sets of combinatorial objects of size $n$) is a proof that constructs an explicit bijection ...
- 82.7k
2
votes
0
answers
266
views
Experimentation with partial Euler products
Richard Mathar $[1]\& [2]$ shows that
\begin{align}
&\zeta_{2}(s)\equiv\prod_{\Omega(n)=2}^{}\left(\dfrac{1}{1 - n^{s}}\right)^{-1}=\exp \left(\sum _{k=1}^n \frac{P(k s)^2+P(2 k s)}{2 k}\right)...
- 1,903
3
votes
1
answer
586
views
Trying to prove a congruence for Stirling numbers of the second kind
This a repost of a question I asked at Stack Exchange, but I got no answer so far, so I am trying here, even though it may not suit the "research level" requirement.
Proposition: When $n$ and $m$ are ...
- 505
2
votes
1
answer
295
views
A determinant involving only cyclotomic factors
Let $\alpha:\mathbb Z\longrightarrow \mathbb Z$ be a quadratic polynomial taking only integral values on the integers and consider the sequence of square-matrices with coefficients
$x^{\alpha(i+j)}$ ...
- 17.9k