MathOverflow

In classical large inductive dimension (Ind), a space X has Ind(X) ≤ n if every pair of disjoint closed sets can be separated by a closed set C with Ind(∂C) ≤ n−1. This already recurses on the boundary of the separator.I propose a closely related but...

If $H=(V,E)$ is a hypergraph, we say that $T\subseteq V$ is a subspace with of $H$ if whenever $a,b\in T$ with $a\neq b$, then $e\subseteq T$ for every $e\in E$ having $\{a,b\}\subseteq e$. By $\newcommand{\S}{\text{Sub}}\S(H)$ we mean the collection...

There are $n$ finite queues, each one of length drawn independently from a known probability distribution $D$. You can't see how long they are. Your access to the queues is restricted to queries of the form POP($i$), which either gives you the element...

I was wondering what are some repositories for math preprints that do not impose a particular language X as the primary language. I mean, where perhaps a summary in language X is required, but where they do not require a full version in language X as...