相关论文: Left-cut-percolation and induced-Sidorenko bigraph…

We show that every sufficiently large r-regular digraph G which has linear degree and is a robust outexpander has an approximate decomposition into edge-disjoint Hamilton cycles, i.e. G contains a set of r-o(r) edge-disjoint Hamilton…

We study Lie bialgebra structures on \emph{flat metric Lie algebras}, that is, Lie algebras $(\mathfrak{g},\langle\cdot,\cdot\rangle)$ whose associated left-invariant Riemannian metric on the simply connected Lie group $G$ has zero…

We introduce in this paper the contractions $\mathfrak{G}_c$ of $n$-Lie (or Filippov) algebras $\mathfrak{G}$ and show that they have a semidirect structure as their $n=2$ Lie algebra counterparts. As an example, we compute the non-trivial…

Very weak left/right asymmetry in reflection and transmission is offered by a layer of a topological insulator on top of a layer of an anisotropic dielectric material, but it can be enhanced very significantly by using a periodic multilayer…

Even with the advent of more sophisticated, data-hungry methods, boosted decision trees remain extraordinarily successful for fast rigid object detection, achieving top accuracy on numerous datasets. While effective, most boosted detectors…

The pseudoforest version of the Strong Nine Dragon Tree Conjecture states that if a graph $G$ has maximum average degree $\text{mad}(G) = 2 \max_{H \subseteq G} \frac{e(G)}{v(G)}$ at most $2(k + \frac{d}{k+d+1})$, then it has a…

The information contained in hierarchical topology, intrinsic to many networks, is currently underutilised. A novel architecture is explored which exploits this information through a multiscale decomposition. A dendrogram is produced by a…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

Let $G=(V,E)$ be a bipartite graph embedded in a plane (or $n$-holed torus). Two subgraphs of $G$ differ by a {\it $Z$-transformation} if their symmetric difference consists of the boundary edges of a single face---and if each subgraph…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi shows that every large $n$-vertex graph with minimum degree at least $(1/2+\gamma)n$ contains all spanning trees of bounded degree. We generalised this result to loose spanning…

We derive explicit formulas for lambda-brackets of the affine classical W-algebras attached to the minimal and short nilpotent elements of any simple Lie algebra g. This is used to compute explicitly the first non-trivial PDE of the…

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.…

A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low…

This paper studies graphs that have two tree decompositions with the property that every bag from the first decomposition has a bounded-size intersection with every bag from the second decomposition. We show that every graph in each of the…

This is a companion paper to the paper "Hyperstability in the Erdos-Sos Conjecture". In that paper the following rough structure theorem was proved for graphs G containing no copy of a bounded degree tree T: from any such G, one can delete…

Metal objects pose a significant challenge in cone-beam computed tomography, as their strong and energy-dependent X-ray attenuation leads to inconsistent projections and severe streaking and shading artifacts in reconstructed images. These…

Let $G$ be a graph, $S \subseteq V(G)$ be a vertex set in $G$ and $r$ be a positive integer. The distance $r$-independence number of $S$ is the size of the largest subset $I \subseteq S$ such that no pair $u$, $v$ of vertices in $I$ have a…

We consider sequences of graphs and define various notions of convergence related to these sequences: ``left convergence'' defined in terms of the densities of homomorphisms from small graphs into the graphs of the sequence, and ``right…