# Tagged Questions

If it turns out that a problem is equivalent to a known open problem, then the open-problem tag is added. After that, the question essentially becomes, "What is known about this problem? What are some possible ways to approach this problem? What are some ways that people have tried to attack it ...

182 views

320 views

### Open problems books [closed]

As the title might indicate , I would like to look for recommendations for mathematical book that present open problems in depth with commentary. The only book of this type that I've come across is ...
258 views

93 views

### Long paths in the supercritical percolation.

I have a question on the length of the longest path, denoted by $\ell_n$, in the supercritical percolation on $[0,n]^d$, denoted by $C_n$. We know that $C_n$ has a giant component whose size is of ...
473 views

### Improving the bound $q < n\sqrt{3}$ for an odd perfect number $N = {q^k}{n^2}$ given in Eulerian form [closed]

(Note: This was cross-posted from MSE.) Let $N = {q^k}{n^2}$ be an odd perfect number given in Eulerian form (i.e., $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q, n) = 1$). Therefore, ...
151 views

### Reduction argument from a general vertex set V(G) to a prime power in Prof. Keevash's proof on the Existence of Designs

The proof flow of the paper "On the Existence of Designs" by Prof. Keevash as I understand it is the following: -- Reduction from the general case to $V = \mathbb{F}_{p^a}$ (Lemma 6.3) -- Covering ...
227 views

1k views

### Is the fixed point property for posets preserved by products?

Recall that a partially ordered set (poset) $P$ has the fixed point property (FPP) if any order preserving function $f:P\longrightarrow P$ has a fixed point. Theorem. Suppose $P$ and $Q$ are posets ...
140 views

### reduction to np hard ordering problem

I am trying to show a reduction from a problem of ordering problem to an np-hard problem that has approximation poly-time algorithm. My problem is: I have M auctions and in each auction I have N ...