Related papers: Borel Edge Colorings for Finite Dimensional Groups

In this paper, we present explicit and computable error bounds for the asymptotic expansions of the Hermite polynomials with Plancherel--Rotach scale. Three cases, depending on whether the scaled variable lies in the outer or oscillatory…

Functor morphing provides a method to translate complex representations of automorphism groups of finite modules over finite rings to representations of automorphism groups of functors in some abelian category. In this paper we give an…

We study the analytic digraphs of uncountable Borel chromatic number on Polish spaces, and compare them with the notion of injective Borel homomorphism. We provide some minimal digraphs incomparable with G 0. We also prove the existence of…

We consider discrete Schr\"odinger operators with periodic potentials on periodic graphs. Their spectra consist of a finite number of bands. We perturb a periodic graph by adding edges in a periodic way (without changing the vertex set) and…

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

A new method of algebraic nature is proposed for the study of the asymptotic properties of special polynomials. The technique we foresee is based on the use of umbral operators, allowing a unified treatment of a large body of polynomial…

We study the conflict-free chromatic number of hypergraphs derived from the family of facets of $d$-dimensional cyclic polytopes with $n$ vertices. While in odd dimensions $d$ the problem is easy, for even dimensions the problem becomes…

Inspired by the Erd\H{o}s R\'enyi model, we propose a new model for freesquare random monomial ideals generated by edges and covers of a graph. This permit us to investigate the conditions of normality for which we obtain asymptotic…

We prove an asymptotic analog of the classical Hurewicz theorem on mappings which lower dimension. This theorem allows us to find sharp upper bound estimates for the asymptotic dimension of groups acting on finite dimensional metric spaces…

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

We prove several improved versions of the Borel-Ritt theorem about the surjectivity of the asymptotic Borel mapping in classes of functions with $\boldsymbol{M}$-uniform asymptotic expansion on an unbounded sector of the Riemann surface of…

We identify natural conditions for a countable group acting on a countable tree which imply that the orbit equivalence relation of the induced action on the Gromov boundary is Borel hyperfinite. Examples of this condition include…

We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…

The abstract chromatic number was introduced by Razborov and Coregliano in 2020 in using the language of model theory, and was used to extend the Erd\H os-Stone-Simonovits theorem to graphs with extra structures. A purely combinatorial…

Consider a finite dimensional Lie algebra L with an action of a finite group G over a field of characteristic 0. We prove the analog of Amitsur's conjecture on asymptotic behavior for codimensions of polynomial G-identities of L. As a…

We consider triangulations of surfaces with edges painted three colors so that edges of each triangle have different colors. Such structures arise as Belyi data (or Grothendieck dessins d'enfant), on the other hand they enumerate pairs of…

In this work, we try to enunciate the Total chromatic number of some Cayley graphs like the Cayley graph on Symmetric group, Alternating group, Dihedral group with respect to some generating sets and some other regular graphs.

In this article, we initiate a geometric study of graph braid groups. More precisely, by applying the formalism of special colorings introduced in a previous article, we determine precisely when a graph braid group is Gromov-hyperbolic,…

The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…

In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many applications, in particular in scheduling. It was proved by…