Related papers: Strong immersion is a well-quasi-ordering for semi…

We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as "tournaplexes", whose simplices are tournaments. In particular, given a digraph…

We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…

Building upon work of Y. Shalom we give a homological-algebra flavored definition of an induction map in group homology associated to a topological coupling. As an application we obtain estimates of the (co)homological dimension of groups G…

We study the convergence of a drift implicit scheme for one-dimensional SDEs that was considered by Alfonsi for the Cox-Ingersoll-Ross (CIR) process. Under general conditions, we obtain a strong convergence of order 1. In the CIR case,…

We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the random graph, and for expansions of the…

We give a combinatorial characterization of the group of quasiconformal homeomorphisms of a closed, oriented surface $S$ of genus at least $2$. In particular, we prove they are exactly the automorphisms of a graph of essential quasicircles…

In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…

Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…

A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.…

Kostochka and Thomason independently showed that any graph with average degree $\Omega(r\sqrt{\log r})$ contains a $K_r$ minor. In particular, any graph with chromatic number $\Omega(r\sqrt{\log r})$ contains a $K_r$ minor, a partial result…

Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the problem of the characterization of the finite sets I such that…

An out-branching $B^+_u$ (in-branching $B^-_u$) in a digraph $D$ is a connected spanning subdigraph of $D$ in which every vertex except the vertex $u$, called the root, has in-degree (out-degree) one. A {\bf good $\mathbf{(u,v)}$-pair} in…

We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…

A directed graph (digraph) $ D $ is $ k $-linked if $ |D| \geq 2k $, and for any $ 2k $ distinct vertices $ x_1, \ldots, x_k, y_1, \ldots, y_k $ of $ D $, there exist vertex-disjoint paths $ P_1, \ldots, P_k $ such that $ P_i $ is a path…

We show that if $D$ is a tournament of arbitrary size then $D$ has finite strong components after reversing a locally finite sequence of cycles. In turn, we prove that any tournament can be covered by two acyclic sets after reversing a…

WE determine the existence of exact (efficient) doubly dominating sets in three famous structures and in their complement for arbitrary graphs.

We prove that the filling order is quadratic for a large class of solvable groups and asymptotically quadratic for all Q-rank one lattices in semisimple groups of R-rank at least 3. As a byproduct of auxiliary results we give a shorter…

Let $\mathcal{V}$ be a complete discrete valuation ring of unequal characteristic with perfect residue field, $u\colon \mathcal{Z} \hookrightarrow \mathfrak{X}$ be a closed immersion of smooth, quasi-compact, separated formal schemes over…