Related papers: A Combinatorial Model for Exceptional Sequences in…

We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…

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…

Let $V$ and $W$ be quiver representations over $\mathbb{F}_1$ and let $K$ be a field. The scalar extensions $V^K$ and $W^K$ are quiver representations over $K$ with a distinguished, very well-behaved basis. We construct a basis of…

In this paper we advance the program of using exceptional collections to understand the gauge theory description of a D-brane probing a Calabi-Yau singularity. To this end, we strengthen the connection between strong exceptional collections…

I construct a quantum field theory model with discrete scale invariance at tree level. The model has some unusual mathematical properties (such as the appearance of $q$-hypergeometric series) and may possibly have some interesting physical…

We classify the Ext-quivers of hearts in the bounded derived category D(A_n) and the finite-dimensional derived category D(\Gamma_N A_n) of the Calabi-Yau-N Ginzburg algebra D(\Gamma_N A_n). This provides the classification for Buan-Thomas'…

Staged tree models are a discrete generalization of Bayesian networks. We show that these form curved exponential families and derive their natural parameters, sufficient statistic, and cumulant-generating function as functions of their…

We classify generalized tilting modules and full exceptional sequences for the family of quasi-hereditary quotients of type A zig-zag algebras and for a related family of algebras. We also give a characterization of these quotients as…

This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…

We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree realizations. This conjecture is known to be true for $2$ and…

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

Non-simply laced quivers, despite the lack of complete Lagrangian descriptions, play an important role in characterising moduli spaces of supersymmetric field theories. Notably, the moduli space of instantons in non-simply laced gauge…

We show that, for any cluster-tilted algebra of finite representation type over an algebraically closed field, the following three definitions of a maximal green sequence are equivalent: (1) the usual definition in terms of Fomin-Zelevinsky…

For $\mathcal{A}_t$, the Auslander algebra of $K[x]/(x^t)$, it is shown that every complete exceptional sequence of $\mathcal{A}_t$-modules is a complete $\tau$-exceptional sequence. Moreover, it is established that the mutation of complete…

This paper contains a classification of countable lower 1-transitive linear orders. The notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and is essential for the structure theory of 1-transitive trees.…

We describe the mathematical theory of topological quantum computing with symmetry defects in the language of fusion categories and unitary representations. Symmetry defects together with anyons are modeled by G-crossed braided extensions…

The need for interpreting machine learning models is addressed through prototype explanations within the context of tree ensembles. An algorithm named Adaptive Prototype Explanations of Tree Ensembles (A-PETE) is proposed to automatise the…

The class of stochastic matrices that have a stochastic $c$-th root for infinitely many natural numbers $c$ is introduced and studied. Such matrices are called arbitrarily finely divisible, and generalise the class of infinitely divisible…

Ultrametric matrices are a class of covariance matrices that arise in latent tree models. As a parameter space in a statistical model, the set of ultrametric matrices is neither convex nor a smooth manifold. Focus in the literature has…

The decision tree recursively partitions the input space into regions and derives axis-aligned decision boundaries from data. Despite its simplicity and interpretability, decision trees lack parameterized representation, which makes it…