Related papers: Incidence Monoids: Automorphisms and Complexity
We show that a monomial algebra $\Lambda$ over an algebraically closed field $K$ is self-injective if and only if each map $\mathrm{soc}(_{\Lambda}\Lambda)\to \ _{\Lambda}\Lambda$ can be extended to an endomorphism of $_{\Lambda}\Lambda$,…
We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.
In this paper we consider the monoids of all partial endomorphisms, of all partial weak endomorphisms, of all injective partial endomorphisms, of all partial strong endomorphisms and of all partial strong weak endomorphisms of a star graph…
To a plane algebraic curve of degree n, Moishezon associated a braid monodromy homomorphism from a finitely generated free group to Artin's braid group B_n. Using Hansen's polynomial covering space theory, we give a new interpretation of…
A twisting system is one of the major tools to study graded algebras, however, it is often difficult to construct a (non-algebraic) twisting system if a graded algebra is given by generators and relations. In this paper, we show that a…
We describe totally compatible structures on the Jacobson radical of the incidence algebra of a finite poset over a field. We show that such structures are in general non-proper.
This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…
We observe that if $R:=(I,\rho, J)$ is an incidence We observe that if $R:=(I,\rho, J)$ is an incidence structure, viewed as a matrix, then the topological closure of the set of columns is the Stone space of the Boolean algebra generated by…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
We provide a combinatorial recipe for constructing all posets of height at most two for which the corresponding type-A Lie poset algebra is contact. In the case that such posets are connected, a discrete Morse theory argument establishes…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…
We study the existence and left properness of transferred model structures for "monoid-like" objects in monoidal model categories. These include genuine monoids, but also all kinds of operads as for instance symmetric, cyclic, modular,…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
Let W be a Weyl group whose type is a simply laced Dynkin diagram. On several W-orbits of sets of mutually commuting reflections, a poset is described which plays a role in linear representatons of the corresponding Artin group A. The poset…
We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…
We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…
In this note, we define the Burnside ring of a monoid, generalizing the construction for groups. After giving foundational definitions, we characterize transitive M-sets and their automorphisms, then prove a structure theorem for a broad…
In this article, we consider the singularity of an arbitrary homogeneous polynomial with complex coefficients $f(x_0,\dots,x_n)$ at the origin of $\mathbb C^{n+1}$, via the study of the monodromy characteristic polynomials $\Delta_l(t)$,…
This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…