English
Related papers

Related papers: Tree Pairs for Algebraic Bieri-Strebel Groups

200 papers

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

Representation Theory · Mathematics 2026-02-24 Frank Lübeck

We prove some conditions for the existence of higher dimensional algebraic fibering of group extensions. This leads to various corollaries on incoherence of groups and some geometric examples of algebraic fibers of type $F_n$ but not…

Group Theory · Mathematics 2023-11-13 Dessislava H. Kochloukova , Stefano Vidussi

In this note we first consider a ternary matrix group related to the von Neumann regular semigroups and to the Artin braid group (in an algebraic way). The product of a special kind of ternary matrices (idempotent and of finite order)…

Group Theory · Mathematics 2021-04-28 Steven Duplij

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

Combinatorics · Mathematics 2020-02-20 José Aliste-Prieto , Anna de Mier , José Zamora

For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding…

Discrete Mathematics · Computer Science 2007-07-17 R. R. Kamalian , V. V. Mkrtchyan

We study the possible values of the matching number among all trees with a given degree sequence as well as all bipartite graphs with a given bipartite degree sequence. For tree degree sequences, we obtain closed formulas for the possible…

Combinatorics · Mathematics 2018-08-30 F. Bock , D. Rautenbach

Jones conjectures the arboreal representation of a degree two rational map will have finite index in the full automorphism group of a binary rooted tree except under certain conditions. We prove a version of Jones' Conjecture for quadratic…

Number Theory · Mathematics 2018-04-20 Jamie Juul , Holly Krieger , Nicole Looper , Michelle Manes , Bianca Thompson , Laura Walton

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

Discrete statistical models supported on labelled event trees can be specified using so-called interpolating polynomials which are generalizations of generating functions. These admit a nested representation. A new algorithm exploits the…

Statistics Theory · Mathematics 2017-05-29 Christiane Görgen , Anna Bigatti , Eva Riccomagno , Jim Q. Smith

Motivated by a problem in complex dynamics, we examine the block structure of the natural action of monodromy groups on the tree of preimages of a generic point. We show that in many cases, including when the polynomial has prime power…

Dynamical Systems · Mathematics 2012-05-15 Rafe Jones , Han Peters

We give a method to construct new self-adjoint representations of the braid group. In particular, we give a family of irreducible self-adjoint representations of dimension arbitrarily large. Moreover we give sufficient conditions for a…

Representation Theory · Mathematics 2009-09-01 Claudia Maria Egea , Esther Galina

We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Achim Blumensath

Let $R$ and $B$ be two disjoint sets of points in the plane such that $|B|\leqslant |R|$, and no three points of $R\cup B$ are collinear. We show that the geometric complete bipartite graph $K(R,B)$ contains a non-crossing spanning tree…

Computational Geometry · Computer Science 2015-12-10 Ahmad Biniaz , Prosenjit Bose , Anil Maheshwari , Michiel Smid

When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…

Combinatorics · Mathematics 2012-10-11 Xiu-Mei Zhang , Xiao-Dong Zhang , Daniel Gray , Hua Wang

We develop a theory of group actions and coverings on Brauer graphs that parallels the theory of group actions and coverings of algebras. In particular, we show that any Brauer graph can be covered by a tower of coverings of Brauer graphs…

Representation Theory · Mathematics 2012-12-03 Edward L Green , Sibylle Schroll , Nicole Snashall

Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…

Algebraic Geometry · Mathematics 2025-10-14 Benjamin Dupont , Revekka Kyriakoglou , Vassilis Metaftsis , Efstratios Prassidis , Alexandros Singh

We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree realizations. This conjecture is known to be true for $2$ and…

Combinatorics · Mathematics 2017-04-12 Aravind Gollakota , William Hardt , Istvan Miklos

It is proven that for any representation over a field of characteristic 0 of the non-abelian semidirect product of a cyclic group of prime order p and the group of order 3 the corresponding algebra of polynomial invariants is generated by…

Representation Theory · Mathematics 2012-05-29 K. Cziszter

We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…

Machine Learning · Computer Science 2008-07-21 François Denis , Amaury Habrard , Rémi Gilleron , Marc Tommasi , Édouard Gilbert

In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…

Combinatorics · Mathematics 2024-11-11 Matteo Pegoraro
‹ Prev 1 2 3 10 Next ›