Related papers: Numerical semigroup tree: type-representation

We describe three algorithms to determine the stable, semistable, and torus-polystable loci of the GIT quotient of a projective variety by a reductive group. The algorithms are efficient when the group is semisimple. By using an…

Repetitions within a given genealogical tree provides some information about the degree of consanguineity of a population. They can be analyzed with techniques usually employed in statistical physics when dealing with fixed point…

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

Let $\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\mu_r+o(1))n$ for almost every tree of…

A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the…

Let $S$ and $\Delta$ be numerical semigroups. A numerical semigroup $S$ is an $\mathbf{I}(\Delta)$-{\it semigroup} if $S\backslash \{0\}$ is an ideal of $\Delta$. We will denote by $\mathcal{J}(\Delta)=\{S \mid S \text{ is an…

The representation category $\mathcal{A} = Rep(G,\epsilon)$ of a supergroup scheme $G$ has a largest proper tensor ideal, the ideal $\mathcal{N}$ of negligible morphisms. If we divide $\mathcal{A}$ by $\mathcal{N}$ we get the semisimple…

The degree distribution of an ordered tree $T$ with $n$ nodes is $\vec{n} = (n_0,\ldots,n_{n-1})$, where $n_i$ is the number of nodes in $T$ with $i$ children. Let $\mathcal{N}(\vec{n})$ be the number of trees with degree distribution…

For a numerical semigroup $S \subseteq \mathbb{N}$, let $m,e,c,g$ denote its multiplicity, embedding dimension, conductor and genus, respectively. Wilf's conjecture (1978) states that $e(c-g) \ge c$. As of 2023, Wilf's conjecture has been…

A subset $S$ of a group $G$ invariably generates $G$ if $G$ is generated by $\{ s^g(s) | s\in S\} $ for any choice of $g(s)\in G, s\in S$. In case $G$ is topological one defines similarly the notion of topological invariable generation. A…

This paper is focused on numerical semigroups and presents a simple construction, that we call dilatation, which, from a starting semigroup $S$, permits to get an infinite family of semigroups which share several properties with $S$. The…

Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…

A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with…

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

We give a formula for counting tree modules for the quiver S_g with g loops and one vertex in terms of tree modules on its universal cover. This formula, along with work of Helleloid and Rodriguez-Villegas, is used to show that the number…

We say that a finitely generated group $G$ has property (QT) if it acts isometrically on a finite product of quasi-trees so that orbit maps are quasi-isometric embeddings. A quasi-tree is a connected graph with path metric quasi-isometric…

This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…

Let T be a tree with an action of a finitely generated group G. Given a suitable equivalence relation on the set of edge stabilizers of T (such as commensurability, co-elementarity in a relatively hyperbolic group, or commutation in a…

Representations of Quantum Groups U_q (g_n), g_n any semi simple Lie algebra of rank n, are constructed from arbitrary representations of rank n-1 quantum groups for q a root of unity. Representations which have the maximal dimension and…