Related papers: A combinatorial approach to the structure of local…
In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of…
Here we introduce the notion of (left, right) $\pi$-$t$-simple, right $\pi$-inverse ordered semigroups and discuss characterizations and relationships concerning them. Semilattice decomposition of left $\pi$-$t$-simple ordered semigroups…
Relying on the notions of submodular function and partial metric, we introduce normed inverse semigroups as a generalization of normed groups and sup-semilattices equipped with an upper valuation. We define the property of skew-convexity…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
The class of word-representable graphs, introduced in connection with the study of the Perkins semigroup by Kitaev and Seif, has attracted significant attention in combinatorics and theoretical computer science due to its deep connections…
We study isometric representations of the semigroup $\mathbb{Z}_+\backslash \{1\}$. Notion of an inverse representation is introduced and a complete description (up to unitary equivalence) of such representations is given. Also, we study a…
To an inverse semigroup, we associate an \'etale groupoid such that its actions on topological spaces are equivalent to actions of the inverse semigroup. Both the object and the arrow space of this groupoid are non-Hausdorff. We show that…
We characterize the inverse semigroups that are Morita equivalent to graph inverse semigroups. We also consider a generalization to inverse semigroups associated with left cancellative categories.
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…
We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set $ {\mathcal E} ={\mathcal E}^- \cup{\mathcal E}^+$. With additionally given a relation $\mathcal R$ between the edges in…
Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…
Graphs have become increasingly popular in modeling structures and interactions in a wide variety of problems during the last decade. Graph-based clustering and semi-supervised classification techniques have shown impressive performance.…
The representation theory of left regular band semigroup algebras is well-studied and known to have close connections with combinatorial topology, as established in the work of Margolis--Saliola--Steinberg ('15, '21). In this paper, we…
This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…
The idea of applying isoperimetric functions to group theory is due to M.Gromov. We introduce the concept of a ``bicombing of narrow shape'' which generalizes the usual notion of bicombing. Our bicombing is related to but different from the…