Related papers: Factorizations of cycles and multi-noded rooted tr…
Plural (or multiple-conclusion) cuts are inferences made by applying a structural rule introduced by Gentzen for his sequent formulation of classical logic. As singular (single-conclusion) cuts yield trees, which underlie ordinary natural…
Hurwitz numbers enumerate ramified coverings of the Riemann sphere with fixed ramification data. Certain kinds of ramification data are of particular interest, such as double Hurwitz numbers, which count covers with fixed arbitrary…
This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…
The classical Hurwitz numbers count the fixed-length transitive transposition factorizations of a permutation, with a remarkable product formula for the case of minimum length (genus $0$). We study the analogue of these numbers for…
The Hurwitz space is a compactification of the space of rational functions of a given degree. We study the intersection of various strata of this space with its boundary. A study of the cohomology ring of the Hurwitz space then allows us to…
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
We study the Hurwitz action of the classical braid group on factorisations of a Coxeter element c in a well-generated complex reflection group W. It is well-known that the Hurwitz action is transitive on the set of reduced decompositions of…
Let $R$ be a complete discrete valuation ring of equal characteristic $p>0$. Given a $\mathbb{Z}/p$-Galois cover of a formal disc over $R$, one can derive from it a semi-stable model for which the specializations of branch points are…
We study random typical minimal factorizations of the $n$-cycle, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions, chosen uniformly at random. Our main result is, roughly speaking, a local convergence theorem…
We associate a complete intersection singularity to a graded matrix factorization of size two of a polynomial in three variables. We show that we get an inverse to the reduction of singularities considered by C.T.C.Wall. We study this for…
In this paper we present a factorization framework for Hermite subdivision schemes refining function values and first derivatives, which satisfy a spectral condition of high order. In particular we show that spectral order $d$ allows for…
We investigate the relation between degree sequences of trees and the majorization order using the Muirhead theorem. In this way, we prove a theorem that provides a necessary and sufficient condition for delta sequences of trees to be…
Here we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6^r.r!).poly(n)$, where n=|X|. The novelty of this approach is…
We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…
A decision tree recursively splits a feature space $\mathbb{R}^{d}$ and then assigns class labels based on the resulting partition. Decision trees have been part of the basic machine-learning toolkit for decades. A large body of work treats…
A permutation can be locally classified according to the four local types: peaks, valleys, double rises and double falls. The corresponding classification of binary increasing trees uses four different types of nodes. Flajolet demonstrated…
We describe a relation between the invariants of $n$ ordered points in $P^d$ and of points contained in a union of linear subspaces $P^{d1}\cup P^{d2} \subset P^d$. This yields an attaching map for GIT quotients parameterizing point…
Every Grothendieck fibration gives rise to a vertical/cartesian orthogonal factorization system on its domain. We define a cartesian factorization system to be an orthogonal factorization in which the left class satisfies 2-of-3 and is…