English
Related papers

Related papers: A Proof of the Factorization Forest Theorem

200 papers

Transductions are a general formalism for expressing transformations of graphs (and more generally, of relational structures) in logic. We prove that a graph class $\mathscr{C}$ can be $\mathsf{FO}$-transduced from a class of bounded-height…

Combinatorics · Mathematics 2022-04-01 Michał Pilipczuk , Patrice Ossona de Mendez , Sebastian Siebertz

Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. We consider factorizations $\Gamma\xrightarrow{f} M\xrightarrow{g} G$ of $\varphi$ such that either $g$ or $f$ are universal normal maps (namely, crossed modules). These two…

Group Theory · Mathematics 2014-11-04 Emmanuel D. Farjoun , Yoav Segev

We prove that a hereditary graph class $\mathcal{G}$ defined by finitely many excluded induced subgraphs has bounded tree-$\alpha$ if and only if it is "$(\mathrm{tw},\omega)$-bounded" (that is, for all $t\in \mathbb N$, the class of all…

Combinatorics · Mathematics 2026-05-05 Sepehr Hajebi , Sophie Spirkl

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…

Combinatorics · Mathematics 2013-06-28 Yangzhou Hu

Given a Lipschitz map $f$ from a cube into a metric space, we find several equivalent conditions for $f$ to have a Lipschitz factorization through a metric tree. As an application we prove a recent conjecture of David and Schul. The…

Metric Geometry · Mathematics 2022-03-21 Behnam Esmayli , Piotr Hajłasz

A connected 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct 1-factors is a connected hypergraph. A uniform 1-factorisation is a 1-factorisation of a hypergraph for which the union of each…

Combinatorics · Mathematics 2023-07-26 Barbara Maenhaut , Jeremy Mitchell , Anna Puskas

A dense forest is a set $F \subset \mathbb{R}^n$ with the property that for all $\varepsilon > 0$ there exists a number $V(\varepsilon) > 0$ such that all line segments of length $V(\varepsilon)$ are $\varepsilon$-close to a point in $F$.…

Number Theory · Mathematics 2023-07-13 Victor Shirandami

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…

Combinatorics · Mathematics 2025-03-13 Martin Grohe , Gaurav Rattan , Tim Seppelt

We discuss an analogon to the Farrell-Jones Conjecture for homotopy algebraic K-theory. In particular, we prove that if a group G acts on a tree and all isotropy groups satisfy this conjecture, then G satisfies this conjecture. This result…

K-Theory and Homology · Mathematics 2007-05-23 Arthur Bartels , Wolfgang Lueck

Given a finite group $G$ acting on a surface $S$, the centralizer of G in the mapping class group $\textrm{Mod}(S)$ has a natural representation given by its action on the homology $H_1(S; \mathbb{Q})$. We consider the question of whether…

Geometric Topology · Mathematics 2024-03-15 Trent Lucas

We classify homomorphisms from mapping class groups by using finite subgroups. First, we give a new proof of a result of Aramayona--Souto that homomorphisms between mapping class groups of closed surfaces are trivial for a range of genera.…

Geometric Topology · Mathematics 2021-12-16 Lei Chen , Justin Lanier

We prove that the semigroup operation of a topological semigroup $S$ extends to a continuous semigroup operation on its the Stone-\v{C}ech compactification $\beta S$ provided $S$ is a pseudocompact openly factorizable space, which means…

General Topology · Mathematics 2011-10-11 Taras Banakh , Svetlana Dimitrova

An $(s,t)$-matching in a bipartite graph $G=(U,V,E)$ is a subset of the edges $F$ such that each component of $G[F]$ is a tree with at most $t$ edges and each vertex in $U$ has $s$ neighbours in $G[H]$. We give sharp conditions for a…

Combinatorics · Mathematics 2016-12-07 Alexander Roberts

We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular, we prove that the factorization problem is $\Sigma^0_3$-complete and the conjugacy problem…

Discrete Mathematics · Computer Science 2012-04-24 Jeandel Emmanuel , Pascal Vanier

For an indifference graph $G$ we define a symmetric function of increasing spanning forests of $G$. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function…

Combinatorics · Mathematics 2021-07-01 Alex Abreu , Antonio Nigro

These are notes of my lectures at the summer school "Higher-dimensional geometry over finite fields" in Goettingen, June--July 2007. We present a proof of Tate's theorem on homomorphisms of abelian varieties over finite fields (including…

Algebraic Geometry · Mathematics 2020-10-16 Yuri G. Zarhin

We introduce a preorder on an inverse semigroup $S$ associated to any normal inverse subsemigroup $N$, that lies between the natural partial order and Green's ${\mathscr J}$-relation. The corresponding equivalence relation $\simeq_N$ is not…

Group Theory · Mathematics 2016-02-01 Nouf AlYamani , N. D. Gilbert

This paper establishes the existence of a finitely based finite semiring whose variety contains a continuum of subvarieties; such a variety is said to be of type \(2^{\aleph_0}\). Using the homomorphism theory of Kneser graphs, we prove…

Rings and Algebras · Mathematics 2026-03-03 Zidong Gao

We introduce a natural structure of a semigroup (isomorphic to a factorization semigroup of the unity in the symmetric group) on the set of irreducible components of Hurwitz space of marked degree $d$ coverings of $\mathbb P^1$ of fixed…

Algebraic Geometry · Mathematics 2015-05-18 Vik. S. Kulikov

The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…

Combinatorics · Mathematics 2023-01-10 Robert Moerman , Lauren K. Williams