Related papers: The Pop-stack-sorting Operator on Tamari Lattices

We give an algorithm for removing stackiness from smooth, tame Artin stacks with abelian stabilisers by repeatedly applying stacky blow-ups. The construction works over a general base and is functorial with respect to base change and…

I present an overview of the research I have conducted for the past ten years in algebraic, bijective, enumerative, and geometric combinatorics. The two main objects I have studied are the permutahedron and the associahedron as well as the…

Given a join semilattice $S$ with a minimum $\hat{0}$, the quarks (also called atoms in order theory) are the elements that cover $\hat{0}$, and for each $x \in S \setminus \{\hat{0}\}$ a factorization (into quarks) of $x$ is a minimal set…

The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…

Submodularity is an important concept in combinatorial optimization, and it is often regarded as a discrete analog of convexity. It is a fundamental fact that the set of minimizers of any submodular function forms a distributive lattice.…

We show that strata of oriented toric hyperplane arrangements are in bijection with a collection of lattice points in a zonotope. Moreover, we relate the dimension of the stratum and the dimension of the minimal face of the zonotope…

We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…

Lie-Trotter-Suzuki decompositions are an efficient way to approximate operator exponentials $\exp(t H)$ when $H$ is a sum of $n$ (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution…

We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…

Suppose that $\Omega$ is the open region in $\mathbb{R}^n$ above a Lipschitz graph and let $d$ denote the exterior derivative on $\mathbb{R}^n$. We construct a convolution operator $T $ which preserves support in $\bar{\Omega$}, is…

Let M^{2n} be a symplectic toric manifold with a fixed T^n-action and with a toric K\"ahler metric g. Abreu asked whether the spectrum of the Laplace operator $\Delta_g$ on $\mathcal{C}^\infty(M)$ determines the moment polytope of M, and…

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

Let ${M}$ be a compact Riemannian submanifold of ${{\bf R}^m}$ of dimension $\scriptstyle{d}$ and let ${X_1,...,X_n}$ be a sample of i.i.d. points in ${M}$ with uniform distribution. We study the random operators $$…

A dynamical version of the Bourgain-Fremlin-Talagrand dichotomy shows that the enveloping semigroup of a dynamical system is either very large and contains a topological copy of the Stone-Cech compactification of the natural numbers, or it…

Glasner and Megrelishvili proved that every continuous action of a topological group $G$ on a dendrite $X$ is tame. We produce two examples of an action on a dendrite which is not $\mathrm{tame}_1$, answering a question they raised. We then…

The action of a torus group $T$ on a symplectic toric manifold $(M,\omega)$ often extends to an effective action of a (non-abelian) compact Lie group $G$. We may think of $T$ and $G$ as compact Lie subgroups of the symplectomorphism group…

We introduce a new combinatorial structure: the metasylvester lattice on decreasing trees. It appears in the context of the $m$-Tamari lattices and other related $m$-generalizations. The metasylvester congruence has been recently introduced…

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

We propose monotone comparative statics results for maximizers of submodular functions, as opposed to maximizers of supermodular functions as in the classical theory put forth by Veinott, Topkis, Milgrom, and Shannon among others. We…

We define a normed matrix factorization category and a notion of bounding cochains for objects of this category. We classify bounding cochains up to gauge equivalence for spherical objects and use this classification to define numerical…