Related papers: Betti graphs and atomization of Puiseux monoids

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

Let $\mathbb{N}_0$ denote the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An integer additive set-indexer (IASI) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that…

The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the…

The $M$-polynomial of a graph $G$ is defined as $\sum_{i\le j} m_{i,j}(G)x^iy^j$, where $m_{i,j}(G)$, $i,j\ge 1$, is the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. Knowing the $M$-polynomial, formulas for bond…

The aim of the paper is to give a full classification of factorizations of groups in terms of descent cohomology (pointed) sets introduced in [5]. We show that descent cohomology includes Serre's non-abelian group cohomology as a special…

In 2011, Anderson and Frazier define the concept of $\tau_{(n)}$-factorization, where $\tau_{(n)}$ is a restriction of the modulo $n$ equivalence relation. These relations have been worked mostly for small values of $n$. However, it is…

Given a monoid $H$ (written multiplicatively), the family $\mathcal{P}_{\mathrm{fin},1}(H)$ of all non-empty finite subsets of $H$ containing the identity element $1_H$ is itself a monoid, called the reduced finitary power monoid of $H$,…

Given a finite group $G$ and a subset $S\subseteq G,$ the bi-Cayley graph $\bcay(G,S)$ is the graph whose vertex set is $G \times \{0,1\}$ and edge set is $\{\{(x,0),(s x,1)\} : x \in G, s\in S \}$. A bi-Cayley graph $\bcay(G,S)$ is called…

The following problem has been known since the 80s. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $\{m_i\}_{i=1}^{t}$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…

We define computational atoms named "actions" equipped primarily with three operations: reduction, collection, and inspection. We show how actions can be used for decision-making algorithms from simple axioms. We describe the encodings of…

Given a graph $G=(V,E)$, a set of vertices $D\subseteq V $ is called a dominating set if every vertex in $V\backslash D$ is adjacent to a vertex in $D$, and a subset $B\subseteq V $ is called a nonblocking set if $V-B$ is a dominating set.…

We give a model-theoretic characterization of the class of geometric theories classified by an atomic topos having enough points; in particular, we show that every complete geometric theory classified by an atomic topos is countably…

The disjoint union of mapping class groups of surfaces forms a braided monoidal category $\mathcal M$, as the disjoint union of the braid groups $\mathcal B$ does. We give a concrete, and geometric meaning of the braiding $\beta_{r,s}$ in…

A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…

We study the following problem. Given a multiset $M$ of non-negative integers, decide whether there exist and, in the positive case, compute two non-trivial multisets whose Minkowski sum is equal to $M$. The Minkowski sum of two multisets A…

Kontsevich's graphs allow encoding multi-vectors whose coefficients are differential-polynomial in the coefficients of a given Poisson bracket on an affine real manifold. Encoding formulas by directed graphs adapts to the class of…

We study the semigroup of non-injective monoid endomorphisms of the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ with a two-elements family $\mathscr{F}$ of inductive nonempty subsets of $\omega$. We describe the structure of elements…

In this study, a new alternative model algorithm has been proposed for assembling amorphous structures, unifying the bosonic paradigm applicable at low temperatures with crystalline models relevant at room and higher temperatures. Physical…

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…

This paper presents two facets. First, we show that the periodic table of chemical elements can be described, understood and modified (as far as its format is concerned) on the basis of group theory and more specifically by using the group…