Related papers: Suppressing nonrevisiting paths
Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.
An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.
The problem at the heart of this tutorial consists in modeling the path choice behavior of network users. This problem has been extensively studied in transportation science, where it is known as the route choice problem. In this…
We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…
In this short note we present a simple counterexample to a nonlinear version of the Krein-Rutman theorem reported in [Nonlinear Anal. 11 (2007), 3084-3090]. Correct versions of this theorem, and related results for superadditive maps are…
New cases of the multiplicity conjecture are considered.
In this short note we report on results on a computational search for a counterexample to the strong coincidence conjecture. In particular, we discuss the method used so that further searches can be conducted.
We prove that a homeomorphism of the torus homotopic to the identity whose rotation set is reduced to a single totally irrational vector is chain-recurrent. In fact, we show that pseudo-orbits can be chosen with a small number of jumps, in…
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…
In this work we tried to prove the lonely runner conjecture also known as the view obstruction problem.
In this short note, we expose some of the works on Serre intersection multiplicity conjecture. I provide a proof of the vanishing of Serre intersection multiplicity in non-proper intersection over a regular ring based on the intersection…
Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…
For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…
We extend the Lee-Schiffler Dyck path model to give a proof of the Kontsevich non-commutative cluster positivity conjecture with unequal parameters.
We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises the notion of simpliciality best known in the context of…
We prove the Forking Path Conjecture for all but one element in the symmetric group $S_4$. Two specific paths in the rex graph of that element give a counterexample for the conjecture. We propose a refined conjecture for the longest element…
The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z^d}$ which tiles that lattice by translations, in fact tiles periodically. We announce here a disproof of this conjecture for sufficiently large $d$, which…
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…
We present a simple biophysical example that invalidates the main conclusion of "Nat. Commun. 10, 3542 (2019)". Moreover, we explain that systems with one or more hidden states between at least one pair of observed states that give rise to…