Search

In his 1934 paper, G.Birkhoff poses the problem of classifying pairs $(G,U)$, where $G$ is an abelian group and $U\subset G$ a subgroup, up to automorphisms of $G$. In general, Birkhoff's Problem is not considered feasible. In this note, we fix a prime number $p$ and assume that $G$ is a direct sum of cyclic $p$-groups and $U\subset G$ is a subgroup. Under the assumption that the factor group $G/U$ is $p$-bounded, we show that each such pair $(G,U)$ has a unique direct sum decomposition into pairs of type $(\mathbb Z/(p^n),\mathbb Z/(p^n))$ or $(\mathbb Z/(p^n), (p))$. On the other hand, if we assume $U$ is a $p$-bounded subgroup of $G$ and in addition that $G/U$ is a direct sum of cyclic $p$-groups, we show that each such pair $(G,U)$ has a unique direct sum decomposition into pairs of type $(\mathbb Z/(p^n),0)$ or $(\mathbb Z/(p^n), (p^{n-1}))$. We generalize the above results to modules over commutative discrete valuation rings.

In the paper we investigate two partial orders on standard Young tableaux and show their applications in the theory of invariant subspaces of nilpotent linear operators., Comment: 29 pages

We prove the existence of Hall polynomials for $x^2$-bounded invariant subspaces of nilpotent linear operators.

Like the LR-tableau, a socle tableau is given as a skew diagram with certain entries. Unlike in the LR-tableau, the entries in the socle tableau are weakly increasing in each row, strictly increasing in each column and satisfy a modified lattice permutation property. In the study of embeddings of a subgroup in a finite abelian $p$-group, socle tableaux occur as isomorphism invariants, they are given by the socle series of the subgroup. We show that each socle tableau can be realized by some embedding. Moreover, the socle tableau of an embedding and the LR-tableau of the dual embedding determine each other.

In the paper we investigate an algorithmic associative binary operation $*$ on the set $\mathcal{LR}_1$ of Littlewood-Richardson tableaux with entries equal to one. We extend $*$ to an algorithmic nonassociative binary operation on the set $\mathcal{LR}_1\times \mathbb{N}$ and show that it is equivalent to the operation of taking the generic extensions of objects in the category of homomorphisms from semisimple nilpotent linear operators to nilpotent linear operators. Thus we get a combinatorial algorithm computing generic extensions in this category.

In this paper we generalize Kaplansky's combinatorial characterization of the isomorphism types of embeddings of a cyclic subgroup in a finite abelian group given in his 1951 book ``Infinite Abelian Groups''. For this we introduce partial maps on Littlewood-Richardson tableaux and show that they characterize the isomorphism types of finite direct sums of such cyclic embeddings., Comment: arXiv admin note: substantial text overlap with arXiv:1607.05640

The main aim of the paper is to present a~combinatorial algorithm that, applying Littlewood-Richardson tableaux with entries equal to $1$, computes generic extensions of semisimple invariant subspaces of nilpotent linear operators. Moreover, we discuss geometric properties of generic extensions and their connections with combinatorics.

