Related papers: The Hanf number for amalgamation of coloring class…
For a fixed natural number $n \geq 1$, the Hart-Shelah example is an abstract elementary class (AEC) with amalgamation that is categorical exactly in the infinite cardinals less than or equal to $\aleph_n$. We investigate recently-isolated…
We prove a contraction property of certain classes of smooth functions, whose absolute values of elements are log-hyperharmonic functions in the unit ball, thus extending the results of Kulikov to higher-dimensional space (GAFA (2022)).…
We introduce the notion of a `pure` Abstract Elementary Class to block trivial counterexamples. We study classes of models of bipartite graphs and show: Main Theorem (cf. Theorem 3.5.2 and Corollary 3.5.6): If $(\lambda_i : i \le…
The results in this paper are in a context of abstract elementary classes identified by Shelah and Villaveces in which the amalgamation property is not assumed. The long-term goal is to solve Shelah's Categoricity Conjecture in this…
Helly's theorem is a classical result concerning the intersection patterns of convex sets in $\mathbb{R}^d$. Two important generalizations are the colorful version and the fractional version. Recently, B\'{a}r\'{a}ny et al. combined the…
We study the preservation of certain properties under products of classes of finite structures. In particular, we examine indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We…
Hoffman's bound is a well-known spectral bound on the chromatic number of a graph, known to be tight for instance for bipartite graphs. While Hoffman colorings (colorings attaining the bound) were studied before for regular graphs, for…
Motivated by the free products of groups, the direct sums of modules, and Shelah's $(\lambda,2)$-goodness, we study strong amalgamation properties in Abstract Elementary Classes. Such a notion of amalgamation consists of a selection of…
In the framework of graphs, we study abstract elementary classes (aecs). In this work we analyze several properties of Forb(G) and versions of Forb-Con(G) in the context of aecs and we present some examples of classes of graphs which…
This is an introduction for algebraists to the theory of algebras and Hopf algebras in braided categories. Such objects generalise super-algebras and super-Hopf algebras, aswell as colour-Lie algebras. Basic facts about braided categories C…
The combinatorial Hopf algebra on building sets $BSet$ extends the chromatic Hopf algebra of simple graphs. The image of a building set under canonical morphism to quasi-symmetric functions is the chromatic symmetric function of the…
We investigate the existence of perfect homogeneous sets for analytic colorings. An analytic coloring of X is an analytic subset of [X]^N, where N>1 is a natural number. We define an absolute rank function on trees representing analytic…
In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…
The categoricity spectrum of a class of structures is the collection of cardinals in which the class has a single model up to isomorphism. Assuming that cardinal exponentiation is injective (a weakening of the generalized continuum…
A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph…
We study the chromatic quasisymmetric class function of a linearized combinatorial Hopf monoid. Given a linearized combinatorial Hopf monoid $H$, and an $H$-structure $h$ on a set $N$, there are proper colorings of $h$, generalizing graph…
We study a Hopf algebroid, $\calh$, naturally associated to the groupoid $U_n^\delta\ltimes U_n$. We show that classes in the Hopf cyclic cohomology of $\calh$ can be used to define secondary characteristic classes of trivialized flat…
In arXiv:2209.04859 Andy Zucker and Chris Lambie-Hanson proved the consistency result for some coloring principle for the products of polish spaces by at most countable many colors. This principle easy implies Halpern and L\"auchli's…
In a previous paper we showed that the category of cocommutative color Hopf algebras is semi-abelian in case the group $G$ is abelian and finitely generated and the characteristic of the base field is different from 2 (not needed if $G$ is…
We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that for every…