相关论文: Fertilitopes
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
We extend the previously established zesting techniques from fusion categories to general tensor categories. In particular we consider the category of comodules over a Hopf algebra, providing a detailed translation of the categorical…
We construct a non-commutative, non-cocommutative, graded bialgebra $\mathbf{\Pi}$ with a basis indexed by the permutations in all finite symmetric groups. Unlike the formally similar Malvenuto-Poirier-Reutenauer Hopf algebra, this…
A phylogenetic tree is an edge-weighted binary tree, with leaves labelled by a collection of species, that represents the evolutionary relationships between those species. For such a tree, a phylogenetic diversity index is a function that…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
Let $\mathbf{v}_1,\ldots,\mathbf{v}_m$ be points in a metric space with distance $d$, and let $w_1,\ldots,w_m$ be positive real weights. The weighted Fermat-Weber points are those points $\mathbf{x}$ which minimize $\sum w_i d(\mathbf{v}_i,…
We study the behavior of West's stack-sorting map $s$ on permutations whose last entry is also their least. Let $S_{n}':=\{\pi0\mid \pi\in S_n\}$ where $\pi0$ denotes the concatenation of $\pi$ and $0$. For each permutation $\pi\in S_n'$,…
We present a sheaf-theoretic construction of shape space -- the space of all shapes. We do this by describing a homotopy sheaf on the poset category of constructible sets, where each set is mapped to its Persistent Homology Transform (PHT).…
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for…
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…
We initiate a unified, axiomatic study of noncommutative algebras R whose prime spectra are, in a natural way, finite unions of commutative noetherian spectra. Our results illustrate how these commutative spectra can be functorially ``sewn…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
Let V be a cofibrantly generated closed symmetric monoidal model category and M a model V-category. We say that a weighted colimit W*D of a diagram D weighted by W is a homotopy weighted colimit if the diagram D is pointwise cofibrant and…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…
The main result of this paper is a recursive description of all decompositions \[ \Delta^+ = \Phi_1 \sqcup \Phi_2 \sqcup \dots \sqcup \Phi_k \] of the positive roots $\Delta^+$ of an arbitrary root system $\Delta$ into a disjoint union of…
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholz-Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral…
Given a permutation $\pi\in \Sn\_n$, construct a graph $G\_\pi$ on the vertex set $\{1,2, ..., n\}$ by joining $i$ to $j$ if (i) $i<j$ and $\pi(i)<\pi(j)$ and (ii) there is no $k$ such that $i < k < j$ and $\pi(i)<\pi(k)<\pi(j)$. We say…
For a complex simple Lie algebra $\mathfrak{g}$ or rank $r$, let $\rho$ be the half sum of positive roots and $P(2\rho)\subset \mathbb{R}^r$ be the convex hull of all dominant weights $\lambda$ of the form $\lambda=2\rho-\sum_{i=1}^r…
By a result of Biswas and Dos Santos, on a smooth and projective variety over an algebraically closed field, a vector bundle trivialized by a proper and surjective map is essentially finite, that is it corresponds to a representation of the…