Related papers: Row-Factorization Matrices in Arf Numerical Semigr…
We consider the class $\mathcal{A}_0$ of Abelian block-rigid $CRQ$-groups of ring type. A subgroup $A$ of an Abelian group $G$ is called an \textsf{absolute ideal} of the group $G$ if $A$ is an ideal in any ring on $G$. We describe…
We study the subgroup structure of the semigroup of finitary tropical matrices under multiplication. We show that every maximal subgroup is isomorphic to the full linear automorphism group of a related tropical polytope, and that each of…
We present a new probabilistic modelling framework based on the recent notion of normal factor graph (NFG). We show that the proposed NFG models and their transformations unify some existing models such as factor graphs, convolutional…
In 2011, a topic containing the concepts of upper and lower periodic subsets of (basic) algebraic structures was introduced and studied. The concept of ``upper periodic subsets'' can be considered as a generalized topic of ideals and…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
Let $\mathfrak{g}$ be a Lie superalgebra of type $\mathfrak{sl}$ or $\mathfrak{osp}$ with an odd principal nilpotent element $f$. We consider a matrix $\mathcal{A}_{\mathfrak{g},f}$ determined by $\mathfrak{g}$ and $f$ and find a generating…
We study certain groups and ideals arising from the chip-firing game on a generalisation of graphs called pargraphs. Several well-known families of toric ideals arise as toppling ideals of pargraphs. These include ideals defining rational…
A numerical semigroup is a co-finite submonoid of the monoid of non-negative integers under addition. Many properties of numerical semigroups rely on some fundamental invariants, such as, among others, the set of gaps (and its cardinality),…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
With the wide-spread availability of complex relational data, semi-supervised node classification in graphs has become a central machine learning problem. Graph neural networks are a recent class of easy-to-train and accurate methods for…
This paper extends the study of group algebras of finite groups in which the socle of the center is an ideal. We provide a detailed analysis of the structure of these groups. In a particular case, we reach a complete characterization of the…
Let $A$ be a finite-dimensional associative $k$-algebra with identity. The primary aim of this paper is to study the rationality properties of the group of all $k$-algebra automorphisms of $A$, as an affine algebraic group over an arbitrary…
The method of \emph{random integral representation}, that is, the method of representing a given probability measure as the probability distribution of some random integral, was quite successful in the past few decades. In this note we will…
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…
We define a reflective numerical semigroup of genus $g$ as a numerical semigroup that has a certain reflective symmetry when viewed within $\mathbb{Z}$ as an array with $g$ columns. Equivalently, a reflective numerical semigroup has one gap…
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…
Boolean matrix factorization (BMF) has many applications in data mining, bioinformatics, and network analysis. The goal of BMF is to decompose a given binary matrix as the Boolean product of two smaller binary matrices, revealing underlying…
We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…