Related papers: On the Frame-Stewart Conjecture

In this paper, we provide sufficient conditions for a space $X$ to satisfy the Ganea conjecture for topological complexity. To achieve this, we employ two auxiliary invariants: weak topological complexity in the sense of Berstein-Hilton,…

The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ with supersingular reduction at $p \geq 5$, and $K$ be an imaginary quadratic field such that $p$ is inert in $K/\mathbb{Q}$. In this paper, we prove the analogous of the ``weak''…

We give a simplification of Belkale's geometric proof of the Horn conjecture. Our approach uses the geometry of two-step flag manifolds to explain the occurrence of the Horn inequalities in a very straightforward way. The arguments for both…

In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…

In this paper, we give a proof of the Bouchard-Klemm-Marino-Pasquetti conjecture for a framed vertex, by using the symmetrized Cut-Join Equation developed in a previous paper.

We present a fixed-parameter tractable (FPT) algorithm to find a shortest curve that encloses a set of k required objects in the plane while paying a penalty for enclosing unwanted objects. The input is a set of interior-disjoint simple…

Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are…

We propose a strengthening of the conclusion in Tur\'an's (3,4)-conjecture in terms of algebraic shifting, and show that its analogue for graphs does hold. In another direction, we generalize the Mantel-Tur\'an theorem by weakening its…

We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where…

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

Suppose one needs to change the direction of at least $\epsilon n^2$ edges of an $n$-vertex tournament $T$, in order to make it $H$-free. A standard application of the regularity method shows that in this case $T$ contains at least…

We prove the rational HK-conjecture for a large class of transformation groupoids in the case when the relevant action has torsion-free stabilizers. A revised version of the rational HK-conjecture in the case of (possibly) torsion…

In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].

The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

We first propose a generalization of the image conjecture [Z3] for the commuting differential operators related with classical orthogonal polynomials. We then show that the non-trivial case of this generalized image conjecture is equivalent…

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…

We prove a theorem that gives an easily verifiable necessary and sufficient condition for a reference frame with fixed spacelike coordinates to be nonrotating in the sense of Walker. Applications are discussed.

We consider a generalization of the classical Art Gallery Problem, where instead of a light source, the guards, called $k$-transmitters, model a wireless device with a signal that can pass through at most $k$ walls. We show it is NP-hard to…

We utilize the obstruction theory of Galewski-Matumoto-Stern to derive equivalent formulations of the Triangulation Conjecture. For example, every closed topological manifold M^n with n > 4 can be simplicially triangulated if and only if…