Related papers: Tree Pairs for Algebraic Bieri-Strebel Groups
We prove that for any pair of constants $\epsilon>0$ and $\Delta$ and for $n$ sufficiently large, every family of trees of orders at most $n$, maximum degrees at most $\Delta$, and with at most $\binom{n}{2}$ edges in total packs into…
Given a spanning tree $T$ of a planar graph $G$, the co-tree of $T$ is the spanning tree of the dual graph $G^*$ with edge set $(E(G)-E(T))^*$. Gr\"unbaum conjectured in 1970 that every planar 3-connected graph $G$ contains a spanning tree…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
In this paper we study higher level Deligne--Lusztig representations of reductive groups over discrete valuation rings, with finite residue field $\mathbb{F}_q$. In previous work we proved that, at even levels, these geometrically…
In a Borel subalgebra U(B) of the sl(2) loop algebra, we introduce a highest weight vector $\Psi$. We call such a representation of U(B) that is generated by $\Psi$ highest weight. We define a generalization of the Drinfeld polynomial for a…
We relate the combinatorics of Hall-Littlewood polynomials to that of abelian $p$-groups with alternating or Hermitian perfect pairings. Our main result is an analogue of the classical relationship between the Hall algebra of abelian…
Furstenberg-Weiss have extended Szemer\'edi's theorem on arithmetic progressions to trees by showing that a large subset of the tree contains arbitrarily long arithmetic subtrees. We study higher dimensional versions that analogously extend…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
We describe the set of maximal orders in a 2-by-2 matrix algebra over a non-commutative local division algebra B containing a given suborder, for certain important families of such suborders, including rings of integers of division…
We present a streamlined exposition of a construction by R. Chen, A. Poulin, R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations generated by any locally-finite Borel graph such that each component is a…
The present paper is a continuation of [5], where Lie bialgebra structures on g[u] were studied. These structures fall into different classes labelled by the vertices of the extended Dynkin diagram of g. In [5] the Lie bialgebras…
We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it…
In this paper, we address the Ehrenborg's conjecture which proposes that for any bipartite graph the number of spanning trees does not exceed the product of the degrees of the vertices divided by the product of the sizes of the graph…
Explicit expressions for the Temperley-Lieb-Martin algebras, i.e., the quotients of the Hecke algebra that admit only representations corresponding to Young diagrams with a given maximum number of columns (or rows), are obtained, making…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
In 1996, Edelman and Reiner defined the two higher Stasheff--Tamari orders on triangulations of cyclic polytopes and conjectured them to coincide. We open up an algebraic angle for approaching this conjecture by showing how these orders…
We consider special cases of the two tree degree sequences problem. We show that if two tree degree sequences do not have common leaves then they always have edge-disjoint caterpillar realizations. By using a probabilistic method, we prove…
In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…
The first multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the products of degrees of pairs of adjacent vertices. In this paper,…
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…