Related papers: A Note on "Regularity lemma for distal structures"
This article lays the foundations for an analogue of geometric group theory that studies actions on graphs by right quasigroups, including racks and quandles. We study markings of graphs that realize racks, and we introduce (di)graph…
We provide complete structural theorems for the so-called quasiasymptotic behavior of non-quasianalytic ultradistributions. As an application of these results, we obtain descriptions of quasiasymptotic properties of regularizations at the…
We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed…
In this paper we establish a new characterisation of star-regular categories, using a property of internal reflexive graphs, which is suggested by a recent result due to O. Ngaha Ngaha and the first author. We show that this property is, in…
It is shown how regular model sets can be characterized in terms of regularity properties of their associated dynamical systems. The proof proceeds in two steps. First, we characterize regular model sets in terms of a certain map $\beta$…
We prove an analytic version of the stable graph regularity lemma from \cite{MaSh}, which applies to stable functions $f\colon V\times W\to [0,1]$. Our methods involve continuous model theory and, in particular, results on the structure of…
We find closed form formulas for Kemeny's constant and its relationship with two Kirchhoffian indices for some composite graphs that use as basic building block a graph endowed with one of several symmetry properties.
We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ \alpha\in\omega+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $…
This paper investigates regularity properties of two non-negative sparsity sets: non-negative sparse vectors, and low-rank positive semi-definite matrices. Novel formulae for their Mordukhovich normal cones are given and used to formulate…
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…
We show, for any positive integer k, that there exists a graph in which any equitable partition of its vertices into k parts has at least ck^2/\log^* k pairs of parts which are not \epsilon-regular, where c,\epsilon>0 are absolute…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
Lettericity is a graph parameter introduced by Petkov\v{s}ek in 2002 in order to study well-quasi-orderability under the induced subgraph relation. In the world of permutations, geometric griddability was independently introduced in 2013 by…
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and…
Structural balance theory predicts that triads in networks gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for…
Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…
We prove an arithmetic regularity lemma for stable subsets of finite abelian groups, generalising our previous result for high-dimensional vector spaces over finite fields of prime order. A qualitative version of this generalisation was…
We provide an introduction to Dirichlet forms on discrete spaces and study their global properties such as recurrence, stochastic completeness and regularity of the Neumann form. In this setting we compare the notion of a recurrent…