Related papers: Borel Edge Colorings for Finite Dimensional Groups
We give upper and lower bounds on the conformal dimension of the Bowditch boundary of a Coxeter group with defining graph a complete graph and edge labels at least three. The lower bounds are obtained by quasi-isometrically embedding…
This paper explores the asymptotic behaviour of the radii of convexity and uniform convexity for normalized Bessel functions with respect to large order. We provide detailed asymptotic expansions for these radii and establish recurrence…
We show that the asymptotic dimension of box spaces behaves (sub)additively with respect to extensions of groups. As a result, we obtain that for an elementary amenable group, the asymptotic dimension of any of its box spaces is bounded…
In this note, we remark on the range in Borel's theorem on the stable cohomology of the arithmetic groups Sp(2n,Z) and SO(n,n;Z). This improves the range stated in Borel's original papers, an improvement that was known to Borel. Our main…
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree $d$. We completely determine the asymptotic behaviour…
By showing that the symmetrically transformed Bessel kernel admits a full asymptotic expansion for large parameter, we establish a hard-to-soft edge transition expansion. This resolves a conjecture recently proposed by Bornemann.
In this paper, we will study the chromatic number of Cayley graphs of algebraic groups that arise from algebraic constructions. Using Lang-Weil bound and representation theory of finite simple groups of Lie type, we will establish lower…
Even though big mapping class groups are not countably generated, certain big mapping class groups can be generated by a coarsely bounded set and have a well defined quasi-isometry type. We show that the big mapping class group of a stable…
The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler…
In this paper, we study definable variants of the notion of the distinguishing number of a graph in descriptive set theoretic setting. We introduce the notion of the Borel distinguishing number of a Borel graph and provide examples that…
We prove that a formula predicted on the basis of non-rigorous physics arguments [Zdeborova and Krzakala: Phys. Rev. E (2007)] provides a lower bound on the chromatic number of sparse random graphs. The proof is based on the interpolation…
We show that for any infinite countable group $G$ and for any free Borel action $G \curvearrowright X$ there exists an equivariant class-bijective Borel map from $X$ to the free part $\mathrm{Free}(2^G)$ of the $2$-shift $G \curvearrowright…
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
We consider meromorphic transforms given by meromorphic kernels and study their asymptotic expansions under a certain rescaling. Under decay assumptions we establish the full asymptotic expansion in the rescaling parameter of these…
Assuming the asymptotic character of divergent perturbation series, we address the problem of ambiguity of a function determined by an asymptotic power expansion. We consider functions represented by an integral of the Laplace-Borel type,…
Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the…
The only remaining case of a well known conjecture of Vizing states that there is no planar graph with maximum degree 6 and edge chromatic number 7. We introduce parameters for planar graphs, based on the degrees of the faces, and study the…
We introduce dynamic asymptotic dimension, a notion of dimension for actions of discrete groups on locally compact spaces, and more generally for locally compact \'etale groupoids. We study our notion for minimal actions of the integer…
We propose a way of preventing race conditions in the evaluation of the surface integral contribution in discontinuous Galerkin and finite volume flow solvers by coloring the edges (or faces) of the computational mesh. In this work we use a…