Related papers: Locally s-distance transitive graphs and pairwise …
Given a graph $G$ with $n$ vertices and an Abelian group $A$ of order $n$, an $A$-distance antimagic labelling of $G$ is a bijection from $V(G)$ to $A$ such that the vertices of $G$ have pairwise distinct weights, where the weight of a…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in $\mathbb{R}^2$. The geometric map of study may be analogized to the billiard map with a different reflection rule so that each…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
We show that the "grandfather graph" has the following property: it is the unique completion to a transitive graph of a large enough finite subgraph of itself.
Let $X$ be a smooth scheme over a finite field of characteristic $p$. Consider the coefficient objects of locally constant rank on $X$ in $\ell$-adic Weil cohomology: these are lisse Weil sheaves in \'etale cohomology when $\ell \neq p$,…
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…
Consider a connected manifold of dimension at least two and the group of compactly supported diffeomorphisms that are compactly supported isotopic to the identity. This group acts $n$-transitive: Any tuple of $n$ points can be moved to any…
In this note we survey recent results on automorphisms of affine algebraic varieties, infinitely transitive group actions and flexibility. We present related constructions and examples, and discuss geometric applications and open problems.
We develop a stability theory for contractive local IFSs on compact metric spaces. Unlike the classical global setting, local systems may exhibit a richer symbolic and geometric structure, including code spaces that are not of finite type…
We show that the pair given by the power set and by the "Grassmannian"(set of all subgroups) of an arbitrary group behaves very much like the pair given by a projective space and its dual projective space. More precisely, we generalize…
To any connected and simply connected nilpotent Lie group N, one can associate its group of affine transformations Aff(N). In this paper, we study simply transitive actions of a given nilpotent Lie group G on another nilpotent Lie group N,…
Dynamic networks are a complex subject. Not only do they inherit the complexity of static networks (as a particular case); they are also sensitive to definitional subtleties that are a frequent source of confusion and incomparability of…
We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with…
Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…
In this paper we introduce a local-refinement procedure to investigate stability data on an abelian category, and provide a sufficient and necessary condition for a stability data to be finest. We classify all the finest stability data for…