Related papers: Not each sequential effect algebra is sharply domi…

We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We…

We consider the functions in two variables on an arbitrary poset, for which the convolution operation is defined. We obtain the generalization of incidence algebra and describe its properties: invertibility, the Jackobson radical,…

In this paper we define and study dimension generalized effect algebras (DGEAs), i.e., Dedekind orthocomplete and centrally orthocomplete generalized effect algebras equipped with a dimension equivalence relation. Our theory is a bona fide…

We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…

We say that a formal deformation from an algebra $N$ to algebra $A$ is strongly flat if for every real number $e $ there is a real number $0<s<e$ such that this deformation specialised at $t=s$ gives an algebra isomorphic to $A$. We show…

A discrete group $\G$ is called rigidly symmetric if for every $C^*$-algebra $\A$ the projective tensor product $\ell^1(\G)\widehat\otimes\A$ is a symmetric Banach $^*$-algebra. For such a group we show that the twisted crossed product…

The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…

WE determine the existence of exact (efficient) doubly dominating sets in three famous structures and in their complement for arbitrary graphs.

The question of which separable C*-algebras have abelian central sequence algebras was raised and studied by Phillips ([Ph88]) and Ando-Kirchberg ([AK14]). In this paper we give a complete answer to their question: A separable C*-algebra…

A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…

We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover. Using…

A graph $G = (V, E)$ is called antimagic if there exists a bijective labelling $f : E \rightarrow \{1, 2, \ldots, |E|\}$ such that the vertex-sums of labels over edges incident to a given vertex are all distinct. In this paper, we extend…

Let $G=(V,E)$ be a graph. A subset $D$ of $V(G)$ is called a super dominating set if for every $v \in V(G)-D$ there exists an external private neighbour of $v$ with respect to $V(G)-D.$ The minimum cardinality of a super dominating set is…

We provide a unified approach, via deformations of incidence algebras, to several important types of representations with finiteness conditions, as well as the combinatorial algebras which produce them. We show that over finite dimensional…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

A set $S$ of vertices in a graph $G$ is a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in~$S$. An independent dominating set in $G$ is a dominating set of $G$ with the additional property that it is an…

We propose the conjecture that the domination number $\gamma(G)$ of a $\Delta$-regular graph $G$ with $\Delta\geq 1$ is always at most its edge domination number $\gamma_e(G)$, which coincides with the domination number of its line graph.…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

Let $G$ be a real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an arithmetic subgroup of $G$, and $T$ be a maximal $\mathbb{R}$-split torus. A trajectory in $G/\Gamma$ is divergent if eventually it leaves every compact subset. In…

A relational structure is \emph{strongly indivisible} if for every partition $M = X_0 \sqcup X_1$, the induced substructure on $X_0$ or $X_1$ is isomorphic to $\mathcal{M}$. Cameron (1997) showed that a graph is strongly indivisible if and…