Related papers: Reconstructing directed graphs from generalised ga…
An arbitrary Leibniz algebra can be embedded in a differential graded Lie algebra via the derived bracket construction. Such an embedding is called a derived bracket representation. We will construct the universal version of the derived…
We give a construction of an affine Hecke algebra associated to any Coxeter group acting on an abelian variety by reflections; in the case of an affine Weyl group, the result is an elliptic analogue of the usual double affine Hecke algebra.…
Given an infinite, compact, monothetic group $G$ we study decompositions and structure of unbounded derivations in a crossed product C$^*$-algebra $C(G)\rtimes\Z$ obtained from a translation on $G$ by a generator of a dense cyclic subgroup.…
To a higher rank directed graph $(\Lambda, d)$, in the sense of Kumjian and Pask, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed. We introduce methods for the classification of these…
A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that $3$-regular graphs are $2$-reconstructible.
We consider the following graph reconstruction problem: given an unweighted connected graph $G = (V,E)$ with visible vertex set $V$ and an oracle which takes two vertices $u,v \in V$ and returns the shortest path distance between $u$ and…
Using the equivalence between Scherk-Schwarz reductions and twisted tori compactifications, we discuss the effective theories obtained by this procedure from M-theory and N =4 type II orientifold constructions with Neveu-Schwarz and…
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the…
Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand, a profinite topological graph is built as the inverse…
We show a one-to-one correspondence between Toeplitz arrays over residually finite topological groups and model sets obtained via specific cut and project schemes, built from the odometer associated to the Toeplitz array. As an application,…
We analyze directed, unweighted graphs obtained from $x_i\in \mathbb{R}^d$ by connecting vertex $i$ to $j$ iff $|x_i - x_j| < \epsilon(x_i)$. Examples of such graphs include $k$-nearest neighbor graphs, where $\epsilon(x_i)$ varies from…
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…
A procedure is described to construct generalised Scherk-Schwarz uplifts of gauged supergravities. The internal manifold, fluxes, and consistent truncation Ansatz are all derived from the embedding tensor of the lower-dimensional theory. We…
We study self-similar groupoid actions on arbitrary directed graphs together with $\mathbb{T}$-valued twists that exhaust the second cohomology group of the associated Zappa-Sz\'ep product category. We define and analyse the associated…
Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
Universal Drinfeld twists are inner automorphisms which relate the coproduct of a quantum enveloping algebra to the coproduct of the undeformed enveloping algebra. Even though they govern the deformation theory of classical symmetries and…
How efficiently can we find an unknown graph using distance queries between its vertices? We assume that the unknown graph is connected, unweighted, and has bounded degree. The goal is to find every edge in the graph. This problem admits a…
We consider the problem of reconstructing an undirected graph $G$ on $n$ vertices given multiple random noisy subgraphs or "traces". Specifically, a trace is generated by sampling each vertex with probability $p_v$, then taking the…
Many degree sequences can only be realised in graphs that contain a `ds-completable card', defined as a vertex-deleted subgraph in which the erstwhile neighbours of the deleted vertex can be identified from their degrees, if one knows the…