English
Related papers

Related papers: Exceptional sequences and rooted labeled forests

200 papers

Exceptional modules are tree modules. A tree module usually has many tree bases and the corresponding coefficient quivers may look quite differently. The aim of this note is to introduce a class of exceptional modules which have a…

Representation Theory · Mathematics 2013-02-27 Claus Michael Ringel

The paper proposes a new variant of a decision tree, called an Extreme Learning Tree. It consists of an extremely random tree with non-linear data transformation, and a linear observer that provides predictions based on the leaf index where…

Machine Learning · Computer Science 2019-12-20 Anton Akusok , Emil Eirola , Kaj-Mikael Björk , Amaury Lendasse

We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\sqrt n$ by $\sqrt n$ grid. We also show that testing whether a given binary tree has…

Computational Geometry · Computer Science 2018-09-03 Hugo A. Akitaya , Maarten Löffler , Irene Parada

The Torsion Anomalous Conjecture states that an irreducible variety $V$ embedded in a semi-abelian variety contains only finitely many maximal $V$-torsion anomalous varieties. In this paper we consider an irreducible variety embedded in a…

Number Theory · Mathematics 2024-04-09 Sara Checcoli , Francesco Veneziano , Evelina Viada

We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…

Group Theory · Mathematics 2007-05-23 Ekaterina Pervova

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…

Combinatorics · Mathematics 2020-07-06 Marie-Louise Lackner , Alois Panholzer

We show that there exists a graph $G$ with $O(n)$ nodes, where any forest of $n$ nodes is a node-induced subgraph of $G$. Furthermore, for constant arboricity $k$, the result implies the existence of a graph with $O(n^k)$ nodes that…

Data Structures and Algorithms · Computer Science 2016-02-17 Stephen Alstrup , Søren Dahlgaard , Mathias Bæk Tejs Knudsen

We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…

Algebraic Geometry · Mathematics 2024-10-08 Pierrette Cassou-Noguès , Daniel Daigle

We characterise those basic and connected Nakayama algebras $\Lambda$ for which the mutation of $\tau$-exceptional sequences respects the braid group relations. We show that this is the case if and only if $\Lambda$ is hereditary or all…

Representation Theory · Mathematics 2026-01-07 Maximilian Kaipel , Håvard Utne Terland

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

Combinatorics · Mathematics 2025-05-16 Jay Lilian Kneip

Generalized linear and additive models are very efficient regression tools but the selection of relevant terms becomes difficult if higher order interactions are needed. In contrast, tree-based methods also known as recursive partitioning…

Methodology · Statistics 2015-04-21 Gerhard Tutz , Moritz Berger

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

We introduce the idea of a geometric categorical Lie algebra action on derived categories of coherent sheaves. The main result is that such an action induces an action of the braid group associated to the Lie algebra. The same proof shows…

Algebraic Geometry · Mathematics 2019-02-20 Sabin Cautis , Joel Kamnitzer

In a recent paper by K.-H. Lee, K. Lee and M. Mills, a mutation of reflections in the universal Coxeter group is defined in association with a mutation of a quiver. A matrix representation of these reflections is determined by a linear…

Representation Theory · Mathematics 2021-08-10 Tucker J. Ervin , Blake Jackson , Kyu-Hwan Lee , Kyungyong Lee

Let $\mathcal{O}_n$ be the set of ordered labeled trees on ${0,...,n}$. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study…

Combinatorics · Mathematics 2022-03-22 Seunghyun Seo , Heesung Shin

There is a natural action of the braid group on the symmetric matrices with units on the diagonal, appearing in various fields as Singularity Theory, Frobenius Manifolds or Isomonodromic deformations of certain classes of linear…

Mathematical Physics · Physics 2007-05-23 Alexandre Stefanov

Let V be the 7-dimensional irreducible representation of the quantum group U_q(g_2). For each n, there is a map from the braid group B_n to the endomorphism algebra of the n-th tensor power of V, given by R-matrices. We can extend this…

Quantum Algebra · Mathematics 2011-02-24 Scott Morrison

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…

Algebraic Geometry · Mathematics 2019-05-10 Francesco Polizzi

To a definable subset of Z_p^n (or to a scheme of finite type over Z_p) one can associate a tree in a natural way. It is known that the corresponding Poincare series P(X) = \sum_i N_i X^i is rational, where N_i is the number of nodes of the…

Algebraic Geometry · Mathematics 2010-09-20 Immanuel Halupczok

The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that the absolute differences induced on the edges are pairwise…

Combinatorics · Mathematics 2020-06-23 Anna Adamaszek , Peter Allen , Codrut Grosu , Jan Hladky
‹ Prev 1 3 4 5 6 7 10 Next ›