Related papers: A user's guide to the topological Tverberg conject…
We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius $R$ such that, for any pairwise disjoint $k$-element subsets…
The $W_v$-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the…
In 1975 Lov\'{a}sz conjectured that every $r$-partite, $r$-uniform hypergraph contains $r-1$ vertices whose deletion reduces the matching number. If true, this statement would imply a well-known conjecture of Ryser from 1971, which states…
Eggert's Conjecture says that if R is a finite-dimensional nilpotent commutative algebra over a perfect field F of characteristic p, and R^{(p)} is the image of the p-th power map on R, then dim_F R \geq p dim_F R^{(p)}. Whether this very…
Ryser's Conjecture states that for any $r$-partite $r$-uniform hypergraph, the vertex cover number is at most $r{-}1$ times the matching number. This conjecture is only known to be true for $r\leq 3$ in general and for $r\leq 5$ if the…
A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been…
A well-known conjecture, often attributed to Ryser, states that the cover number of an $r$-partite $r$-uniform hypergraph is at most $r - 1$ times larger than its matching number. Despite considerable effort, particularly in the…
We prove the following generalisation of Schauder's fixed point conjecture: Let $C_1,...,C_n$ be convex subsets of a Hausdorff topological vector space. Suppose that the $C_i$ are closed in $C=C_1\cup...\cup C_n$. If $f:C\to C$ is a…
Since its formulation, Tur\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\mathcal{F}$ on $n$ vertices in which any five…
The Monodromy Conjecture asserts that if c is a pole of the local topological zeta function of a hypersurface, then exp(2\pi i c) is an eigenvalue of the monodromy on the cohomology of the Milnor fiber. A stronger version of the conjecture…
In this paper, we first show that the Jacobian Conjecture is true for non-homogeneous power linear mappings under some conditions. Secondly, we prove an equivalent statement about the Jacobian Conjecture in dimension $r\geq 1$ and give some…
In this paper, we study the well-know $g$-conjecture for rational homology spheres in a topological way. To do this, we construct a class of topological spaces with torus actions, which can be viewed as topological generalizations of toric…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We consider three graphs, $G_{7,3}$, $G_{7,4}$, and $G_{7,6}$, related to Keller's conjecture in dimension 7. The conjecture is false for this dimension if and only if at least one of the graphs contains a clique of size $2^7 = 128$. We…
We prove a criterion for continuity of bilinear maps on countable direct sums of topological vector spaces. As a first application, we get a new proof for the fact (due to Hirai et al. 2001) that the map taking a pair of test functions on…
An old and well-known conjecture of Frankl and F\"{u}redi states that the Lagrangian of an $r$-uniform hypergraph with $m$ edges is maximised by an initial segment of colex. In this paper we disprove this conjecture by finding an infinite…
Main Theorem: Spaces of r-branch point 3-cycle covers, degree n or Galois of degree n!/2 have one (resp. two) component(s) if r=n-1 (resp. r\ge n). Improves Fried-Serre on deciding when sphere covers with odd-order branching lift to…
In this paper we investigate three unsolved conjectures in geometric combinatorics, namely Falconer's distance set conjecture, the dimension of Furstenburg sets, and Erdos's ring conjecture. We formulate natural $\delta$-discretized…
We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…