Related papers: Combinatorial cost: a coarse setting

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

In this short note we answer a query of Brodzki, Niblo, \v{S}pakula, Willett and Wright by showing that all bounded degree uniformly locally amenable graphs have Property A. For the second result of the note recall that Kaiser proved that…

We show that additive induced-hereditary properties of coloured hypergraphs can be uniquely factorised into irreducible factors. Our constructions and proofs are so general that they can be used for arbitrary concrete categories of…

The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…

This document begins by reviewing recent progress that has been made by taking a combinatorial perspective on the $c_2$ invariant, an arithmetic graph invariant with connections to Feynman integrals. Then it proceeds to report on some…

A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…

For fixed positive integers $r, k$ and $\ell$ with $1 \leq \ell < r$ and an $r$-uniform hypergraph $H$, let $\kappa (H, k,\ell)$ denote the number of $k$-colorings of the set of hyperedges of $H$ for which any two hyperedges in the same…

A $k$-uniform hypergraph is $s$-almost intersecting if every edge is disjoint from exactly $s$ other edges. Gerbner, Lemons, Palmer, Patk\'os and Sz\'ecsi conjectured that for every $k$, and $s>s_0(k)$, every $k$-uniform $s$-almost…

We establish, for every family of orthogonal polynomials in the $ q $-Askey scheme and the Askey scheme, a combinatorial model for mixed moments and coefficients in terms of paths on the lecture hall graph. This generalizes the previous…

The notions of a box family and fibred cofinitely-coarse embedding are introduced. The countable, residually amenable groups satisfying the Haagerup property are then characterized as those possessing a box family that admits a fibred…

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is…

We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In the unproved case, we have a conjecture supported by a vast…

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

Almost forty years ago, Connes, Feldman and Weiss proved that for measurable equivalence relations the notions of amenability and hyperfiniteness coincide. In this paper we define the uniform version of amenability and hyperfiniteness for…

Let $f: X \to S$ be a unipotent degeneration of projective complex manifolds over a disc such that the reduction of the central fibre $Y=f^{-1}(0)$ is simple normal crossings, and let $X_\infty$ be the canonical nearby fibre. Building on…

How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…

D. A. Kahzdan first put forth property (T) in relation to the study of discrete subgroups of Lie groups of finite co-volume. Through a combinatorial approach, we define an analogue of property (T) for regular graphs. We then prove the basic…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…