Questions, not proof records

Open-problem statements, with their sources attached.

Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.

“Open” is a dated source assertion. In these pinned sources, sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.
All topics

12 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openMathOverflow · Category theory

Mathoverflow 31809

Does there exist a category that is pretriangulated but not triangulated?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Commutative algebra

Mathoverflow 507128

There exists a proper ideal I in a (commutative) total ring R of fractions that is an invertible module. If I ⊊ R is such an example, I must have infinite order in the Picard group, and R must not be Noetherian (otherwise it must be semi-local and therefore have trivial Picard group).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Several complex variables

Mathoverflow 1973

Does the 6-sphere admit a complex structure, i.e. an atlas of holomorphically compatible charts relating it to EuclideanSpace ℂ (Fin 3)?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Real functions

Mathoverflow 235893

Assume for n>1n>1, f:RnRnf:\mathbb{R}^n\to\mathbb{R}^n is a bijection, where Rn\mathbb{R}^n is equipped with the standard topology. Does the connectedness of (the induced power set map) ff imply that of f1f^{-1}?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Real functions

Mathoverflow 347178: Bounded Only

Let f:RnR,n2f : \mathbb R^n \to \mathbb R, n \geq 2 be a C1C^1 function. Does the equality supxRnf(x)=supxRnf(x+f(x))\sup_{x \in \mathbb R^n}f(x) = \sup_{x\in \mathbb R^n} f(x+\nabla f(x)) hold when both suprema are finite?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Field theory and polynomials

Mathoverflow 21003

Is there any polynomial f(x,y)Q[x,y]f(x, y) \in \mathbb{Q}[x, y] such that f:Q×QQf : \mathbb{Q} \times \mathbb{Q} \rightarrow \mathbb{Q} is a bijection?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Field theory and polynomials

Mathoverflow 339137

Let P(x),Q(x)R[x]P(x), Q(x) ∈ ℝ[x] be two monic polynomials with non-negative coefficients. If R(x)=P(x)Q(x)R(x) = P(x)Q(x) is a 0,10,1 polynomial (coefficients only from {0,1}\{0,1\}), then P(x)P(x) and Q(x)Q(x) are also 0,10, 1 polynomials.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Geometry

Mathoverflow 34145

Can a unit square be covered by rectangles of width 1 / (n + 1) and height 1 / (n + 2)?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Geometry

Mathoverflow 34145

Equivalently, can a unit square be packed with rectangles of width 1 / (n + 1) and height 1 / (n + 2)?

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Number theory

17560

If 2x2^x and 3x3^x are integers, then xx must be an integer.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openMathOverflow · Number theory

Mathoverflow 75792

Is 2n the complexity of 2^n for 0 < n?

Source checked Jul 26, 20261 pinned Lean statementInspect problem