Related papers: A combinatorial approach to the structure of local…
Inspired by results for graph $C^*$-algebras, we investigate connections between the ideal structure of an inverse semigroup $S$ and that of its tight $C^*$-algebra by relating ideals in $S$ to certain open invariant sets in the associated…
Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…
This paper is devoted to the presentation of combinatorial bialgebras whose coproduct is defined with the help of a commutative semigroup. We consider this setting in order to give a general framework which admits as special cases the…
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…
In contrast to classical strongly continuous semigroups, the study of bi-continuous semigroups comes with some freedom in the properties of the associated locally convex topology. This paper aims to give minimal assumptions in order to…
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…
Recently we have shown that the equivalence classes of metrics on the double of a metric space $X$ form an inverse semigroup. Here we define an inverse subsemigroup related to a family of isometric subspaces of $X$, which is more…
Given any quasi-countable, in particular any countable inverse semigroup $S$, we introduce a way to equip $S$ with a proper and right subinvariant extended metric. This generalizes the notion of proper, right invariant metrics for discrete…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
A simple observation, showing that every groupoid becomes an inverse semigroup after adding one element. In such inverse semigroups all idempotents are mutually orthogonal. This fact implies that every C*-algebra of a discrete groupoid is a…
A finite group $G$ admits an {\em oriented regular representation} if there exists a Cayley digraph of $G$ such that it has no digons and its automorphism group is isomorphic to $G$. Let $m$ be a positive integer. In this paper, we extend…
A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
We define and develop the infrastructure of homotopical inverse diagrams in categories with attributes. Specifically, given a category with attributes $C$ and an ordered homotopical inverse category $I$, we construct the category with…
In this work we discuss some appearances of semi-infinite combinatorics in representation theory. We propose a semi-infinite moment graph theory and we motivate it by considering the (not yet rigorously defined) geometric side of the story.…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
We propose a homology theory for locally compact spaces with ends in which the ends play a special role. The approach is motivated by results for graphs with ends, where it has been highly successful. But it was unclear how the original…