Related papers: A good leaf order on simplicial trees
A monomial ideal $I$ admits a Betti splitting $I=J+K$ if the Betti numbers of $I$ can be determined in terms of the Betti numbers of the ideals $J,K$ and $J \cap K$. Given a monomial ideal $I$, we prove that $I=J+K$ is a Betti splitting of…
We give a formula to compute all the top degree graded Betti numbers of the path ideal of a cycle. Also we will find a criterion to determine when Betti numbers of this ideal are non zero and give a formula to compute its projective…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.
Let X and Y be two smooth projective n-dimensional algebraic varieties X and Y over C with trivial canonical line bundles. We use methods of p-adic analysis on algebraic varieties over local number fields to prove that if X and Y are…
A tree, embedded into plane, is a dessin d'enfant and its Belyi function is a polynomial --- Shabat polynomial. The Zapponi form of this polynomial is unique, so we can correspond to an embedded tree the Julia set of its Shabat-Zapponi…
Let $k$ be a field and $R=k[x_1,\ldots,x_n]/I=S/I$ a graded ring. Then $R$ has a $t$-linear resolution if $I$ is generated by homogeneous elements of degree $t$, and all higher syzygies are linear. Thus $R$ has a $t$-linear resolution if…
We state and solve a discrete version of the classical Riemann-Hilbert problem. In particular, we associate a Riemann-Hilbert problem to every dessin d'enfants. We show how to compute the solution for a dessin that is a tree. This amounts…
Let $G$ be the circulant graph $C_n(S)$ with $S \subseteq \{1, 2, \dots, \lfloor \frac{n}{2} \rfloor\}$, and let $I(G)$ denote the edge ideal in the polynomial ring $R=\mathbb{K}[x_0, x_1, \dots, x_{n-1}]$ over a field $\mathbb{K}$. In this…
We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…
We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are…
We characterize componentwise linear monomial ideals with minimal Taylor resolution and consider the lower bound for the Betti numbers of componentwise linear ideals.
We extend a result of Caviglia and Sbarra to a polynomial ring with base field of any characteristic. Given a homogeneous ideal containing both a piecewise lex ideal and an ideal generated by powers of the variables, we find a lex ideal…
In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
We study the Betti tables of reducible algebraic curves with a focus on connected line arrangements and provide a general formula for computing the quadratic strand of the Betti table for line arrangements that satisfy certain hypotheses.…
A Betti splitting $I=J+K$ of a monomial ideal $I$ ensures the recovery of the graded Betti numbers of $I$ starting from those of $J,K$ and $J \cap K$. In this paper, we introduce this condition for simplicial complexes, and, by using…
Let $\Delta$ be a root system with a subset of positive roots, $\Delta^+$. We consider edges of the Hasse diagrams of some posets associated with $\Delta^+$. For each edge one naturally defines its type, and we study the partition of the…
Existing ordinal trees and random forests typically use scores that are assigned to the ordered categories, which implies that a higher scale level is used. Versions of ordinal trees are proposed that take the scale level seriously and…
Peca suggested in a recent paper on the arxiv to consider binary butterfly trees and their Horton-Strahler numbers. The trees are obtained by glueing two binary trees together in a special way; the results are again binary trees but with a…