Related papers: Measurable domatic partitions

We investigate strongly separately continuous functions on a product of topological spaces and prove that if $X$ is a countable product of real lines, then there exists a strongly separately continuous function $f:X\to\mathbb R$ which is…

Let $G = (V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say that $A$ \emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A…

Let $G=(V,E)$ be a graph. For some $\alpha$ with $0<\alpha \leq 1$, a subset $S$ of $V$ is said to be a $\alpha$-partial dominating set if $|N[S]|\geq \alpha |V|$. The size of a smallest such $S$ is called the $\alpha$-partial domination…

Assume that there is no quasi-measurable cardinal smaller than $2^\omega$. ($\kappa$ is quasi measurable if there exists $\kappa $-additive ideal $\ci $ of subsets of $\kappa $ such that the Boolean algebra $P(\kappa)/\ci$ satisfies c.c.c.)…

Let $\mathcal{F}=\{F_{\alpha}: \alpha\in \mathcal{A}\}$ be a family of infinite graphs, together with $\Lambda$. The Factorization Problem $FP(\mathcal{F}, \Lambda)$ asks whether $\mathcal{F}$ can be realized as a factorization of…

We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known fractals. The graphs that we consider are provided by actions…

For a linearly ordered group $G$ let us define a subset $A\subseteq G$ to be a \emph{shift-set} if for any $x,y,z\in A$ with $y < x$ we get $x\cdot y^{-1}\cdot z\in A$. We describe the natural partial order and solutions of equations on the…

In this work, the continuously controlled assembly map in algebraic $K$-theory, as developed by Carlsson and Pedersen, is proved to be a split injection for groups $\Gamma$ that satisfy certain geometric conditions. The group $\Gamma$ is…

Let $G$ be a simply connected, connected completely solvable Lie group with Lie algebra $\mathfrak{g}=\mathfrak{p}+\mathfrak{m}.$ Next, let $\pi$ be an infinite-dimensional unitary irreducible representation of $G$ obtained by inducing a…

Working over infinite dimensional separable Hilbert spaces, residual results have been achieved for the space of contractive $C_{0}$-semigroups under the topology of uniform weak operator convergence on compact subsets of $\mathbb{R}_{+}$.…

In this paper, we introduce the comaximal graph $\Gamma(L)$ of a finite-dimensional Lie algebra $L$, whose vertices are the nontrivial proper Lie subalgebras of $L$ over a field $\mathbb{F}$, and two vertices $A$ and $B$ are adjacent if and…

We define and study a family of partitions of the wonderful compactification \bar{G} of a semi-simple algebraic group G of adjoint type. The partitions are obtained from subgroups of G \times G associated to triples (A_1, A_2, a), where A_1…

We consider the Banach space consisting of continuous functions from an arbitrary uncountable compact metric space, $X$, into $\mathbb{R}^n$. The key question is `what is the generic dimension of $f(X)$?' and we consider two different…

A topological group $G$ is called extremely amenable if every continuous action of $G$ on a compact space has a fixed point. This concept is linked with geometry of high dimensions (concentration of measure). We show that a von Neumann…

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…

Given a symmetric matrix $M\in \{0,1,*\}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that,…