All Questions
145 questions
34
votes
2
answers
3k
views
Shimura-Taniyama-Weil VS Grothendieck's dessins
When listening to the beautiful lectures by Gilles Schaeffer at
the SLC68, the following (perhaps crazy) question occurred to me:
did anyone attempt (succeed?) to combinatorially prove modularity of ...
27
votes
3
answers
2k
views
Kasteleyn's formula for domino tilings generalized?
It seems a marvel when a bunch of irrational numbers "conspire" to become rational, even better an integer. An elementary example is $\prod_{j=1}^n4\cos^2\left(\pi j/(2n+1)\right)=1$.
Kasteleyn's ...
25
votes
3
answers
1k
views
what else is in $\prod_{j=1}^n(1+q^j)$?
From time to time, I run into the finite product $\prod_{j=1}^n(1+q^j)$. And, the more it happens, the more fascinated I've become. So, herein, I wish to get help in collecting such results. To give ...
23
votes
4
answers
2k
views
Identity for an infinite product
Here is an experimental "result" exhibiting the difference of two (formal) infinite products that "almost factorizes".
QUESTION. Is this true?
$$\prod_{n\geq1}(1+x^{2n-1})^{24} - \...
18
votes
3
answers
745
views
Number of primitive $n$th roots with positive versus negative real parts
Does anyone know a reference to the following results, which I can prove, but I suspect may be known. Let $R(n)$ denote the number of primitive $n$th roots of unity with positive real part, and $L(n)$ ...
17
votes
2
answers
1k
views
The GCD-matrix: generalizing a result of Smith?
Let $M$ be the $n\times n$ matrix, known as the GCD matrix, of entries $M_{ij}=\gcd(i,j)$. In the paper
H J S Smith, On the value of a certain arithmetical determinant, Proc. London Math. Soc. 7:208-...
17
votes
2
answers
938
views
Has the following problem, resembling the lonely runner conjecture, been studied?
Given $n$, what is the smallest value $\delta_n$ satisfying the following:
For any group of $n$ runners with constant but distinct speeds,
starting from the same point and running clockwise along the ...
17
votes
1
answer
701
views
Combinatorics problem about sum of natural numbers
Following combinatorics problem is claimed to be an open problem in "The Princeton Companion to Mathematics" (pp. 6)
Let $a_1,a_2,a_3,...$ be a sequence of positive integers, and suppose that each $...
15
votes
4
answers
3k
views
Collecting alternative proofs for the oddity of Catalan
Consider the ubiquitous Catalan numbers $C_n=\frac1{n+1}\binom{2n}n$. In this post, I am looking for your help in my attempt to collect alternative proofs of the following fact: $C_n$ is odd if and ...
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 ...
15
votes
4
answers
2k
views
Are any good strategies known for Erdos-Turan conjecture on additive bases of order two?
The following problem can become a bit of an obsession. I'm curious if there are any serious strategies for attacking it. The problem is a certain Erdos-Turan conjecture.
Let $ B \subseteq {\mathbb ...
14
votes
7
answers
3k
views
A special type of generating function for Fibonacci
Notation. Let $[x^n]G(x)$ be the coefficient of $x^n$ in the Taylor series of $G(x)$.
Consider the sequence of central binomial coefficients $\binom{2n}n$. Then there two ways to recover them:
$$\...
14
votes
1
answer
495
views
powered partition function generator: 1/2 of them are zeros?
Ramanujan delivered his famous congruences
$$p(5n+4)\equiv_50, \qquad p(7n+5)\equiv_70, \qquad p(11n+6)\equiv_{11}0$$
for the integer partitions with generating function $F(x)=\prod_{k=0}^{\infty}\...
14
votes
1
answer
755
views
Generating function of the Thue-Morse sequence
Let $T$ be the generating function of the Thue-Morse sequence; thus,
$T(x)=x+x^2+x^4+x^7+\dotsb$. It is known that $T$ satisfies the nice
congruence
$$ (1+x)^3 T^2(x) + (1+x)^2 T(x) + x \equiv 0 \...
13
votes
2
answers
803
views
Two interpretations of a sequence: an opportunity for combinatorics
The sequence that is addressed here is resourced from the most useful site OEIS, listed as A014153, with a generating function
$$\frac1{(1-x)^2}\prod_{k=1}^{\infty}\frac1{1-x^k}.$$
In particular, look ...
13
votes
1
answer
601
views
Congruences for "colored partitions" a la Ramanujan
Let $t\in\Bbb{N}$ and consider the sequences $p_t(n)$ defined by
$$\sum_{n\geq0}p_t(n)x^n=\prod_{i\geq1}\frac1{(1-x^i)^t}=(x;x)_{\infty}^{-t}.$$
The numbers $p_t(n)$ can be regarded as enumerating ...
12
votes
2
answers
1k
views
Short research articles
I am a masters student. I am interested in short articles which have counter examples and very few references. I want to write a short and interesting article.
For example; One of the best known ...
12
votes
1
answer
406
views
Looking for a "clever" argument for a $q$-series identity
Consider the below $q$-series identity. One of the things I like about this expansion is how nicely the difference on the left hand side factors to the right hand side of the equation.
$$\prod_{k\geq1}...
12
votes
1
answer
307
views
Partition of [3n] into summoids
Let $ [n] $ be the set $ \{1,2,\ldots n\}$.
A summoid is a subset $ A \subset [n] $ of the form $ \{a,b,a+b\} $ (you can choose a better name, if it doesn't exist already).
Now, I developed by ...
12
votes
2
answers
764
views
Minimal possible cardinality of a $(a_1, ..., a_k)$-distributable multiset
Suppose we have a multiset $M$ of positive rational numbers. Sum of $M$ equals $1$. We'll call this multiset $n$-distributable for some $n\in \mathbb{N}$, if there exists a partition $M_1 \sqcup ... \...
12
votes
1
answer
238
views
Number of planes generated by integer vectors
For fixed dimension $d$ and large $R$ consider all non-zero integer vectors in the ball $B(0,R)\subset \mathbb{R} ^d$ of radius $R$ centered at the origin. The number of such vectors grows as $c_d\...
11
votes
2
answers
826
views
Sums of subsets of $\mathbb{Z}/n\mathbb{Z}$
I have encountered a problem that I suspect has been thoroughly studied but I have not been able to find references. Can anyone point me to a published reference dealing with this or a closely related ...
11
votes
0
answers
290
views
Color your partitions by parity
Let $a_c(n)$ be the number of ways to partition a positive integer $n$ where each even part comes in $c$ colors. Then, we can supply the generating function
$$\sum_{n\geq0}a_c(n)q^n=\prod_{k\geq1}\...
11
votes
0
answers
282
views
Reference request: a combinatoric result [closed]
When I tried to construct a counterexample in my research, I encountered the following result, which should be true.
Let $m=m(n)$ be a function that grows faster than $\sqrt n$, so $m(n) = \omega(\...
10
votes
1
answer
547
views
what is the status of this problem? an equivalent formulation?
R. Guy, Unsolved problems in number theory, 3rd edition, Springer, 2004.
In this book, on page 167-168, Problem C5, Sums determining members of a set, discusses a question Leo Moser asked: suppose $X\...
10
votes
2
answers
962
views
Surveys of the items of Erdős' "toolbox"
Could you point out some survey papers and monographs that highlight the kernel of tricks, techniques, and tools that Paul Erdős employed the most in his research work (in particular in graph theory, ...
10
votes
0
answers
287
views
Coefficients of polynomials vs trigonometric product
Let's consider the family of sequences of coefficients in the expansion
$$\prod_{i=0}^{n-1}(1+x^{3^i}+x^{3^{i+1}})=\sum_{k\geq0}a_n(k)\, x^k.$$
Remark. Evidently, the RHS is a finite sum.
Here is a ...
9
votes
2
answers
1k
views
Extracting constant terms: is there a direct way?
$\DeclareMathOperator\CT{CT}$
Let $\CT_t(f(t))$ denote the constant term of the Laurent polynomial of $f(t)$.
Define the two functions $F(x_1,\dots,x_n)$ and $G(y)$ by
$$F:=\prod_{i=1}^nx_i^{-1}(1-x_i)...
9
votes
1
answer
430
views
$2$-adic valuations: a tale of two $q$-series
Let $\nu_p(n)$ denote the $p$-adic valuation of $n$, i.e. the highest power of $p$ dividing $n$.
Consider the following two $q$-series formed by infinite products
$$\prod_{n\geq1}\left(\frac{1+q^n}{1-...
9
votes
1
answer
317
views
Counting monomials in cyclotomic polynomials
Let $\Phi_n(x)$ denote the $n$-th cyclotomic polynomial. There are numerous properties and utilities of these polynomials. My interest is more basic and in the spirit of
Tewodros Amdeberhan and ...
9
votes
1
answer
472
views
Products of Catalan numbers
Let $c(n)=\frac{1}{n+1}\binom{2n}{n}$ be the Catalan number. It seems that a product $\prod_{n\in I} c(n)$, where $I\subset\mathbb N_{>1}$, is never a Catalan number. Is this a (known) fact?
9
votes
1
answer
318
views
A weak form of the Erdős-Turán conjecture
This question is motivated by the answer of Gowers to the question Erdos Conjecture on arithmetic progressions.
Question. (1)-Suppose $A \subset \mathbb{N}$ is such that
Lim$_n$ $log(n) \cdot |A \...
9
votes
0
answers
358
views
Being even or odd in the product expansion $\prod(1+x^k+x^{k+1})$
Consider the generating function of "partitions with distinct parts"
$$\sum_nQ(n)x^n=\prod_k(1+x^k).$$
It's known that
$$\left[\prod_k(1+x^k)\right] \mod 2=\prod_m(1-x^m)=\sum_{j\in\mathbb{Z}...
8
votes
1
answer
671
views
Infinite series and sum of two squares
Consider the following infinite sequence $a(n)$ generated by
$$\sum_{n\geq0} a(n)q^n
=\frac{\sum_{k\geq0}F(2k+1)q^{\binom{k+1}2}}{\sum_{k\geq0} q^{\binom{k+1}2}}$$
where the $F(2k+1)$ are the odd ...
8
votes
2
answers
395
views
De Bruijn's sequence is odd iff $n=2^m-1$: Part I
Among the families of sequences studied by Nicolaas de Bruijn (Asymptotic Methods in Analysis, 1958), let's focus on the (modified)
$$\hat{S}(4,n)=\frac1{n+1}\sum_{k=0}^{2n}(-1)^{n+k}\binom{2n}k^4.$$
...
8
votes
2
answers
512
views
The average of reciprocal binomials
This question is motivated by the MO problem here. Perhaps it is not that difficult.
Question. Here is an cute formula.
$$\frac1n\sum_{k=0}^{n-1}\frac1{\binom{n-1}k}=\sum_{k=1}^n\frac1{k2^{n-k}}...
8
votes
1
answer
728
views
Criteria for ghost-Witt vectors: looking for history and references
I am looking for references (both of the readable and of the historical kind!) for the following result (which I formulate in one of its least general forms, so as not to complicate the discussion). I ...
8
votes
1
answer
571
views
Subsets of [1..N] with no three-term arithmetic progressions and no large gaps
Let S be a subset of [1..N] containing no three-term arithmetic progression, and let h(S) be the size of the largest gap between two consecutive elements of S. By Roth's theorem, h(S) has to grow ...
7
votes
3
answers
933
views
In search of an alternative proof of a series expansion for $\log 2$
We all know the series expansion
$$\log 2=\sum_{n=1}^{\infty}\frac{(-1)^{n-1}}n. \tag1$$
I also am able to use the method of Wilf-Zeilberger to the effect that
$$\log 2=3\sum_{n=1}^{\infty}\frac{(-1)^{...
7
votes
1
answer
573
views
Sum of squares and partitions
This is an off-shot from my previous post on MO.
Given an integer partition $\lambda=(\lambda_1,\dots,\lambda_{\ell(\lambda)})$ of $n$, denote $\ell(\lambda)$ to be the length of $\lambda$.
Let $r_2(...
7
votes
3
answers
550
views
Minkowski's theorem for non-0-symmetric sets
Let $\Lambda \subseteq \mathbb{R}^n$ be a full-rank lattice, i.e. $\Lambda = A \mathbb{Z}^n$ for some $A \in \mathrm{GL}_n (\mathbb{R})$, and let $C \subseteq \mathbb{R}^n$ be a $0$-symmetric convex ...
7
votes
1
answer
474
views
Fibonacci embedded in Catalan?
Given a partition $\lambda$ and its Young diagram $\pmb{Y}_{\lambda}$, we say $\lambda$ is a $(t,s)$-core partition provided that neither $t$ nor $s$ is a hook length in $\pmb{Y}_{\lambda}$. We now ...
7
votes
2
answers
1k
views
When is a sequence the sum of two Beatty sequences?
In other words, given a sequence $(s_n)$, how can we tell if there exist irrationals $u>1$ and $v>1$ such that
$$s_n = \lfloor un\rfloor + \lfloor vn\rfloor$$
for every positive integer $n$?
...
7
votes
2
answers
785
views
Inverse map for partition transform
Let $(a_n)$, $n\in\mathbb{N}$, be a sequence of complex numbers, then formally one has
(1)
$$\prod_{1}^{\infty}\left(1-a_nx^n\right)^{-1}=1+\sum_{1}^{\infty}\left(\sum_{j_1+2j_2+\cdots +nj_n=n}a_1^{...
7
votes
0
answers
174
views
A diagonal generating function for Fibonacci: Part II
In my earlier MO question, I mentioned although we have for the Fibonacci numbers that
$$F_n=[x^n]\left(\frac1{1-x-x^2}\right),$$
is there a function $F(x)$ such that $F_n=[x^n]\left(F(x)\right)^n$?
...
6
votes
2
answers
1k
views
Products and sum of cubes in Fibonacci
Consider the familiar sequence of Fibonacci numbers: $F_0=0, F_1=1, F_n=F_{n-1}+F_{n-2}$.
Although it is rather easy to furnish an algebraic verification of the below identity, I wish to see a ...
6
votes
2
answers
755
views
Prove positivity of a binomial sum
Some problems appear easy on the face of it, but perhaps they are not. Here is an instance of a certain calculation which is slightly reformulated from its original encounter in a current work. I have ...
6
votes
3
answers
432
views
is this a familiar gen. fn. for partitions?
The $2$-adic valuation of $n\in\mathbb{N}$, denoted $\nu(n)$, is the largest power $t$ such that $2^t$ divides $n$. The number of integer partitions of $n$, denoted by $p(n)$, has generating function
...
6
votes
2
answers
547
views
2-adic valuation of a certain binomial sum
Consider the sequence (of rational numbers) given by
$$a_n=\sum_{k=1}^n\binom{n}k\frac{k}{n+k}.$$
Let $s(n)$ be the sum of binary digits of $n$, i.e. the total number of $1$'s.
QUESTION. Is it true ...
6
votes
2
answers
366
views
Provoking involutions further
Let $\mathfrak{S}_n$ denote the permutation group, and $I_0(n)=\sum_{j\geq0}\binom{n}{2j}\frac{(2j)!}{2^jj!}$ stand for involutions see A000085 for more interpretations. There is also these numbers $...