English
Related papers

Related papers: Tree modules and counting polynomials

200 papers

For a labelled tree on the vertex set $[n]:=\{1,2,..., n\}$, define the direction of each edge $ij$ to be $i\to j$ if $i<j$. The indegree sequence of $T$ can be considered as a partition $\lambda \vdash n-1$. The enumeration of trees with a…

Combinatorics · Mathematics 2009-04-02 Rosena R. X. Du , Jingbin Yin

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

Combinatorics · Mathematics 2007-05-23 Gus Wiseman

We prove that the number of indecomposable vector bundles of fixed rank r and degree d over a smooth projective curve X defined over a finite field is given by a polynomial (depending only on the pair (r,d) and the genus g of X) in the Weil…

Algebraic Geometry · Mathematics 2014-10-07 Olivier Schiffmann

Given a squarefree monomial ideal $I$ of a polynomial ring $Q$, we show that if the minimal free resolution $\mathbb{F}$ of $Q/I$ admits the structure of a differential graded (dg) algebra, then so does any ``pruning" of $\mathbb{F}$. In…

Commutative Algebra · Mathematics 2026-05-07 Hugh Geller , Desiree Martin , Henry Potts-Rubin

Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…

Combinatorics · Mathematics 2026-02-11 Helia Karisani , Mohammadreza Daneshvaramoli

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

Combinatorics · Mathematics 2018-07-24 Ghodratollah Aalipour , Art M. Duval , Woong Kook , Kang-Ju Lee , Jeremy L. Martin

The free abelian group R(Q) on the set of indecomposable representations of a quiver Q, over a field K, has a ring structure where the multiplication is given by the tensor product. We show that if Q is a rooted tree (an oriented tree with…

Representation Theory · Mathematics 2019-12-19 Ryan Kinser

The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. In this…

Number Theory · Mathematics 2020-04-17 Melvyn B. Nathanson

In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In…

Combinatorics · Mathematics 2023-03-02 Michele D'Adderio , Alessandro Iraci , Yvan LeBorgne , Marino Romero , Anna Vanden Wyngaerd

A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…

Number Theory · Mathematics 2013-06-19 F. Pakovich , A. Zvonkin

We explore methods for constructing normal forms of indecomposable quiver representations. The first part of the paper develops homological tools for recursively constructing families of indecomposable representations from indecomposables…

Representation Theory · Mathematics 2019-10-29 Ryan Kinser , Thorsten Weist

We determine the regular irreducible components of the variety mod(A,d), where A=kQ/I is a string algebra and I is generated by a set of paths of length two. Our case is among the first examples of descriptions of irreducible components,…

Representation Theory · Mathematics 2011-10-20 M. Rutscho

Let $T$ be a weighted tree. The weight of a subtree $T_1$ of $T$ is defined as the product of weights of vertices and edges of $T_1$. We obtain a linear-time algorithm to count the sum of weights of subtrees of $T$. As applications, we…

Combinatorics · Mathematics 2007-05-23 Weigen Yan , Yeong-Nan Yeh

We continue study of some algebraic varieties (called resultantal varieties) started in a paper of A. Grishkov, D. Logachev "Resultantal varieties related to zeroes of L-functions of Carlitz modules". These varieties are related with the…

Algebraic Geometry · Mathematics 2021-12-14 Aleksandr Grishkov , Dmitry Logachev , Aleksey Zobnin

Let $g$ be a finite dimensional simple Lie algebra. Denote by $\mathcal B$ the category of all bounded weight $g$-modules, i.e. those which are direct sum of their weight spaces and have uniformly bounded weight multiplicities. A result of…

Representation Theory · Mathematics 2007-05-23 Dimitar Grantcharov , Vera Serganova

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

Number Theory · Mathematics 2020-05-20 Yağmur Çakıroğlu , Oğuz Yayla , Emrah Sercan Yılmaz

Any algebraic connection on a vector bundle on a smooth complex algebraic curve determines an irregular class and in turn a fission tree at each puncture. The fission trees are the discrete data classifying the admissible deformation…

Algebraic Geometry · Mathematics 2025-12-02 Philip Boalch

As a homomorphic image of the hyperalgebra $U_{q,R}(m|n)$ associated with the quantum linear supergroup $U_\upsilon(\mathfrak{gl}_{m|n})$, we first give a presentation for the $q$-Schur superalgebra $S_{q,R}(m|n,r)$ over a commutative ring…

Representation Theory · Mathematics 2018-05-29 Jie Du , Yanan Lin , Zhongguo Zhou

We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…

Symbolic Computation · Computer Science 2017-05-31 Vincent Neiger , Johan Rosenkilde , Eric Schost

Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…

Number Theory · Mathematics 2007-10-16 K. Kononen , M. Moisio , M. Rinta-aho , K. Vaananen