Related papers: Continuous Noncrossing Partitions and Weighted Cir…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
We study positive $m$-divisible non-crossing partitions and their positive Kreweras maps. In classical types, we describe their combinatorial realisations as certain non-crossing set partitions. We also realise these positive Kreweras maps…
This paper shows that $p$ primary components of certain generic crossed products are not crossed products. This applies in particular to primary components of prime degree, thus producing examples of division algebras of prime degree that…
A family of quantum cluster algebras is introduced and studied. In general, these algebras are new, but subclasses have been studied previously by other authors. The algebras are indexed by double partitions or double flag varieties.…
We investigate the modular properties of a new partition rank, the $M_d$-rank of overpartitions. In fact this is an infinite family of ranks, indexed by the positive integer $d$, that gives both the Dyson rank of overpartitions and the…
The universal properties of (2 + 1)D topological phases of matter enriched by a symmetry group G are described by G-crossed extensions of unitary modular tensor categories (UMTCs). While the fusion and braiding properties of quasiparticles…
In the study of 2d (the space dimension) topological orders, it is well-known that bulk excitations are classified by unitary modular tensor categories. But these categories only describe the local observables on an open 2-disk in the long…
In this paper we construct a Universal chain complex, counting zeros of closed 1-forms on a manifold. The Universal complex is a refinement of the well known Novikov complex; it relates the homotopy type of the manifold, after a suitable…
The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…
This thesis takes Brady's construction of $K(\pi,1)$s for the braid groups as a starting point. It is widely known that this construction can - with the right ingredients - be generalized to Artin groups of finite type. Results of Bessis as…
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface $\Sigma$ and introduce the number $C_{\Sigma}(n)$ of non-crossing partitions of a set of $n$ points laying on…
We enumerate traceless square matrices over finite quotients of compact discrete valuation rings by their image sizes. We express the associated rational generating functions in terms of statistics on symmetric and hyperoctahedral groups,…
Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…
We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…
Classical circuit complexity characterizes parallel computation in purely combinatorial terms, ignoring the physical constraints that govern real hardware. The standard classes $\mathbf{NC}$, $\mathbf{AC}$, and $\mathbf{TC}$ treat unlimited…
Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…
We develop a ring-theoretic approach for blowing up many noncommutative projective surfaces. Let T be an elliptic algebra (meaning that, for some central element g of degree 1, T/gT is a twisted homogeneous coordinate ring of an elliptic…