Related papers: Tree Pairs for Algebraic Bieri-Strebel Groups
The conception of multi-alphabetical genetics is represented. Matrix forms of the representation of the multi-level system of molecular-genetic alphabets have revealed algebraic properties of this system. These properties are connected with…
We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…
We obtain a description of the irreducible representation algebra of the alternating group of degree four over the ring of 2-adic integers.
Recently, decision trees (DT) have been used as an explainable representation of controllers (a.k.a. strategies, policies, schedulers). Although they are often very efficient and produce small and understandable controllers for discrete…
We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid and category emedding results. We show that they are planar…
We introduce a family of extremal polynomials associated with the prolongation of a stratified nilpotent Lie algebra. These polynomials are related to a new algebraic characterization of abnormal subriemannian geodesics in stratified…
We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it.
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
We prove a non-abelian arboreal Galois group result for certain maps with non-real Julia set at an archimedean place. We investigate the question of determining which polynomials defined over $\mathbb{R}$ have real Julia set. Finally we…
We construct new pairs of orthogonal maximal abelian $*$-subalgebras of $M_6(\mathbb C)$, by classifying all self-adjoint complex Hadamard matrices of order 6. In particular, we exhibit a non-affine one-parameter family of non-equivalent…
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…
In this paper we give a new family of complete intersections which have the strong Lefschetz property. The family consists of (Artinian algebras defined by) ideals generated by power sum symmetric polynomials of consecutive degrees and of…
For a composition $f=f_1\circ\cdots \circ f_r$ of polynomials $f_i\in \mathbb Q[x]$ of degrees $d_i\geq 5$ with alternating or symmetric monodromy group, we show that the monodromy group of $f$ contains the iterated wreath product…
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,…
We develop further the techniques presented in [M. Mombelli. On the tensor product of bimodule categories over Hopf algebras. Preprint arXiv:1111.1610 ] to study bimodule categories over the representation categories of arbitrary…
In this paper we describe all indecomposable two-term partial tilting complexes over a Brauer tree algebra with multiplicity 1 using a criterion for a minimal projective presentation of a module to be a partial tilting complex. As an…
In [3] L.Zapponi studied the arithmetic of plane bipartite trees with prime number of edges. He obtained a lower bound on the degree of tree's definition field. Here we obtain a similar lower bound in the following case. There exists a…
We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…
A widely used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure is only concerned with the comparison of labeled trees of two…
The problems of maximizing the spectral radius and the number of spanning trees in a class of bipartite graphs with certain degree constraints are considered. In both the problems, the optimal graph is conjectured to be a Ferrers graph.…