相关论文: Three Counterexamples on Semigraphoids
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…
We present a comonadic approach to pretorsion theories on semiexact categories, i.e. categories equipped with a closed ideal of null morphisms that admits all kernels and all cokernels. We first prove that bihereditary pretorsion theories…
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…
We formulate and prove relative versions of several classical decompositions known in the theory of Chevalley groups over commutative rings. As an application we obtain upper estimates for the width of principal congruence subgroups in…
To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…
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…
This work introduces a general theory of universal pseudomorphisms and develops their connection to diagrammatic coherence. The main results give hypotheses under which pseudomorphism coherence is equivalent to the coherence theory of…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers.…
We establish a correspondence between generalized quiver gauge theories in four dimensions and congruence subgroups of the modular group, hinging upon the trivalent graphs which arise in both. The gauge theories and the graphs are…
In this paper, we construct a new homology theory for semi-groups satisfying the self distributivity axiom or the idempotency axiom. Next, we consider the geometric realization corresponding to the homology theory. We continue with the…
We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…
We consider triangulations of surfaces with edges painted three colors so that edges of each triangle have different colors. Such structures arise as Belyi data (or Grothendieck dessins d'enfant), on the other hand they enumerate pairs of…
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…
In this paper, we investigate some characteristic features of holomorphic semigroups. In particular, we investigate nice examples of holomorphic semigroups whose every left or right ideal includes minimal ideal. These examples are compact…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
Retrieving cohesive subgraphs in networks is a fundamental problem in social network analysis and graph data management. These subgraphs can be used for marketing strategies or recommendation systems. Despite the introduction of numerous…