arXiv subjects

István Szöllősi

Publications and source records attributed to István Szöllősi.

6 recordsLinked to original sources

arXiv2024

The directed Cayley diameter and the Davenport constant

The directed Cayley diameter of a finite group is investigated in terms of the monoid of product-one sequences over the group, via the new notion of directed geodesic atoms. Two quantities associated to the set of directed geodesic atoms provide lower and upper bounds for the directed Cayley diameter. An algorithm for computing the directed geodesic atoms is implemented in GAP, and is applied to determine the above mentioned quantities for all non-abelian groups of order at most $42$, and for the alternating group of degree $5$. Furthermore, the small and large Davenport constants of all these groups are computed (excepting the large Davenport constant for $A_5$), extending thereby the formerly obtained results on the groups of order less than $32$. Along the way the directed Cayley diameter of a finite abelian group is expressed in terms of its invariants.

math.GR↗

arXiv2021

Proof of the tree module property for exceptional representations of tame quivers

This document serves as an arXiv entry point for the appendix to the paper [13] (the ancillary file e6_proof.pdf -- ``Proof of the tree module property for exceptional representations of the quiver $\widetilde{\mathbb{E}}_6$'') and the appendix to the paper [12] (the ancillary file d6_proof.pdf -- ``Proof of the tree module property for exceptional representations of the quiver $\widetilde{\mathbb{D}}_6$''). The ancillary files contain the computer generated part of the proofs of the main results in [13] respectively [12], giving a complete and general list of tree representations corresponding to exceptional modules over the path algebra of the canonically oriented Euclidean quiver $\widetilde{\mathbb{E}}_6$, respectively $\widetilde{\mathbb{D}}_6$. The proofs (involving induction and symbolic computation with block matrices) were partially generated by a purposefully developed computer software, outputting in a detailed step-by-step fashion as if written ``by hand''. We also give here a short theoretical introduction and an overview of the computational method used to prove the formulas given in the papers [13] and [12].

math.RT↗

arXiv2020

Schofield sequences in the Euclidean case

Let $k$ be a field and consider the path algebra $kQ$ of the quiver $Q$. A pair of indecomposable $kQ$-modules $(Y,X)$ is called an orthogonal exceptional pair if the modules are exceptional and $\operatorname{Hom}(X,Y)=\operatorname{Hom}(Y,X)=\operatorname{Ext}^{1}(X,Y)=0$. Denote by $\mathcal{F}(X,Y)$ the full subcategory of objects having filtration with factors $X$ and $Y$. By the theorem of Schofield if $Z$ is exceptional but not simple, then $Z\in\mathcal{F}(X,Y)$ for some orthogonal exceptional pair $(Y,X)$, and $Z$ is not a simple object in $\mathcal{F}(X,Y)$. In fact, there are precisely $s(Z)-1$ such pairs, where $s(Z)$ is the support of $Z$ (i.e the number of nonzero components in ${\underline\dim}Z$). Whereas it is easy to construct $Z$ given $X$ and $Y$, there is no convenient procedure yet to determine the possible modules $X$ (called Schofield submodules of $Z$) and then $Y$ (called Schofield factors of $Z$), when $Z$ is given. We present such an explicit procedure in the tame case, i.e when $Q$ is Euclidean.

math.RT↗

arXiv2018

The Noether numbers and the Davenport constants of the groups of order less than 32

The computation of the Noether numbers of all groups of order less than thirty-two is completed. It turns out that for these groups in non-modular characteristic the Noether number is attained on a multiplicity free representation, it is strictly monotone on subgroups and factor groups, and it does not depend on the characteristic. Algorithms are developed and used to determine the small and large Davenport constants of these groups. For each of these groups the Noether number is greater than the small Davenport constant, whereas the first example of a group whose Noether number exceeds the large Davenport constant is found, answering partially a question posed by Geroldinger and Grynkiewicz.

math.GR↗

arXiv2013

Ringel-Hall numbers and the Gabriel-Roiter submodules of simple homogeneous regular modules

Let k be an arbitrary field and Q an acyclic quiver of tame type. Consider the path algebra kQ and the category of finite dimensional right modules Mod kQ. In the first part of the paper we deduce that the Gabriel-Roiter inclusions in preprojective indecomposables and simple homogeneous regulars (with dimension the minimal radical vector) as well as their Gabriel-Roiter measures are field independent. Using this result we can prove in a more general setting a theorem by Bo Chen which states that the Gabriel-Roiter submodule of a simple homogeneous regular (with dimension the minimal radical vector) is a preprojective indecomposable of defect -1. The generalization consists in considering the originally missing case $\tilde E_8$ and using arbitrary fields (instead of algebraically closed ones). Our proof is based on the idea of Ringel (used in the Dynkin quiver context) of comparing all possible Ringel-Hall polynomials with the special form they take in case of a Gabriel-Roiter inclusion. For this purpose we compute (using a program written in GAP) a list of useful Ringel-Hall polynomials in tame cases.

math.RT↗

arXiv2013

Preinjective subfactors of preinjective Kronecker modules

Using a representation theoretical approach we give an explicit numerical characterization in terms of Kronecker invariants of the subfactor relation between two preinjective (and dually preprojective) Kronecker modules, describing explicitly a so called linking module as well. Preinjective (preprojective) Kronecker modules correspond to matrix pencils having only minimal indices for columns (respectively for rows). Thus our result gives a solution to the subpencil problem in these cases (including the completion), moreover the required computations are straightforward and can be carried out easily (both for checking the subpencil relation and constructing the completion pencils based on the linking module). We showcase our method by carrying out the computations on an explicit example.

math.RT↗