For a partition $\beta$, denote by $N_\beta$ the nilpotent linear operator of Jordan type $\beta$. Given partitions $\beta$, $\gamma$, we investigate the representation space ${}_2{\mathbb V}_{\gamma}^\beta$ of all short exact sequences $$ \mathcal E: 0\to N_\alpha \to N_\beta \to N_\gamma \to 0$$ where $\alpha$ is any partition with each part at most 2. Due to the condition on $\alpha$, the isomorphism type of a sequence $\mathcal E$ is given by an arc diagram $\Delta$; denote by ${\mathbb V}_\Delta$ the subset of ${}_2{\mathbb V}_{\gamma}^\beta$ of all sequences isomorphic to $\mathcal E$. Thus, the space ${}_2{\mathbb V}_{\gamma}^\beta$ carries a stratification given by the subsets of type ${\mathbb V}_\Delta$. We compute the dimension of each stratum and show that the boundary of a stratum ${\mathbb V}_\Delta$ consists exactly of those ${\mathbb V}_{\Delta'}$ where $\Delta'$ is obtained from $\Delta$ by a non-empty sequence of arc moves of five possible types {\bf (A) -- (E)}. The case where all three partitions are fixed has been studied in [3] and [4]. There, arc moves of types {\bf (A) -- (D)} suffice to describe the boundary of a ${\mathbb V}_\Delta$ in ${\mathbb V}_{\alpha,\gamma}^\beta$. Our fifth move {\bf (E)}, "explosion", is needed to break up an arc into two poles to allow for changes in the partition $\alpha$.

In his 1951 book "Infinite Abelian Groups", Kaplansky gives a combinatorial characterization of the isomorphism types of embeddings of a cyclic subgroup in a finite abelian group. In this paper we first use partial maps on Littlewood-Richardson tableaux to generalize this result to finite direct sums of such embeddings. We then focus on an application to invariant subspaces of nilpotent linear operators. We develop a criterion to decide if two irreducible components in the representation space are in the boundary partial order.

In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both are algorithmic. The first of these proofs emphasizes links to the Bruhat order for the symmetric group and the second provides a more straightforward construction of the cover relations. This work is motivated by the known result that the equivalence of the two combinatorial orders leads to a description of the geometry of the representation space of invariant subspaces of nilpotent linear operators.

Given partitions $\alpha$, $\beta$, $\gamma$, the short exact sequences $0\to N_\alpha \to N_\beta \to N_\gamma \to 0$ of nilpotent linear operators of Jordan types $\alpha$, $\beta$, $\gamma$, respectively, define a constructible subset $\mathbb V_{\alpha,\gamma}^\beta$ of an affine variety. Geometrically, the varieties $\mathbb V_{\alpha,\gamma}^\beta$ are of particular interest as they occur naturally and since they typically consist of several irreducible components. In fact, each Littlewood-Richardson (LR-) tableau $\Gamma$ of shape $(\alpha,\beta,\gamma)$ contributes one irreducible component $\overline{\mathbb V}_\Gamma$. We consider the partial order $\Gamma\leq_{\sf bound}^*\widetilde{\Gamma}$ on LR-tableaux which is the transitive closure of the relation given by $\mathbb V_{\widetilde{\Gamma}}\cap \overline{\mathbb V}_\Gamma\neq \emptyset$. In this paper we compare the boundary relation with partial orders given by algebraic, combinatorial and geometric conditions. It is known that in the case where the parts of $\alpha$ are at most two, all those partial orders are equivalent. We prove that those partial orders are also equivalent in the case where $\beta\setminus\gamma$ is a horizontal and vertical strip. Moreover, we discuss how the orders differ in general.

We prove the existence of Hall polynomials for prinjective representations of finite partially ordered sets of finite prinjective type. In Section 4 we shortly discuss consequences of the existence of Hall polynomials, in particular, we are able to define a generic Ringel-Hall algebra for prinjective representations of posets of finite prinjective type.

We define and investigate nilpotent Lie algebras associated with quadratic forms. We also present their connections with Lie algebras and Ringel-Hall algebras associated with representation directed algebras.

Let $k$ be an algebraically closed field and $\alpha$, $\beta$, $\gamma$ be partitions. An algebraic group acts on the constructible set of short exact sequences of nilpotent $k$-linear operators of Jordan types $\alpha$, $\beta$, and $\gamma$, respectively; we are interested in the stratification given by the orbits in the case where all parts of $\alpha$ are at most 2. Geometric properties of the degeneration relation are controlled by the combinatorics of arc diagrams. The extended bubble sort algorithm is used to construct chains of orbits such that subsequent strata have dimension difference equal to one.

We study geometric properties of varieties associated with invariant subspaces of nilpotent operators. There are reductive algebraic groups acting on these varieties. We give dimensions of orbits of these actions. Moreover, a combinatorial characterization of the partial order given by degenerations is described.

We prove that the monoid of generic extensions of finite dimensional nilpotent $k[T]$-modules is isomorphic to the monoid of partitions (with addition of partitions). Moreover we give a combinatorial algorithm that calculates constant terms of classical Hall polynomials.

Let $B$ be a representation-finite $\mathbb{C}$-algebra. The $\mathbb{Z}$-Lie algebra $L(B)$ associated with $B$ has been defined by Ch. Riedtmann. If $B$ is representation-directed there is another $\mathbb{Z}$-Lie algebra associated with $B$ defined by C. M. Ringel and denoted by $\CK(B)$. We prove that the Lie algebras $L(B)$ and $\CK(B)$ are isomorphic for any representation-directed $\mathbb{C}$-algebra $B$., Comment: 17 pages