Related papers: Suppressing nonrevisiting paths

In this note we point out that results on the asymptotic behaviour of an alternative iterative method are corollaries of corresponding results on the well-known Halpern iteration.

We introduce a new formulation of the axiom of dependent choice that can be viewed as an abstract termination principle, which generalises the recursive path orderings used to establish termination of rewrite systems. We consider several…

We study the convergence of distributions on finite paths of weighted digraphs, namely the family of Boltzmann distributions and the sequence of uniform distributions. Targeting applications to the convergence of distributions on paths, we…

In this paper we formulate and prove a combinatorial version of the section conjecture for finite groups acting on finite graphs. We apply this result to the study of rational points and show that finite descent is the only obstruction to…

We formulate a precise conjecture that, if true, extends the converse theorem of Hecke without requiring hypotheses on twists by Dirichlet characters or an Euler product. The main idea is to linearize the Euler product, replacing it by…

We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…

We study probabilistically informative (weak) versions of transitivity, by using suitable definitions of defaults and negated defaults, in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults…

In this article, we give a positive answer to the cycle double cover conjecture. Ones who are mainly interesting in the proof of the conjecture can only read Sections 2 and 4.

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

We resolve a 25 year old problem by showing that The Paving Conjecture is equivalent to The Paving Conjecture for Triangular Matrices.

We propose two new alternating direction methods to solve "fully" nonsmooth constrained convex problems. Our algorithms have the best known worst-case iteration-complexity guarantee under mild assumptions for both the objective residual and…

Directional replicability addresses the question of whether an effect studied across $n$ independent studies is present with the same direction in at least $r$ of them, for $r \geq 2$. When the expected direction of the effect is not…

In this paper, we give an alternative proof of the fact that, when compounding a nonnegative probability distribution, convex ordering between the distributions of the number of summands implies convex ordering between the resulting…

We prove the famous Faber intersection number conjecture and other more general results by using a recursion formula of $n$-point functions for intersection numbers on moduli spaces of curves. We also present some vanishing properties of…

An {\sf oriented perfect path double cover} ($\rm OPPDC$) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each edge of $G_s$ lies in exactly one of the paths and each vertex of $G$…

In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…

In this paper we proof that any cactus graph satisfies graph complement conjecture by finding a orthogonal representation of its complement in $\mathbb{R}^5$.

In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path…

In this note we give two examples of partially commutative subgroups of partially commutative groups. Our examples are counterexamples to the Extension Graph Conjecture and to the Weakly Chordal Conjecture of Kim and Koberda, \cite{KK}. On…

Baxter permutations originally arose in studying common fixed points of two commuting continuous functions. In 2015, Dilks proposed a conjectured bijection between Baxter permutations and non-intersecting triples of lattice paths in terms…