Related papers: Tree modules and counting polynomials

In the paper we generalize results of paper [12] for a $q$- component models on a Cayley tree of order $k\geq 2$. We generalize them in two directions: (1) from $k=2$ to any $k\geq 2;$ (2) from concrete examples (Potts and SOS models) of…

Let $U_q$ be the quantum group corresponding to a complex simple Lie algebra $\mathfrak g$ with root system $R$. Assume the quantum parameter $q\in \C$ is a root of unity. In this paper we study the extensions between simple modules in the…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known.…

In a 1995 paper Richard Stanley defined $X_G$, the symmetric chromatic polynomial of a Graph $G=(V,E)$. He then conjectured that $X_G$ distinguishes trees; a conjecture which still remains open. $X_G$ can be represented as a certain…

For a graph G, we construct two algebras, whose dimensions are both equal to the number of spanning trees of G. One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of…

In this article, we continue the study of a certain family of 2-Calabi-Yau tilted algebras, called dimer tree algebras. The terminology comes from the fact that these algebras can also be realized as quotients of dimer algebras on a disc.…

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

The number of "nonequivalent" Huffman codes of length r over an alphabet of size t has been studied frequently. Equivalently, the number of "nonequivalent" complete t-ary trees has been examined. We first survey the literature, unifying…

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…

Let $k$ be an algebraically closed field of characteristic $0$ or $p>2$. Let $\mathcal{G}$ be an affine supergroup scheme over $k$. We classify the indecomposable exact module categories over the tensor category ${\rm sCoh}_{\rm…

In this expository paper, we present a construction of tree modules and combine it with (infinite dimensional) tilting theory and relative Mittag-Leffler conditions in order to explore limits of the approximation theory of modules. We also…

We construct infinite families of trees whose independence polynomials violate log-concavity at an arbitrary number of indices. This affirmatively answers a question of D. Galvin.

We classify simple weight modules over infinite dimensional Weyl algebras and realize them using the action on certain localizations of the polynomial ring. We describe indecomposable projective and injective weight modules and deduce from…

The concept of pseudo q-factorization graphs was recently introduced by the last two authors as a combinatorial language which is suited for capturing certain properties of Drinfeld polynomials. Using certain known representation theoretic…

Given a connected undirected graph $G$, a spanning tree is a subgraph $T$ of $G$ such that $V(T) = V(G)$ and $T$ is a tree. A collection of $\ell$ spanning trees $T_1,\ldots,T_\ell$ is pairwise $k$-diverse if for every $i \neq j$, $|E(T_i)…

We compute the quiver of any monoid that has a basic algebra over an algebraically closed field of characteristic zero. More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term…

In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is…

We study a basis of the polynomial ring that we call forest polynomials. This family of polynomials is indexed by a combinatorial structure called indexed forests and permits several definitions, one of which involves flagged P-partitions.…

We examine the behavior of the sequences of $p$-adic valuations of quadratic polynomials with integer coefficients for an odd prime $p$ through tree representations. Under this representation, a finite tree corresponds to a periodic…