Related papers: On Chromatic Asymptotic Approximate Groups

We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…

For a colour cluster $\C =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\dots,\mathcal{C}_\ell)$, $\mathcal{C}_i$ is a colour class, and $|\mathcal{C}_i|=r_i \geq 1$, we investigate a simple connected graph structure $G^{\C}$, which…

We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…

The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…

In this paper we study the problem of approximation of the $L^2$-topological invariants by their finite dimensional analogues. We obtain generalizations of the theorem of L\"uck, dealing with towers of finitely sheeted normal coverings. We…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

We study the asymptotic complexity constant of the sequence of approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal $K$. We show how full symmetry implies existence of the asymptotic complexity…

It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…

We study the large-$N$ behavior of random matrix tuples $Y^N = (Y_1^N,\dots,Y_d^N)$ with joint density proportional to $e^{-N^2 V}$ for some convex function $V$ in non-commuting variables satisfying certain bounds on its second derivative.…

We establish the asymptotic theory in quantile autoregression when the model parameter is specified with respect to moderate deviations from the unit boundary of the form (1 + c / k) with a convergence sequence that diverges at a rate…

Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…

We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky. For various joins of all-positive or all-negative signed complete…

The review presents the development of an approach of constructing approximate solutions to complicated physics problems, starting from asymptotic series, through optimized perturbation theory, to self-similar approximation theory. The…

Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…

We prove multiple generalizations of Fan's combinatorial labeling result for sphere triangulations. This can be seen as a comprehensive extension of the Borsuk--Ulam theorem. In typical applications, the Borsuk--Ulam theorem gives…

We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~$2$ while the path-chromatic number is unbounded. This resolves a problem posed by Seymour.

Asymptotic almost automorphy is introduced and studied in the context of some algebras of generalized functions. We also give applications to neutral difference differential systems in the framework of such generalized functions.

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…

Over the last 30 years, extensive work has been devoted to developing central limit theory for partial sums of subordinated long memory linear time series. A much less studied problem, motivated by questions that are ubiquitous in extreme…

Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…