Unanswered Questions

304
votes
0answers
14k views

A short proof for $\dim(R[T])=\dim(R)+1$?

If $R$ is a commutative ring, it is easy to prove $\dim(R[T]) \geq \dim(R)+1$. For noetherian $R$, we have equality. Every proof I'm aware of uses quite a bit of commutative algebra and non-trivial ...
179
votes
0answers
6k views

The Ring Game on $K[x,y,z]$

I recently read about the Ring Game on MathOverflow, and have been trying to determine winning strategies for each player on various rings. The game has two players and begins with a commutative ...
177
votes
1answer
6k views

Is there a 0-1 law for the theory of groups?

For each first order sentence $\phi$ in the language of groups, define : $$p_N(\phi)=\frac{\text{number of nonisomorphic groups $G$ of order} \le N\text{ such that } \phi \text{ is valid in } ...
144
votes
0answers
3k views

Does there exist a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?

Let $(X,\tau), (Y,\sigma)$ be two topological spaces. We say that a map $f: \mathcal{P}(X)\to \mathcal{P}(Y)$ between their power sets is connected if for every $S\subset X$ connected, $f(S)\subset Y$ ...
126
votes
1answer
6k views

How prove this matrix inequality $\det\left(6(A^3+B^3+C^3)+I_{n}\right)\ge 5^n\det(A^2+B^2+C^2)$?

Question: let matrices $A,B,C\in M_{n}(C)$ be Hermitian and Positive definite matrices, such that:$$A+B+C=I_{n}$$ Show that: $$\det\left(6(A^3+B^3+C^3)+I_{n}\right)\ge 5^n\det(A^2+B^2+C^2)$$ ...
114
votes
1answer
3k views

What properties of busy beaver numbers are computable?

The busy beaver function $\text{BB}(n)$ describes the maximum number of steps that an $n$-state Turing machine can execute before it halts (assuming it halts at all). It is not a computable function ...
84
votes
0answers
2k views

Generalizing $\int_{0}^{1} \frac{\arctan\sqrt{x^{2} + 2}}{\sqrt{x^{2} + 2}} \, \frac{\operatorname dx}{x^{2}+1} = \frac{5\pi^{2}}{96}$

The following integral \begin{align*} \int_{0}^{1} \frac{\arctan\sqrt{x^{2} + 2}}{\sqrt{x^{2} + 2}} \, \frac{dx}{x^{2}+1} = \frac{5\pi^{2}}{96} \tag{1} \end{align*} is called the Ahmed's integral ...
80
votes
0answers
2k views

Is there a homology theory that counts connected components of a space?

It is well-known that the generators of the zeroth singular homology group $H_0(X)$ of a space $X$ correspond to the path components of $X$. I have recently learned that for Čech homology the ...
70
votes
0answers
1k views

Geometric interpretation of the Riemann-Roch for curves

Let $X$ be a smooth projective curve of genus $g\geq2$ over an algebraically closed field $k$ and denote by $K$ a canonical divisor. I have some clues about the geometrical interpretation of the ...
67
votes
0answers
1k views

Is there a categorical definition of submetry?

(Updated to include effective epimorphism.) This question is prompted by the recent discussion of why analysts don't use category theory. It demonstrates what happens when an analyst tries to use ...
66
votes
0answers
3k views

Continuous projections in $\ell_1$ with norm $>1$

I was trying to find papers and articles about non-contractive continuous projections in $\ell_1(S)$ where $S$ is an arbitrary set. If it is not studied yet, I would like to know results for the case ...
62
votes
0answers
730 views

Solving Special Function Equations Using Lie Symmetries

The Lie group and representation theory approach to special functions, and how they solve the ODEs arising in physics is absolutely amazing. I've given an example of its power below on Bessel's ...
62
votes
0answers
2k views

Generalization of Liouville's theorem

As proposed in this answer, I wonder if the answer to following question is known. Let $E = E_0$ be the set of elementary functions. For each $i > 0$, inductively define $E_i$ to be the closure ...
62
votes
1answer
2k views

In $n>5$, topology = algebra

During the study of the surgery theory I faced following sentence: Surgery theory works best for $n > 5$, when "topology = algebra". I don't know what is the meaning of topology=algebra. ...
59
votes
0answers
2k views

Making Friends around a Circular Table

I have $n$ people seated around a circular table, initially in random order. At each step, I choose two people and switch their seats. What is the minimum number of steps required such that every ...

15 30 50 per page