Skip to content

Problems · Vela Mathematics Program

Narrowed tonot formalized ×source:erdos-problems ×Clear all

Problem ledger

613 problems · 12/13NumberSourcesGraph view
declared independenterdos:1127
Erdős problem 1127
geometrydistancesset theoryN/A
declared provederdos:1129
Erdős problem 1129
analysispolynomialsN/A2 sources
declared provederdos:1130
Erdős problem 1130
analysispolynomialsN/A2 sources
declared openerdos:1131
Erdős problem 1131
analysispolynomialsN/A2 sources
declared openerdos:1132
Erdős problem 1132
analysispolynomialsN/A2 sources
declared disproved (Lean) · £10erdos:1134
Erdős problem 1134
number theoryA1856613 sources
declared disprovederdos:1140
Erdős problem 1140
number theorypossible
declared openerdos:1143
Erdős problem 1143
number theoryprimesN/A2 sources
declared openerdos:1144
Erdős problem 1144
number theoryprobabilityN/A
declared disprovederdos:1147
Erdős problem 1147
irrationaladditive basisN/A
declared provederdos:1149
Erdős problem 1149
number theoryN/A
declared openerdos:1151
Let Lnf\mathcal{L}^nf be the Lagrange interpolation polynomials of a continuous ff on the Chebyshev nodes. Prove that, for any closed A⊆[−1,1]A\subseteq [-1,1], there exists a continuous function ff such that AA is the set of limit points of Lnf(x)\mathcal{L}^nf(x).
analysispolynomialsN/A3 sources
declared openerdos:1152
Erdős problem 1152
analysispolynomialsN/A
declared provederdos:1153
Erdős problem 1153
analysispolynomialsN/A3 sources
declared not disprovableerdos:1154
Erdős problem 1154
analysisN/A
declared openerdos:1155
Erdős problem 1155
graph theoryN/A
declared openerdos:1156
Erdős problem 1156
graph theorychromatic numberN/A
declared openerdos:1157
Erdős problem 1157
hypergraphsturan numberpossible
declared openerdos:1158
Erdős problem 1158
hypergraphsturan numberpossible
declared openerdos:1159
Erdős problem 1159
combinatoricsN/A
declared openerdos:1160
Erdős problem 1160
group theoryA000001
declared solvederdos:1161
Erdős problem 1161
group theorypossible
declared openerdos:1162
Erdős problem 1162
group theorypossible
declared openerdos:1163
Erdős problem 1163
group theoryN/A
declared provederdos:1164
Erdős problem 1164
probabilityN/A
declared solvederdos:1165
Erdős problem 1165
probabilityN/A
declared provederdos:1166
Erdős problem 1166
probabilitypossible
declared openerdos:1168
Erdős problem 1168
set theoryramsey theoryN/A
declared not disprovableerdos:1169
Erdős problem 1169
set theoryramsey theoryN/A
declared openerdos:1170
Erdős problem 1170
set theoryramsey theoryN/A
declared openerdos:1171
Erdős problem 1171
set theoryramsey theoryN/A
declared openerdos:1172
Erdős problem 1172
set theoryramsey theoryN/A
declared openerdos:1173
Erdős problem 1173
set theorycombinatoricsN/A
declared not disprovableerdos:1174
Erdős problem 1174
set theoryramsey theoryN/A
declared openerdos:1177
For a finite forbidden triple system GG, what exact uncountable chromatic cardinalities occur among GG-free triple systems, and how do those spectra interact? The revised manuscript answers the three exact-cardinal questions and claims a complete spectrum dichotomy.
set theorychromatic numberhypergraphsN/A3 sources
declared openerdos:1178
Erdős problem 1178
graph theoryhypergraphsN/A
declared provederdos:1179
Erdős problem 1179
additive combinatoricsprobabilityN/A
declared provederdos:1180
Erdős problem 1180
number theoryN/A
declared openerdos:1181
Erdős problem 1181
number theorypossible
declared openerdos:1182
Erdős problem 1182
graph theoryramsey theorypossible
declared openerdos:1183
Erdős problem 1183
combinatoricsramsey theorypossible2 sources
declared openerdos:1184
Erdős problem 1184
number theoryprimespossible
declared solvederdos:1185
Erdős problem 1185
additive combinatoricsarithmetic progressionsN/A
declared openerdos:1186
What is the minimum asymptotic density δk\delta_k of monochromatic kk-term arithmetic progressions in every two-colouring of {1,…,n}\{1, \dots, n\}? The exact certificate gives δ3=117/2192\delta_3 = 117/2192, matching the known 548-bead colouring.
additive combinatoricsarithmetic progressionspossible2 sources
declared solvederdos:1187
Erdős problem 1187
number theoryprimesadditive combinatoricsN/A3 sources
declared openerdos:1189
For irreducible covering sets of size kk, determine their count, the possible largest modulus, the maximal reciprocal sum, and whether divisor-set examples occur infinitely often.
number theorycovering systemspossible2 sources
declared open · $1000erdos:1191
Erdős problem 1191
additive combinatoricssidon setspossible
declared openerdos:1194
Erdős problem 1194
additive combinatoricsadditive basissidon setspossible2 sources
declared solvederdos:1195
Erdős problem 1195
number theorypossible3 sources
declared disproved (Lean)erdos:1197
Erdős problem 1197
analysisN/A5 sources

Search problems.science

Find a Problem, Result, source, or page