Related papers: A characterization of normal subgroups via n-close…
A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called normal if the right regular representation of $G$ is a normal subgroup in the full automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if…
A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a…
For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…
Let $ A$ be a subset of group $G_0$ with $|{A^{-1}A}|\le 2|A|-2.$ We show that there are an element $a\in A$ and a non-null proper subgroup $H$ of $G$ such that one of the following holds: \begin{itemize} \item $x^{-1}Hy \subset A^{-1}A,$…
Maximally embedding dimension (MED) numerical semigroups are a wide and interesting family, with some remarkable algebraic and combinatorial properties. Associated to any numerical semigroup one can construct a MED closure, as it is well…
We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…
Following G.Szasz [2] a subsemigroup I of semigroup S is called an interior ideal if SIS \subset I. In this paper we explore the classes of regular semigroup and its different subclasses by their interior ideals. Furthermore, we introduce…
Let $G$ be a finite group and $A$ be a normal subgroup of $G$. We denote by $ncc(A)$ the number of $G$-conjugacy classes of $A$ and $A$ is called $n$-decomposable, if $ncc(A)=n$. Set ${\cal K}_G = \{ncc(A)| A \lhd G \}$. Let $X$ be a…
For each of the notions of hypergraph quasirandomness that have been studied, we identify a large class of hypergraphs F so that every quasirandom hypergraph H admits a perfect F-packing. An informal statement of a special case of our…
Let $d(\cdot)$ denote the natural density on the positive integers. We characterize all sets $A,B$ with positive density satisfying $d(A+B)=d(A)+d(B)$, under the assumption that the two sets are not both contained in a proper finite union…
Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…
We investigate the size of subspaces in sumsets and show two main results. First, if A is a subset of F_2^n with density at least 1/2 - o(n^{-1/2}) then A+A contains a subspace of co-dimension 1. Secondly, if A is a subset of F_2^n with…
A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…
This paper covers some recent progress in the study of sg-open sets, sg-compact spaces, N-scattered spaces and some related concepts. A subset $A$ of a topological space $(X,\tau)$ is called sg-closed if the semi-closure of $A$ is included…
An automorphism $\alpha$ of a group $G$ is normal if it fixes every normal subgroup of $G$ setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively…
The additive closedness in the subset of an additive group is termed as r-value. The nature of closedness in different subsets of fixed size is observed as a spectrum of r-values. We enumerate r-values of subsets in finite fields of…
A subset $X$ of an Abelian group $G$ is called $semiaf\!fine$ if for every $x,y,z\in X$ the set $\{x+y-z,x-y+z\}$ intersects $X$. We prove that a subset $X$ of an Abelian group $G$ is semiaffine if and only if one of the following…
In this note, we fix a graph $H$ and ask into how many vertices can each vertex of a clique of size $n$ can be "split" such that the resulting graph is $H$-free. Formally: A graph is an $(n,k)$-graph if its vertex sets is a pairwise…
Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$. A set ${\cal H}$ of subgroups of $G$ is said to be a \emph{complete Hall $\sigma $-set} of $G$ if every member $\ne 1$ of ${\cal H}$ is a Hall…
It is well-known that a C-monoid is completely integrally closed if and only if its reduced class semigroup is a group and if this holds, then the C-monoid is a Krull monoid and the reduced class semigroup coincides with the usual class…