Related papers: A good leaf order on simplicial trees
Let $I(G)^{[k]}$ denote the $k$th squarefree power of the edge ideal of $G$. When $G$ is a forest, we provide a sharp upper bound for the regularity of $I(G)^{[k]}$ in terms of the $k$-admissable matching number of $G$. For any positive…
We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen-Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise from the…
We study algebraic and homological properties of facet ideals of order complexes of posets which we call ideals of maximal flags of posets or simply flag ideals. We characterize the unmixed and Cohen-Macaulay flag ideals of graded posets.…
Let $G$ be a chordal graph and $I(G)$ its edge ideal. Let $\beta (I(G)) = (\beta_0, \beta_1, ..., \beta_p)$ denote the Betti sequence of $I(G)$, where $\beta_i$ stands for the $i$th total Betti number of $I(G)$ and where $p$ is the…
We give a characterization of symplectic quadratic Lie algebras that their Lie algebra of inner derivations has an invertible derivation. A family of symplectic quadratic Lie algebras is introduced to illustrate this situation. Finally, we…
In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed…
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if…
To any rooted tree, we associate a sequence of numbers that we call the logarithmic factorials of the tree. This provides a generalization of Bhargava's factorials to a natural combinatorial setting suitable for studying questions around…
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tree, a linear-sized data structure that supports the…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
Let $X$ be an $(m\times n)$-matrix of indeterminates, and let $J$ be the ideal generated by a set $\mathcal{S}$ of maximal minors of $X$. We construct the linear strand of the resolution of $J$. This linear strand is determined by the…
Let $\Delta$ be simplicial complex and let $k[\Delta]$ denote the Stanley--Reisner ring corresponding to $\Delta$. Suppose that $k[\Delta]$ has a pure free resolution. Then we describe the Betti numbers and the Hilbert--Samuel multiplicity…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…
We study simplicial complexes with a given number of vertices whose Stanley-Reisner ring has the minimal possible Betti numbers. We find that these simplicial complexes have very special combinatorial and topological structures. For…
Let I be a homogeneous ideal in a polynomial ring P over a field. By Macaulay's Theorem, there exists a lexicographic ideal L=Lex(I) with the same Hilbert function as I. Peeva has proved that the Betti numbers of P/I can be obtained from…
A closed-form formula is derived for the number of occurrences of matches of a multiset of patterns among all ordered (plane-planted) trees with a given number of edges. A pattern looks like a tree, with internal nodes and leaves, but also…
We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…
We discuss various problems regarding the structure of the foliation of some foliated submanifolds S of C^n, in particular Levi flat ones. As a general scheme, we suppose that S is bounded along a coordinate (or a subset of coordinates),…
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…