Unanswered Questions
5,120 questions with no upvoted or accepted answers
55
votes
0
answers
3k
views
On the first sequence without triple in arithmetic progression
In this Numberphile video (from 3:36 to 7:41), Neil Sloane explains an amazing sequence:
It is the lexicographically first among the sequences of positive integers without triple in arithmetic ...
52
votes
0
answers
998
views
Class function counting solutions of equation in finite group: when is it a virtual character?
Let $w=w(x_1,\dots,x_n)$ be a word in a free group of rank $n$. Let $G$ be a finite group. Then we may define a class function $f=f_w$ of $G$ by
$$ f_w(g) = |\{ (x_1,\dots, x_n)\in G^n\mid w(x_1,\dots,...
51
votes
0
answers
2k
views
Does every triangle-free graph with maximum degree at most 6 have a 5-colouring?
A very specific case of Reed's Conjecture
Reed's $\omega$,$\Delta$, $\chi$ conjecture proposes that every graph has $\chi \leq \lceil \tfrac 12(\Delta+1+\omega)\rceil$. Here $\chi$ is the chromatic ...
45
votes
0
answers
3k
views
A = B (but not quite); 3-d arrays with multiple recurrences
Many years ago, I discovered the remarkable array (apparently originally discovered by Ramanujan)
1
1 3
2 10 15
6 40 105 105
24 196 700 1260 945
...
43
votes
0
answers
2k
views
Why are there so few quaternionic representations of simple groups?
Having spent many hours looking through the Atlas of Finite Simple Groups while in Grad school, I recall being rather intrigued by the fact that among the sporadic groups, only one (McLaughlin as I ...
41
votes
0
answers
1k
views
Is there anything to the obvious analogy between Joyal's combinatorial species and Goodwillie calculus?
Combinatorial species and calculus of functors both take the viewpoint that many interesting functors can be expanded in a kind of Taylor series. Many operations familiar from actual calculus can be ...
37
votes
0
answers
1k
views
Groups whose complex irreducible representations are finite dimensional
By a complex irreducible representation of a group $G$, I mean a simple $\mathbb CG$-module. So my representations need not be unitary and we are working in the purely algebraic setting.
It is easy ...
37
votes
0
answers
5k
views
Homology of $\mathrm{PGL}_2(F)$
Update: As mentioned below, the answer to the original question is a strong No. However, the case of $\pi_4$ remains, and actually I think that this one would follow from Suslin's conjecture on ...
36
votes
0
answers
945
views
Are there infinite versions of sporadic groups?
The classification of finite simple groups states roughly that every non-abelian finite simple group is either alternating, a group of Lie type, or a sporadic group.
For each of the groups of Lie ...
36
votes
0
answers
2k
views
3-colorings of the unit distance graph of $\Bbb R^3$
Let $\Gamma$ be the unit distance graph of $\Bbb R^3$: points $(x,y)$ form an edge if $|x,y|=1$.
Let $(A,B,C,D)$ be a unit side rhombus in the plane, with a transcendental diagonal, e.g. $A = (\alpha,...
35
votes
0
answers
949
views
Orthogonal vectors with entries from $\{-1,0,1\}$
Let $\mathbf{1}$ be the all-ones vector, and suppose $\mathbf{1}, \mathbf{v_1}, \mathbf{v_2}, \ldots, \mathbf{v_{n-1}} \in \{-1,0,1\}^n$ are mutually orthogonal non-zero vectors. Does it follow that $...
33
votes
0
answers
2k
views
Next steps on formal proof of classification of finite simple groups
While people are steaming ahead on finessing the proof of the classification of finite simple groups (CFSG), we have a formal proof in Coq of one of the first major components: the Feit-Thompson odd-...
32
votes
0
answers
2k
views
The easily bored sequence
If we want to compare the repetitiveness of two finite words, it looks reasonable, first of all, to consider more repetitive the word repeating more times one of its factors, and secondarily to ...
32
votes
0
answers
3k
views
Vertex coloring inherited from perfect matchings (motivated by quantum physics)
Added (19.01.2021): Dustin Mixon wrote a blog post about the question where he reformulated and generalized the question.
Added (25.12.2020): I made a youtube video to explain the question in detail.
...
32
votes
0
answers
1k
views
Minimal number of intersections in a convex $n$-gon?
For a convex polygon $P$, draw all the diagonals of $P$ and consider the intersection points made by those diagonals. Let $f(n)$ be the minimal number of such intersections where $P$ ranges over all ...