相关论文: A Proof of the Factorization Forest Theorem

In this article we study the K- and L-theory of groups acting on trees. We consider the problem in the context of the fibered isomorphism conjecture of Farrell and Jones. We show that in the class of residually finite groups it is enough to…

Factorization theorem plays the central role at high energy colliders to study standard model and beyond standard model physics. The proof of factorization theorem is given by Collins, Soper and Sterman to all orders in perturbation theory…

We describe a construction that to each algebraically specified notion of higher-dimensional category associates a notion of homomorphism which preserves the categorical structure only up to weakly invertible higher cells. The construction…

For every labeled forest $\mathsf{F}$ with set of vertices $[n]$ we can consider the subgroup $G$ of the symmetric group $S_n$ that is generated by all the cycles determined by all maximal paths of $\mathsf{F}$. We say that $G$ is the chain…

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…

Given a saturated fusion system $\mathcal{F}$ over a finite $p$-group $S$, we provide criteria to determine when uniqueness of factorization into irreducible $\mathcal{F}$--invariant representations holds. We use them to prove uniqueness of…

For an extension $1\rightarrow N \rightarrow \Gamma \xrightarrow{q} \Gamma / N \rightarrow 1$ of discrete countable groups, it is known that the Baum-Connes conjecture with coefficients holds for $\Gamma$ if it holds for $\Gamma / N$ and…

In this paper we are concerned with finite soluble groups $G$ admitting a factorisation $G=AB$, with $A$ and $B$ proper subgroups having coprime order. We are interested in bounding the Fitting height of $G$ in terms of some…

Given an isolated, quasi-homogeneous singularity $X$ we prove that there is a group isomorphism between the group of rank one reflexive sheaves on $X$ and the free abelian group generated by $\mathbb{C}^*$-divisors, modulo linear…

In this paper, we prove an averaged version of an algebraicity conjecture in \cite{GKZ87} concerning the values of higher Green's function at CM points. Furthermore, we give the factorization of the ideal generated by such algebraic value…

Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

We prove that the tree-width of graphs in a hereditary class defined by a finite set $F$ of forbidden induced subgraphs is bounded if and only if $F$ includes a complete graph, a complete bipartite graph, a tripod (a forest in which every…

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists a set of kernels, each of size bounded by an elementary…

It is proved that each of compact linear groups of one special type admits a semialgebraic continuous factorization map onto a real vector space.

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

We prove that the game colouring number of the $m$-th power of a forest of maximum degree $\Delta\ge3$ is bounded from above by \[\frac{(\Delta-1)^m-1}{\Delta-2}+2^m+1,\] which improves the best known bound by an asymptotic factor of 2.

Every numerical semigroup can be expressed as an intersection of irreducible numerical semigroups. We show that the unions of sets of lengths of factorizations of numerical semigroups into irreducible numerical semigroups are all equal to…

We give a new proof of a theorem of Shelah which states that for every family of labeled trees, if the cardinality $\kappa$ of the family is much larger (in the sense of large cardinals) than the cardinality $\lambda$ of the set of labels,…