Related papers: Directed and irreversible path in Euclidean spaces
Given an undirected graph $G$, let us randomly orient $G$ by tossing independent (possibly biased) coins, one for each edge of $G$. Writing $a\rightarrow b$ for the event that there exists a directed path from a vertex $a$ to a vertex $b$…
We show that for any integer $k \ge 4$, every oriented graph with minimum semidegree bigger than $\frac{1}{2}(k-1+\sqrt{k-3})$ contains an antidirected path of length $k$. Consequently, every oriented graph on $n$ vertices with more than…
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 examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the…
In [1], we proved the existence of solutions to reflected rough differential equations based on an idea of Euler approximation of the solutions which is due to Davie [6]. In this paper, we prove the existence theorem under weaker…
The Dirichlet p-Laplacian in tubes of arbitrary cross-section along infinite curves in Euclidean spaces of arbitrary dimension is investigated. First, it is shown that the gap between the lowest point of the generalised spectrum and the…
In this paper, we consider the problem of reconstructing a directed graph using path queries. In this query model of learning, a graph is hidden from the learner, and the learner can access information about it with path queries. For a…
We present the first comprehensive analysis of temporal settings for directed temporal graphs, fully resolving their hierarchy with respect to support, reachability, and induced-reachability equivalence. These notions, introduced by…
We study a class of directed random graphs. In these graphs, the interval [0,x] is the vertex set, and from each y\in [0,x], directed links are drawn to points in the interval (y,x] which are chosen uniformly with density one. We analyze…
It is proven that the only incompressible Euler fluid flows with fixed straight streamlines are those generated by the normal lines to a round sphere, a circular cylinder or a flat plane, the fluid flow being that of a point source, a line…
Thomass\'{e} conjectured the following strengthening of the well-known Caccetta-Haggkvist Conjecture: any digraph with minimum out-degree $\delta$ and girth $g$ contains a directed path of length $\delta(g-1)$. Bai and Manoussakis…
We prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…
We give an elementary proof of the theorem which states that a finite unramified algebra over a discrete field is tracically \'etale. -- Nous donnons une d\'emonstration \'el\'ementaire du th\'eor\`eme selon lequel toute alg\`ebre nette sur…
This paper considers a random structure on the lattice $\mathbb{Z}^2$ of the following kind. To each edge $e$ a random variable $X_e$ is assigned, together with a random sign $Y_e \in \{-1,+1\}$. For an infinite self-avoiding path on…
We introduce the notion of $P_{\lambda}$ points, which canonically parametrize points on the Euler line. This allows us to show that the Euler line of any $d$-dimensional inscribed polygon in Euclidean space arises from the Euler lines of…
The Dirichlet Laplacian in curved tubes of arbitrary cross-section rotating with respect to the Tang frame along infinite curves in Euclidean spaces of arbitrary dimension is investigated. If the reference curve is not straight and its…
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…
Answering a question of Benjamini, we present an isometry-invariant random partition of the Euclidean space $\mathbb{R}^d$, $d\geq 3$, into infinite connected indistinguishable pieces, such that the adjacency graph defined on the pieces is…
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…