English
Related papers

Related papers: Measurable domatic partitions

200 papers

It is shown that images of cross-sections of surjective morphisms $f: \Gamma \longrightarrow \Delta$ of divisible abelian $o$-groups are exactly divisible, tame (equivalently, relative Dedekind complete) and cofinal subgroups of $\Gamma$…

Logic · Mathematics 2025-12-01 Ricardo Palomino Piepenborn

Based on a technique of Barvinok and Barvinok and Sober\'on we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs. Subsequently we give a quasi-polynomial time approximation…

Combinatorics · Mathematics 2026-02-24 Guus Regts

By analogy with the Cayley graph of a group with respect to a finite generating set or the Cayley--Abels graph of a totally disconnected, locally compact group, we detail countable connected graphs associated to Polish groups that we term…

Group Theory · Mathematics 2025-05-16 Beth Branman , George Domat , Hannah Hoganson , Robert Alonzo Lyman

Every irreducible outer automorphism of the free group of rank r is topologically represented by an irreducible train track map $f$ on some graph $\Gamma$ of rank r. Moreover, $f$ can always be written as a composition of folds and a graph…

Group Theory · Mathematics 2025-06-25 Paige Hillen

In 1985 S.~Saeki and K.~Stromberg published the following question: {\it Does every infinite compact group have a subgroup which is not Haar measurable?} An affirmative answer is given for all compact groups with the exception of some…

Group Theory · Mathematics 2014-06-27 Salvador Hernández , Karl H. Hofmann , Sidney A. Morris

Let $G$ be a real linear semisimple algebraic group without compact factors and $\Gamma$ a Zariski dense subgroup of $G$. In this paper, we use a probabilistic counting in order to study the asymptotic properties of $\Gamma$ acting on the…

Group Theory · Mathematics 2017-07-12 Richard Aoun

We show that the homology of the partition algebras, interpreted as appropriate Tor-groups, is isomorphic to that of the symmetric groups in a range of degrees that increases with the number of nodes. Furthermore, we show that when the…

Algebraic Topology · Mathematics 2024-02-21 Rachael Boyd , Richard Hepworth , Peter Patzt

Let $A=kQ/I$ be a finite dimensional basic algebra over an algebraically closed field $k$ which is a gentle algebra with the marked ribbon surface $(\mathcal{S}_A,\mathcal{M}_A,\Gamma_A)$. It is known that $\mathcal{S}_A$ can be divided…

Rings and Algebras · Mathematics 2023-02-28 Yu-Zhe Liu , Hanpeng Gao , Zhaoyong Huang

We consider the problem of generating uniformly random partitions of the vertex set of a graph such that every piece induces a connected subgraph. For the case where we want to have partitions with linearly many pieces of bounded size, we…

Probability · Mathematics 2022-06-02 Alan Frieze , Wesley Pegden

Two different families of abelian chiral gauge theories on the torus are investigated: the aim is to test the consistency of two-dimensional anomalous gauge theories in the presence of global degrees of freedom for the gauge field. An…

High Energy Physics - Theory · Physics 2009-10-31 L. Griguolo , D. Seminara

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

Combinatorics · Mathematics 2023-10-11 Pallabi Manna , Santanu Mandal , Manideepa Saha

Let $(X,T)$ be a Cantor minimal system, and let $\Gamma$ denote either its associated topological full group or the full group of a Bratteli diagram associated with $(X,T)$. In this paper we describe the structure of indecomposable…

Group Theory · Mathematics 2026-02-20 Artem Dudko , Constantine Medynets

A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…

Combinatorics · Mathematics 2019-06-04 Benjamin M. Case , Todd Fenstermacher , Soumendra Ganguly , Renu C. Laskar

Given a graph $G$ on $n$ vertices, for which $m$ is it possible to partition the edge set of the $m$-fold complete graph $mK_n$ into copies of $G$? We show that there is an integer $m_0$, which we call the \emph{partition modulus of $G$},…

Combinatorics · Mathematics 2014-08-05 Peter J. Cameron , Sebastian M. Cioabă

Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…

Operator Algebras · Mathematics 2025-12-23 Swarnendu Datta , Debashish Goswami , Soumalya Joardar

Jayne and Rogers proved that every function from an analytic space into a separable metric space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each $F_\sigma$ set under it is…

Logic · Mathematics 2016-09-06 Takayuki Kihara

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

Group Theory · Mathematics 2020-04-24 Michael Mihalik

We consider a finite \'etale morphism $f:Y \to X$ of quasi-smooth Berkovich curves over a complete nonarchimedean non-trivially valued field $k$, assumed algebraically closed and of characteristic 0, and a skeleton…

Algebraic Geometry · Mathematics 2019-01-24 Francesco Baldassarri , Velibor Bojković

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

Group Theory · Mathematics 2025-01-15 Emmanuel Rauzy

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…

Logic · Mathematics 2007-05-23 Péter Komjáth , Saharon Shelah