Related papers: An isomorphism between branched and geometric roug…

The relation between Hamiltonicity and toughness of a graph is a long standing research problem. The paper studies the Hamiltonicity of the Cartesian product graph $G_1\square G_2$ of graphs $G_1$ and $G_2$ satisfying that $G_1$ is…

We propose a new approach to conjugation-invariant random permutations. Namely, we explain how to construct uniform permutations in given conjugacy classes from certain point processes in the plane. This enables the use of geometric tools…

Graph-structured data is central to many scientific and industrial domains, where the goal is often to optimize objectives defined over graph structures. Given the combinatorial complexity of graph spaces, such optimization problems are…

We give a soft geometric proof of the classical result due to Conn stating that a Poisson structure is linearizable around a singular point (zero) at which the isotropy Lie algebra is compact and semisimple.

The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…

The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

We prove that the path-finding problem in $\ell$-isogeny graphs and the endomorphism ring problem for supersingular elliptic curves are equivalent under reductions of polynomial expected time, assuming the generalised Riemann hypothesis.…

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

The paper deals with the problem of deciding if two finite-dimensional linear subspaces over an arbitrary field are identical up to a permutation of the coordinates. This problem is referred to as the permutation code equivalence. We show…

The (strong) isometric path complexity is a recently introduced graph invariant that captures how arbitrary isometric paths (i.e., shortest paths) of a graph can be viewed as a union of a few ``rooted" isometric paths (i.e., isometric paths…

Many isomorphism problems for tensors, groups, algebras, and polynomials were recently shown to be equivalent to one another under polynomial-time reductions, prompting the introduction of the complexity class TI (Grochow & Qiao, ITCS '21;…

Let $K$ be a field. We characterise the row-finite weighted graphs $(E,w)$ such that the weighted Leavitt path algebra $L_K(E,w)$ is isomorphic to an unweighted Leavitt path algebra. Moreover, we prove that if $L_K(E,w)$ is locally finite,…

Dujmovi\'c et al. [\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or…

We analyze some local properties of sparse Erdos-Renyi graphs, where $d(n)/n$ is the edge probability. In particular we study the behavior of very short paths. For $d(n)=n^{o(1)}$ we show that $G(n,d(n)/n)$ has asymptotically almost surely…

In this paper, we show how one can view certain models in regularity structures as some form of geometric rough paths. This is performed by identifying the deformed Butcher-Connes-Kreimer Hopf algebra with a quotient of the shuffle Hopf…

We consider a rough differential equation of the form \(dY_t=\sum_i V_i(Y_t)d\boldsymbol{X}^i_t+V_0(Y_t)dt \), where \(\boldsymbol{X}_t \) is a Markovian rough path. We demonstrate that if the vector fields \((V_i)_{0\leq i\leq d} \)…

When $k|n$, the tree $\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\epsilon>0$, the binomial random graph…

This paper considers linear functions constructed on two different weighted branching processes and provides explicit bounds for their Kantorovich-Rubinstein distance in terms of couplings of their corresponding generic branching vectors.…

The aim of this work is the description of the isomorphism classes of all Leavitt path algebras coming from graphs satisfying Condition (Sing) with up to three vertices. In particular, this classification recovers the one achieved by Abrams…