Related papers: Total cut complexes and their duals
We compute the double complex of smooth complex-valued differential forms on projective bundles over and blow-ups of compact complex manifolds up to a suitable notion of quasi-isomorphism. This simultaneously yields formulas for 'all'…
Given a closed, smooth, connected, orientable $4$-manifold $M$, whose integral homology groups can have $2$-torsion, we determine the homotopy decomposition of the double suspension $\Sigma^2M$ as wedge sums of some elementary…
Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
We study two simplicial complexes arising from a directed graph $G = (V, E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $F \subseteq E$ that contain no path from $s$ to $t$, and the…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
We describe the Alexander modules and Alexander polynomials (both over $\Q$ and over finite fields $\FF{p}$) of generalized trigonal curves. The rational case is closed completely; in the case of characteristic $p>0$, a few points remain…
Homotopy links have proven to be one of the most powerful tools of stratified homotopy theory. In previous work, we described combinatorial models for the generalized homotopy links of a stratified simplicial set. For many purposes, in…
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…
We show that there is an almost complex structure on a differential calculus on finite points coming from a bidirected finite graph without multiple edges or loops. We concentrate on a polygon as a concrete case. In particular, a…
We study the double scaling limit of mKdV type, realized in the two-cut Hermitian matrix model. Building on the work of Periwal and Shevitz and of Nappi, we find an exact solution including all odd scaling operators, in terms of a hierarchy…
Automorphisms of a perfect complex naturally have the structure of an $\infty$-group: the 1-morphisms are quasi-isomorphisms, the 2-morphisms are homotopies, etc. This article starts by proving some basic properties of this $\infty$-group.…
We compute the cohomology groups of the spaces of colorings of cycles, i.e., of the prodsimplicial complexes Hom(C_m,K_n). We perform the computation first with Z_2, and then with integer coefficients. The main technical tool is to use…
We study complexes of finite complete intersection dimension in the derived category of a local ring. Given such a complex, we prove that the thick subcategory it generates contains complexes of all possible complexities. In particular, we…
We prove that one can realize certain triangulated subcategories of the singularity category of a complete intersection as homotopy categories of matrix factorizations. Moreover, we prove that for any commutative ring and non-zerodivisor,…
We study the relative Hilbert scheme of a family of nodal (or smooth) curves via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the discriminant locus, which consists of…
We introduce new polynomial isotopy invariants for closed braids. They are constructed as polynomial valued {\em Gauss diagram 1-cocycles} evaluated on the full rotation of the closed braid $\hat \beta$ around the core of the corresponding…
We describe a new sampling-based method to determine cuts in an undirected graph. For a graph (V, E), its cycle space is the family of all subsets of E that have even degree at each vertex. We prove that with high probability, sampling the…
We discuss the extension of the maximal-unitarity method to two loops, focusing on the example of the planar double box. Maximal cuts are reinterpreted as contour integrals, with the choice of contour fixed by the requirement that integrals…
We extend the maximal unitarity method to amplitude contributions whose cuts define multidimensional algebraic varieties. The technique is valid to all orders and is explicitly demonstrated at three loops in gauge theories with any number…