Related papers: Suppressing nonrevisiting paths
In this extended abstract, we carefully examine a purported counterexample to a postulate of iterated belief revision. We suggest that the example is better seen as a failure to apply the theory of belief revision in sufficient detail. The…
In this paper a new conjecture equivalent to Collatz conjecture is presented. In particural, showing that (all) the solution(s) of newly introduced iterative functional equation(s) have a given property is equivalent to prove Collatz…
We report in this survey some new results concerning noncommutative Chern characters: construction and the cases when they are exactly computed. The major result indicates some clear relation of these noncommutative objects and their…
After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method's limitations.
This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.
We isolate conditions on the relative size of sets of natural numbers $A,B$ that guarantee a nonempty intersection $\Delta(A)\cap\Delta(B)\ne\emptyset$ of the corresponding sets of distances. Such conditions apply to a large class of zero…
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…
We study theoretically two coupled periodically-curved optical waveguides with Kerr nonlinearity. We find that the tunneling between the waveguides can be suppressed in a wide range of parameters due to nonlinearity. Such suppression of…
We show that there is a point on a computable arc that does not belong to any computable rectifiable curve. We also show that there is a point on a computable rectifiable curve with computable length that does not belong to any computable…
Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and $(321,3\bar{1}42)$-avoiding derangements. We also present a combinatorial proof of a recurrence relation for the…
We provide a proof of Pisot conjecture, a classification problem in Ergodic Theory on recurrent sequences generated by irreducible Pisot substitutions.
We prove the filling area conjecture in the hyperelliptic case. In particular, we establish the conjecture for all genus 1 fillings of the circle, extending P. Pu's result in genus 0. We translate the problem into a question about closed…
We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…
We use a simple geometric argument and small cancellation properties of link groups to prove that alternating links are non-trivial. This proof uses only classic results in topology and combinatorial group theory.
While machine learning models are usually assumed to always output a prediction, there also exist extensions in the form of reject options which allow the model to reject inputs where only a prediction with an unacceptably low certainty…
The problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to…
The alternative to the replica procedure, which we call the noncommutative replica procedure, is discussed. The detailed comparison with the standard replica procedure is performed.
A short, fairly self-contained proof is given of the Poincar\'e Conjecture. In the previous version there was an error on Page 8. This gap has now been filled.
In recent preprints, Cigler considered certain Hankel determinants of convoluted Catalan numbers and conjectured identities for these determinants. In this note, we shall give a bijective proof of Cigler's Conjecture by interpreting…
We address the conjectures left by the recent article by Ferreira et al. titled ``Commuting maps and identities with inverses on alternative division rings.'' We also present an example showing the necessity of the conditions of the results…