Related papers: A note on the combinatorial derivation of non-smal…

Given an infinite group $G$ and a subset $A$ of $G$ we let $\Delta(A) = {g \in G : |gA \cap A| =\infty}$ (this is sometimes called the combinatorial derivation of $A$). A subset $A$ of $G$ is called large if there exists a finite subset $F$…

Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…

Let G be a group and let k be a cardinal. A subset A of G is called left (right) k-large if there exists a subset F of G such that |F| < { and G = FA (G = AF). We say that A is k-large if A is left and right k-large. It is known that every…

A subgroup $\Delta\leq \Gamma$ is commensurated if $|\Delta:\Delta\cap \gamma\Delta\gamma^{-1}|<\infty$ for all $\gamma\in \Gamma$. We show a finitely generated branch group is just infinite if and only if every commensurated subgroup is…

We determine the finite groups $G$ in which every subset $A \subseteq G$ of cardinality dividing the order of $G$ is a \emph{factor}, i.e. has a complement $B \subseteq G$ of cardinality $|G|/|A|$ such that $G = A \cdot B$ or $G = B \cdot…

A subset of vertices $F$ in a graph $G$ is called a \emph{dissociation set} if the induced subgraph $G[F]$ of $G$ has maximum degree at most 1. A \emph{maximal dissociation set} of $G$ is a dissociation set which is not a proper subset of…

Let $(G,+)$ be an Abelian group. Given $h\in \mathbb{Z}^+$, a non-empty subset $A$ of $G$ is called an $S_h$-set if all the sums of $h$ distinct elements of $A$ are different. We extend the concept of $S_h$-set to a more general context in…

Let G be a finitely presented group, and let p be a prime. Then G is 'large' (respectively, 'p-large') if some normal subgroup with finite index (respectively, index a power of p) admits a non-abelian free quotient. This paper provides a…

Let $G$ be a finite abelian group. A nonempty subset $A$ in $G$ is called a basis of order $h$ if $hA=G$; when $hA \neq G$, it is called a nonbasis of order $h$. Our interest is in all possible sizes of $hA$ when $A$ is a nonbasis of order…

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

For a given combinatorial class $\mathcal{C}$ we study the class $\mathcal{G} = \mathrm{MSET}(\mathcal{C})$ satisfying the multiset construction, that is, any object in $\mathcal{G}$ is uniquely determined by a set of $\mathcal{C}$-objects…

Let $Y$ be a compact metric space, $G$ be a group acting by transformations on $Y$. For any infinite subset $A\subset Y$, we study the density of $gA$ for $g\in G$ and quantitative density of the set $\displaystyle{\bigcup_{g\in G_n}gA}$ by…

Let $G$ be a group and let $X$ be a transitive $G$-space. We classify the subsets of $X$ with respect to a translation invariant ideal $\mathcal{J}$ in the Boolean algebra of all subsets of $X$, introduce and apply the relative…

For a group $G$ and a natural number $m$, a subset $A$ of $G$ is called $m$-thin if, for each finite subset $F$ of $G$, there exists a finite subset $K$ of $G$ such that $|Fg\cap A|\leqslant m$ for every $g\in G\setminus K$. We show that…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

An algebraic integer is said large if all its real or complex embeddings have absolute value larger than $1$. An integral ideal is said \emph{large} if it admits a large generator. We investigate the notion of largeness, relating it to some…

Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on the set of conjugacy class sizes of $G$: this is the simple undirected graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, two…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the proper subgroups of $G$ and in which two vertices $H$ and $K$ are joined by an edge if and only if $G=\langle H,K\rangle.$ We prove that if there exists a…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…