Related papers: Tree Pairs for Algebraic Bieri-Strebel Groups

Let~$E$ be a Hilbertian field of characteristic~$0$. R.W.K. Odoni conjectured that for every positive integer~$n$ there exists a polynomial~$f\in E[X]$ of degree~$n$ such that each iterate~$f^{\circ{k}}$ of~$f$ is irreducible and the Galois…

In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…

The Weil representation of the symplectic group associated to a finite abelian group of odd order is shown to have a multiplicity-free decomposition. When the abelian group is p-primary, the irreducible representations occurring in the Weil…

We describe a completely algebraic axiom system for intertwining operators of vertex algebra modules, using algebraic flat connections, thus formulating the concept of a {\em tree algebra}. Using the Riemann-Hilbert correspondence, we…

Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…

We develop the theory of integrable representations for an arbitrary maximal parabolic subalgebra of an affine Lie algebra. We see that such subalgebras can be thought of as arising in a natural way from a Borel--de Siebenthal pair of…

We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on…

A tree diagram is a tree with positive integral weight on each edge, which is a notion generalized from the Dynkin diagrams of finite-dimensional simple Lie algebras. We introduce two nilpotent Lie algebras and their extended solvable Lie…

Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The right-hand side can be…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Recent work by a number of people has shown that complex reflection groups give rise to many representation-theoretic structures (e.g., generic degrees and families of characters), as though they were Weyl groups of algebraic groups.…

Given a Borel class of trees, we show that there is a tree in that class whose Scott sentence is not too much more complicated than the definition of the class. In particular, if the class is definable by a $\Pi_\alpha$ sentence, then there…

In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…

We give a simple formula for the number of hypertrees with $k$ hyperedges of given sizes and $n+1$ labelled vertices with prescribed degrees. A slight generalization of this formula counts labelled bipartite trees with prescribed degrees in…

We consider quotients of the group algebra of the $3$-string braid group $B_3$ by $p$-th order generic polynomial relations on the elementary braids. In cases $p=2,3,4,5$ these quotient algebras are finite dimensional. We give…

This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree…

We study graded and ungraded singularity categories of some commutative Gorenstein toric singularities, namely, Veronese subrings of polynomial rings, and Segre products of some copies of polynomial rings. We show that the graded…

In this paper, we address the problem of packing large trees in $G_{n,p}$. In particular, we prove the following result. Suppose that $T_1, \dotsc, T_N$ are $n$-vertex trees, each of which has maximum degree at most $(np)^{1/6} / (\log…

This paper considers the conjecture by Gr\"unbaum that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 3. Here, the co-tree of $T$ is the spanning tree of the dual…

We establish relations between representation dimensions of two algebras connected by a Frobenius bimodule or extension. Consequently, upper bounds and equality formulas for representation dimensions of group algebras, symmetric separably…