Related papers: Profile and hereditary classes of ordered relation…

Dlab and Ringel showed that algebras being quasi-hereditary in all total orders for indices of primitive idempotents becomes hereditary. So, we are interested in for which orders a given quasi-hereditary algebra is again quasi-hereditary.…

We consider core-periphery structured graphs, which are graphs with a group of densely and sparsely connected nodes, respectively, referred to as core and periphery nodes. The so-called core score of a node is related to the likelihood of…

We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a conjecture that all well-quasi-ordered permutation classes have algebraic generating functions, and in…

A quasi-hereditary algebra is an Artin algebra together with a partial order on its set of isomorphism classes of simple modules which satisfies certain conditions. In this article we investigate all the possible choices that yield to…

To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…

Let $k$ be a field of characteristic $0$, let $\mathsf{C}$ be a finite split category, let $\alpha$ be a 2-cocycle of $\mathsf{C}$ with values in the multiplicative group of $k$, and consider the resulting twisted category algebra…

We consider the following general model of a sorting procedure: we fix a hereditary permutation class $\mathcal{C}$, which corresponds to the operations that the procedure is allowed to perform in a single step. The input of sorting is a…

We investigate the properties of the intersection $\mathrm{Int}_{\mathfrak{F}}(G)$ of all $\mathfrak{F}$-maximal subgroups of a finite group $G$ for a hereditary formation $\mathfrak{F}$ of finite groups. We prove that…

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

Let $\mathfrak F$ be a class of groups. A group $G$ is called $ca$-$\mathfrak F$-group if its every non-abelian chief factor is simple and $H/K \leftthreetimes C_G(H/K) \in \mathfrak F$ for every abelian chief factor $H/K$ of $G$. In this…

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…

We study the coset covering function $\mathfrak{C}(r)$ of a finitely generated group: the number of cosets of infinite index subgroups needed to cover the ball of radius $r$. We show that $\mathfrak{C}(r)$ is of order at least $\sqrt{r}$…

Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…

This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider such classes that are \emph{minimal prime}: classes that…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

In this paper some properties of the $\mathfrak{F}^*$-hypercenter of a finite group are studied where $\mathfrak{F}^*$ is the class of all finite quasi-$\mathfrak{F}$-groups for a hereditary saturated formation $\mathfrak{F}$ of finite…

We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…