Related papers: Monoid algebras and graph products

We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…

We show that every commutative idempotent monoid (a.k.a lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr [J. Comb.~Theory, Ser.~B, 1980] and the degree bound is best-possible. On the other…

In this paper we introduce various associative products on the homology of the space of knots and singular knots in $S^n$. We prove that these products are related through a desingularization map. We also compute some of these products and…

We prove a theorem about the derivation algebra of the tensor product of two algebras. As an application, we determine the derivation algebra of the fixed point algebra of the tensor product of two algebras, with respect to the tensor…

We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…

Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…

We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex…

The enhanced power graph $\mathcal{P}_E(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this article, we…

We show that for any smooth Hausdorff manifolds M and N, which are not necessarily second countable, paracompact or connected, any isomorphism from the algebra of smooth (real or complex) functions on N to the algebra of smooth functions on…

We introduce a new algebraic construction, {\em monop}, that combines monoids (with respect to the product of species), and operads (monoids with respect to the substitution of species) in the same algebraic structure. By the use of…

As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…

We describe affine monoids whose group of invertible elements is an active semidirect product of a unipotent group and a torus, in terms of comultiplications on the algebra of regular functions. We introduce the notion of a root monoid,…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

This paper explores the structure of graphs defined by an excluded minor or an excluded odd minor through the lens of graph products and tree-decompositions. We prove that every graph excluding a fixed odd minor is contained in the strong…

We investigate the Galois coverings of piecewise algebras and more particularly their behaviour under derived equivalences. Under a technical assumption which is satisfied if the algebra is derived equivalent to a hereditary algebra, we…

In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…

We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…

Given a group $G$, let us connect two non-identity elements by an edge if and only if one is a power of another. This gives a graph structure on $G$ minus identity, called the reduced power graph. It is conjectured by Akbari and Ashrafi…

We prove various properties on the structure of groups whose power graph is chordal. Nilpotent groups with this property have been classified by Manna, Cameron and Mehatari [The Electronic Journal of Combinatorics, 2021]. Here we classify…

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…