The splitting process in free probability theory

Splitting necklaces, with constraints

We prove several versions of N. Alon's "necklace-splitting theorem", subject to additional constraints, as illustrated by the following results. (1) The "almost equicardinal necklace-splitting theorem" claims that, without increasing the number of cuts, one guarantees the existence of a fair splitting such that each thief is allocated (approximately) one and the same number of pieces of the necklace (including "degenerate pieces" if they exist), provided the number of thieves $r=p^ν$ is a prime power. (2) The "binary splitting theorem" claims that if $r=2^d$ and the thieves are associated with…

On the splitting types of bundles of logarithmic vector fields along plane curves

We give a formula relating the total Tjurina number and the generic splitting type of the bundle of logarithmic vector fields associated to a reduced plane curve. By using it, we give a characterization of nearly free curves in terms of splitting types. Several applications to free and nearly free arrangements of lines are also given, in particular a proof of a form of Terao's Conjecture for arrangements having a line with at most 4 intersection points.

幺半群的纯性与半群环中的无特征分裂

Purity of monoids and characteristic-free splittings in semigroup rings

受素特征方法启发，引入半正规幺半群的组合不变量，并将其与半群环的奇点和同调不变量关联，结果不依赖特征。

Splittings and symbolic powers of square-free monomial Ideals

We study the symbolic powers of square-free monomial ideals via symbolic Rees algebras and methods in prime characteristic. In particular, we prove that the symbolic Rees algebra and the symbolic associated graded algebra are split with respect to a morphism which resembles the Frobenius map and that exists in all characteristics. Using these methods, we recover a result by Hoa and Trung which states that the normalized $a$-invariants and the Castelnuovo-Mumford regularity of the symbolic powers converge. In addition, we give a sufficient condition for the equality of the ordinary and symbolic…

A note on $Oct_{1}^{+}$-free graphs and $Oct_{2}^{+}$-free graphs

Let $Oct_{1}^{+}$ and $Oct_{2}^{+}$ be the planar and non-planar graphs that obtained from the Octahedron by 3-splitting a vertex respectively. For $Oct_{1}^{+}$, we prove that a 4-connected graph is $Oct_{1}^{+}$-free if and only if it is $C_{6}^{2}$, $C_{2k+1}^{2}$ $(k \geq 2)$ or it is obtained from $C_{5}^{2}$ by repeatedly 4-splitting vertices. We also show that a planar graph is $Oct_{1}^{+}$-free if and only if it is constructed by repeatedly taking 0-, 1-, 2-sums starting from $\{K_{1}, K_{2} ,K_{3}\} \cup \mathscr{K} \cup \{Oct,L_{5} \}$, where $\mathscr{K}$ is the set of graphs obtai…

Splitting groups with cubic Cayley graphs of connectivity two

A group $G$ splits over a subgroup $C$ if $G$ is either a free product with amalgamation $A \underset{C}{\ast} B$ or an HNN-extension $G=A \underset{C}{\ast} (t)$. We invoke Bass-Serre theory and classify all infinite groups which admit cubic Cayley graphs of connectivity two in terms of splittings over a subgroup.