Related papers: Suppressing nonrevisiting paths
We study inverse limit spaces of tent maps, and the Ingram Conjecture, which states that the inverse limit spaces of tent maps with different slopes are non-homeomorphic. When the tent map is restricted to its core, so there is no ray…
We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…
We provide new sufficient conditions under which Ryser's conjecture holds.
Recent proposal for counterfactual computation [Hosten et al., Nature, 439, 949 (2006)] is analyzed. It is argued that the method does not provide counterfactual computation for all possible outcomes. The explanation involves a novel…
In the preceding Comment it is alleged that a "hidden loophole" in the proof of Hara's theorem has been found, which purportedly invalidates the conclusions of the paper commented upon. I show that there is no such loophole in the…
A formula concerning counting of paths was conjectured by Herzog and Conca few years ago. Recently, Krattenthaler and Prohaska gave an affirmative answer to this conjecture. In this paper we generalize this formula.
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
It is known that the paving conjecture fails for 2-paving projections with constant diagonal 1/2. But the proofs of this fact are existence proofs. We will give concrete examples of these projections and projections with constant diagonal…
Some easily verifiable sufficient conditions for the nonexistence of iterative roots for multifunctions on arbitrary nonempty sets are presented. Typically if the graph of the multifunction has a distinguished point with a relatively large…
In this article, we give two different proofs of why the Collatz Conjecture is false.
For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…
We propose a pedestrian review of the noncommutative standard model in its present state.
In [2] the author claims to provide a counterexample to a result in a recent paper [1]. In this note, we prove that the details of his example is false and this example is compatible with our result in [1] and so is not a countreexample.
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…
In this paper, we survey some recent results on the Artin conjecture and discuss some aspects for the Artin conjecture.
We review a combinatoric approach to the Hodge Conjecture for Fermat Varieties and announce new cases where the conjecture is true.
We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…