English
Related papers

Related papers: On Chromatic Asymptotic Approximate Groups

200 papers

In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certain objects in graphs: independent sets in the case of the…

Data Structures and Algorithms · Computer Science 2022-12-19 Viresh Patel , Guus Regts

The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…

Combinatorics · Mathematics 2021-07-08 Piotr Szewczak

We give a short proof of a bound on the list chromatic number of graphs $G$ of maximum degree $\Delta$ where each neighbourhood has density at most $d$, namely $\chi_\ell(G) \le (1+o(1)) \frac{\Delta}{\ln \frac{\Delta}{d+1}}$ as…

Combinatorics · Mathematics 2021-11-29 François Pirot , Eoin Hurley

There are many extremely challenging problems about existence of monochromatic arithmetic progressions in colorings of groups. Many theorems hold only for abelian groups as results on non-abelian groups are often much more difficult to…

Combinatorics · Mathematics 2014-11-11 Erik Sjöland

In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…

Representation Theory · Mathematics 2022-01-19 Michael Magee

We develop asymptotic approximations that can be applied to sequential estimation and inference problems, adaptive randomized controlled trials, and related settings. In batched adaptive settings where the decision at one stage can affect…

Econometrics · Economics 2025-02-25 Keisuke Hirano , Jack R. Porter

We study the chromatic symmetric function on graphs, and show that its kernel is spanned by the modular relations. We generalize this result to the chromatic quasisymmetric function on hypergraphic polytopes, a family of generalized…

Combinatorics · Mathematics 2020-03-31 Raul Penaguiao

Distributed estimation methods have recently been used to compute the maximum likelihood estimate of the precision matrix for large graphical Gaussian models. Our aim, in this paper, is to give a Bayesian estimate of the precision matrix…

Methodology · Statistics 2016-05-30 Qiong Li , Xin Gao , Helene Massam

We study the behaviors of the relative Bergman kernel metrics on holomorphic families of degenerating hyperelliptic Riemann surfaces and their Jacobian varieties. Near a node or cusp, we obtain precise asymptotic formulas with explicit…

Complex Variables · Mathematics 2022-11-29 Robert Xin Dong

We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems…

Group Theory · Mathematics 2007-05-23 Thomas W. Mueller , Jan-Christoph Schlage-Puchta

In 2020, Coregliano and Razborov introduced a general framework to study limits of combinatorial objects, using logic and model theory. They introduced the abstract chromatic number and proved/reproved multiple…

Combinatorics · Mathematics 2024-10-15 Dániel Gerbner , Hilal Hama Karim , Gaurav Kucheriya

A new method, called the method of self-similar approximants, and its recent developments are described. The method is based on the ideas of renormalization group theory and optimal control theory. It allows for the effective extrapolation…

Mathematical Physics · Physics 2025-05-20 V. I. Yukalov , E. P. Yukalova

We reprove the results on the hardness of approximating hypergraph coloring using a different technique based on bounds on the size of extremal $t$-agreeing families of $[q]^n$. Specifically, using theorems of Frankl-Tokushige [FT99],…

Computational Complexity · Computer Science 2019-04-03 Per Austrin , Amey Bhangale , Aditya Potukuchi

Starting out from results known for the most classical cases of N, Z^d, R^d or for sigma-finite abelian groups, here we define the notion of asymptotic uniform upper density in general locally compact abelian groups. Even if a bit…

Classical Analysis and ODEs · Mathematics 2009-04-10 Szilard Gy. Revesz

In this monograph, we prove an asymptotic approximation for integrals of probability densities over sets in finite dimensional euclidean space, which are far away from the origin (asymptotic sets). We use this approximation to investigate…

Probability · Mathematics 2009-09-29 Philippe Barbe

In this paper, we consider a coherent theory about the asymptotic representations for a family of inequality indices called Theil-Like Inequality Measures (TLIM), within a Gaussian field. The theory uses the functional empirical process…

Methodology · Statistics 2018-07-23 Pape Djiby Mergane , Tchilabalo Abozou Kpanzou , Diam Ba , Gane Samb Lo

In this article we introduce and study uniform and non-uniform approximate lattices in locally compact second countable (lcsc) groups. These are approximate subgroups (in the sense of Tao) which simultaneously generalize lattices in lcsc…

Group Theory · Mathematics 2018-11-14 Michael Björklund , Tobias Hartnick

We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…

Group Theory · Mathematics 2007-10-04 Seonhee Lim , Anne Thomas

This paper contains three related groupings of results. First, we consider a new notion of an admissible skein module of a surface associated to an ideal in a (non-semisimple) pivotal category. Second, we introduce the notion of a chromatic…

Quantum Algebra · Mathematics 2024-04-18 Francesco Costantino , Nathan Geer , Bertrand Patureau-Mirand , Alexis Virelizier

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…

Geometric Topology · Mathematics 2025-04-18 Elizabeth Field , Radhika Gupta , Robert Alonzo Lyman , Emily Stark