Packing Steiner Trees

Let $T$ be a distinguished subset of vertices in a graph $G$. A $T$-\emph{Steiner tree} is a subgraph of $G$ that is a tree and that spans $T$. Kriesell conjectured that $G$ contains $k$ pairwise edge-disjoint $T$-Steiner trees provided that every edge-cut of $G$ that separates $T$ has size $\ge 2k$. When $T=V(G)$ a $T$-Steiner tree is a spanning tree and the conjecture is a consequence of a classic theorem due to Nash-Williams and Tutte. Lau proved that Kriesell's conjecture holds when $2k$ is replaced by $24k$, and recently West and Wu have lowered this value to $6.5k$. Our main result makes a further improvement to $5k+4$.Comment: 38 pages, 4 figure

The Waldschmidt constant for squarefree monomial ideals

Given a squarefree monomial ideal $I \subseteq R =k[x_1,\ldots,x_n]$, we show that $\widehat\alpha(I)$, the Waldschmidt constant of $I$, can be expressed as the optimal solution to a linear program constructed from the primary decomposition of $I$. By applying results from fractional graph theory, we can then express $\widehat\alpha(I)$ in terms of the fractional chromatic number of a hypergraph also constructed from the primary decomposition of $I$. Moreover, expressing $\widehat\alpha(I)$ as the solution to a linear program enables us to prove a Chudnovsky-like lower bound on $\widehat\alpha(I)$, thus verifying a conjecture of Cooper-Embree-H\`a-Hoefel for monomial ideals in the squarefree case. As an application, we compute the Waldschmidt constant and the resurgence for some families of squarefree monomial ideals. For example, we determine both constants for unions of general linear subspaces of $\mathbb{P}^n$ with few components compared to $n$, and we find the Waldschmidt constant for the Stanley-Reisner ideal of a uniform matroid.Comment: 26 pages. This project was started at the Mathematisches Forschungsinstitut Oberwolfach (MFO) as part of the mini-workshop "Ideals of Linear Subspaces, Their Symbolic Powers and Waring Problems" held in February 2015. Comments are welcome. Revised version corrects some typos, updates the references, and clarifies some hypotheses. To appear in the Journal of Algebraic Combinatoric

N=4 Multi-Particle Mechanics, WDVV Equation and Roots

We review the relation of N=4 superconformal multi-particle models on the real line to the WDVV equation and an associated linear equation for two prepotentials, F and U. The superspace treatment gives another variant of the integrability problem, which we also reformulate as a search for closed flat Yang-Mills connections. Three- and four-particle solutions are presented. The covector ansatz turns the WDVV equation into an algebraic condition, for which we give a formulation in terms of partial isometries. Three ideas for classifying WDVV solutions are developed: ortho-polytopes, hypergraphs, and matroids. Various examples and counterexamples are displayed

Hamilton cycles in 5-connected line graphs

A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness

A Universal Homogeneous Simple Matroid of Rank 33

We construct a $\wedge$-homogeneous universal simple matroid of rank $3$, i.e. a countable simple rank~$3$ matroid $M_*$ which $\wedge$-embeds every finite simple rank $3$ matroid, and such that every isomorphism between finite $\wedge$-subgeometries of $M_*$ extends to an automorphism of $M_*$. We also construct a $\wedge$-homogeneous matroid $M_*(P)$ which is universal for the class of finite simple rank $3$ matroids omitting a given finite projective plane $P$. We then prove that these structures are not $\aleph_0$-categorical, they have the independence property, they admit a stationary independence relation, and that their automorphism group embeds the symmetric group $Sym(\omega)$. Finally, we use the free projective extension $F(M_*)$ of $M_*$ to conclude the existence of a countable projective plane embedding all the finite simple matroids of rank $3$ and whose automorphism group contains $Sym(\omega)$, in fact we show that $Aut(F(M_*)) \cong Aut(M_*)$