Related papers: A weighted cellular matrix-tree theorem, with appl…
The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…
Tree ensembles, such as random forests and boosted trees, are renowned for their high prediction performance. However, their interpretability is critically limited due to the enormous complexity. In this study, we present a method to make a…
Simplicial complexes describe collaboration networks, protein interaction networks and brain networks and in general network structures in which the interactions can include more than two nodes. In real applications, often simplicial…
We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '$\Gamma$-species' which incorporates data about 'structural' group actions). This culminates…
We give a computational algorithm for computing Ext groups between bounded complexes of coherent sheaves on a projective variety, and we describe an implementation of this algorithm in Macaulay2. In particular, our results yield methods for…
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
We study the generating function of rooted and unrooted hyperforests in a general complete hypergraph with n vertices by using a novel Grassmann representation of their generating functions. We show that this new approach encodes the known…
Expressive querying of machine learning models - viewed as a form of intentional data - enables their verification and interpretation using declarative languages, thereby making learned representations of data more accessible. Motivated by…
In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…
We show that, in a highest weight category with duality, the endomorphism algebra of a tilting object is naturally a cellular algebra. Our proof generalizes a recent construction of Andersen, Stroppel, and Tubbenhauer. This result raises…
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an input string, and the decision at each tree node is…
A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…
Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…
Neural networks with tree-based sentence encoders have shown better results on many downstream tasks. Most of existing tree-based encoders adopt syntactic parsing trees as the explicit structure prior. To study the effectiveness of…
Martin Klazar computed the total weight of ordered trees under 12 different notions of weight. The last and perhaps most interesting of these weights, w_{12}, led to a recurrence relation and an identity for which he requested combinatorial…
We exhibit for all positive integers r, an explicit cellular structure for the endomorphism algebra of the r'th tensor power of an integral form of the Weyl module with highest weight d of the quantised enveloping algebra of sl2. When q is…
A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…
We introduce an algorithmic approach based on generating tree method for enumerating the inversion sequences with various pattern-avoidance restrictions. For a given set of patterns, we propose an algorithm that outputs either an accurate…
The increasing complexity of data requires methods and models that can effectively handle intricate structures, as simplifying them would result in loss of information. While several analytical tools have been developed to work with complex…
This paper is concerned with convergence estimates for fully discrete tree tensor network approximations of high-dimensional functions from several model classes. For functions having standard or mixed Sobolev regularity, new estimates…