中文
相关论文

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

200 篇论文

We consider random subgroups of Thompson's group $F$ with respect to two natural stratifications of the set of all $k$ generator subgroups. We find that the isomorphism classes of subgroups which occur with positive density are not the same…

群论 · 数学 2018-03-19 Sean Cleary , Murray Elder , Andrew Rechnitzer , Jennifer Taback

Let $F$ be an affine flat group scheme over a commutative ring $R$, and $S$ an $F$-algebra (an $R$-algebra on which $F$ acts). We define an equivariant analogue $Q_F(S)$ of the total ring of fractions $Q(S)$ of $S$. It is the largest…

交换代数 · 数学 2010-12-03 Mitsuyasu Hashimoto

Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…

环与代数 · 数学 2020-07-15 Konrad Schrempf

We prove a common generalization of the celebrated Sauer-Spencer packing theorem and a theorem of Brandt concerning finding a copy of a tree inside a graph. This proof leads to the characterization of the extremal graphs in the case of…

组合数学 · 数学 2021-11-29 Hemanshu Kaul , Benjamin Reiniger

Homomorphism duality pairs play crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be…

组合数学 · 数学 2015-06-04 Péter L. Erdős , Dömötör Pálvölgyi , Claude Tardif , Gábor Tardos

Let $\mathcal{H}=\{H_i: i<\alpha \}$ be an indexed family of graphs for some ordinal number $\alpha$. $\mathcal{H}$-decomposition of a graph $G$ is a family $\mathcal{G}=\{G_i: i<\alpha \}$ of edge-disjoint subgraphs of $G$ such that $G_i$…

组合数学 · 数学 2021-07-20 Marcin Stawiski

For a projective variety $Z$ and for any integer $p$, define the $p$-th N\'eron-Severi group $NS_p(Z)$ of $Z$ as the image of the cycle map $A_{p}(Z)\to H_{2p}(Z; \mathbb{C})$. Now let $X\subset \Ps^{2m+1}$ ($m\geq 1$) be a projective…

代数几何 · 数学 2007-05-23 Vincenzo Di Gennaro , Davide Franco

We investigate S^3/Z_n partition function of 3d N = 2 supersymmetric field theories. In a gauge theory the partition function is the sum of the contributions of sectors specified by holonomies, and we should carefully choose the relative…

高能物理 - 理论 · 物理学 2014-04-23 Yosuke Imamura , Hiroki Matsuno , Daisuke Yokoyama

We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…

组合数学 · 数学 2014-05-29 D. V. Karpov

Exploiting the symmetry topological field theory/topological order correspondence (SymTFT/TO), together with the higher-categorical structure of 6D N =(2,0) SCFTs, we prove that the total quantum dimension of the relative gaugeable algebra…

高能物理 - 理论 · 物理学 2025-10-29 Veronica Pasquarella

We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also…

群论 · 数学 2017-01-31 M. Hull , D. Osin

For \math{p\ge 1}, we prove that every forest with \math{p} trees whose sizes are $a_1,..., a_p$ can be embedded in any graph containing at least $\sum_{i=1}^p (a_i + 1)$ vertices and having a minimum degree at least $\sum_{i=1}^p a_i$.

组合数学 · 数学 2010-11-18 Mark Goldberg , Malik Magdon-Ismail

We construct factors of type $\tn$ for $n\in\NN, n\geq 2$ from group actions on homogeneous trees and their boundaries. Our result is a discrete analogue of a result of R.J Spatzier, where the hyperfinite factor of type $\tone$ is…

算子代数 · 数学 2013-02-26 Jacqui Ramagge , Guyan Robertson

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…

逻辑 · 数学 2023-06-22 Gunter Fuchs

In this paper, we relate the seemingly unrelated concepts of treewidth and boxicity. Our main result is that, for any graph G, boxicity(G) <= treewidth(G) + 2. We also show that this upper bound is (almost) tight. Our result leads to…

组合数学 · 数学 2007-05-23 L. Sunil Chandran , Naveen Sivadasan

The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.

机器学习 · 计算机科学 2022-05-04 Rahul Sarkar

We prove that every 2-sphere graph different from a prism can be vertex 4-colored in such a way that all Kempe chains are forests. This implies the following three tree theorem: the arboricity of a discrete 2-sphere is 3. Moreover, the…

组合数学 · 数学 2023-09-06 Oliver Knill

We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…

几何拓扑 · 数学 2023-04-05 Sebastian Baader , Ryan Blair , Alexandra Kjuchukova , Filip Misev

We prove that, for each fixed genus, the portion of semigroups of that genus belonging to infinite chains in the semigroup tree approaches 0 as the genus grows to infinite. This means that most numerical semigroups have a finite number of…

数论 · 数学 2024-02-01 Maria Bras-Amorós , Mariana Rosas Ribeiro

Superconformal indices of four-dimensional $\mathcal{N}=1$ gauge theories factorize into holomorphic blocks. We interpret this as a modular property resulting from the combined action of an $SL(3,\mathbb{Z})$ and $SL(2,\mathbb{Z})\ltimes…

高能物理 - 理论 · 物理学 2023-08-22 Vishnu Jejjala , Yang Lei , Sam van Leuven , Wei Li