Related papers: The maximum distinguishing number of a group

A group law is said to be detectable in power subgroups if, for all coprime $m$ and $n$, a group $G$ satisfies the law if and only if the power subgroups $G^m$ and $G^n$ both satisfy the law. We prove that for all positive integers $c$,…

We show that the minimal number of colors for all effective $n$-colorings of a link with non-zero determinant is at least $1+\log_2 n$.

A subset of vertices in a graph $G$ is considered a maximal dissociation set if it induces a subgraph with vertex degree at most 1 and it is not contained within any other dissociation sets. In this paper, it is shown that for $n\geq 3$,…

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if for each set $\Omega$ upon which $G$ acts faithfully, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ that leaves invariant each of the $G$-orbits in the…

The dissociation number ${\rm diss}(G)$ of a graph $G$ is the maximum order of a set of vertices of $G$ inducing a subgraph that is of maximum degree at most $1$. Computing the dissociation number of a given graph is algorithmically hard…

A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex…

Let G be a finitely generated linear group over a field of characteristic 0. Suppose that every solvable subgroup of G is polycyclic. Then the claim is made that any solvable subgroup of G is separable. This is proven for G=SL_n(Z).…

Let x be an element of a group G. For a positive integer n let E_n(x) be the subgroup generated by all commutators [...[[y,x],x],...,x] over y in G, where x is repeated n times. There are several recent results showing that certain…

A graph $G$ is $D$-distinguishable if there is a labeling of its vertices with $D$ labels such that the only automorphism of $G$ which preserves the labeling is the identity. The distinguishing number of $G$ is the minimum value $D$ for…

The action dimension of a group G is the minimal dimension of a contractible manifold that G acts on properly discontinuously. We show that if G acts properly and cocompactly on a thick Euclidean building, then the action dimension is…

A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We show that every planar graph without cycles of length 4 or 5 is…

We prove that there exists an integer-valued function f on positive integers such that if a finite group G has at most k real-valued irreducible characters, then |G/Sol(G)| is at most f(k), where Sol(G) denotes the largest solvable normal…

We prove that for any graph $G$, the total chromatic number of $G$ is at most $\Delta(G)+2\left\lceil \frac{|V(G)|}{\Delta(G)+1} \right\rceil$. This saves one color in comparison with a result of Hind from 1992. In particular, our result…

A cyclic coloring of a plane graph $G$ is a coloring of its vertices such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a plane graph $G$ is its cyclic chromatic number…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

A subset $B$ of an Abelian group $G$ is called a difference basis of $G$ if each element $g\in G$ can be written as the difference $g=a-b$ of some elements $a,b\in B$. The smallest cardinality $|B|$ of a difference basis $B\subset G$ is…

Let D be an infinite division ring, n a natural number and N a subnormal subgroup of GLn(D) such that n = 1 or the center of D contains at least five elements. This paper contains two main results. In the first one we prove that each…

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of the finite group $G$. We prove that if $G$ is a group with $\lambda(G) \leqslant 6$, then $G$ is supersolvable. We also describe the structure of the groups…

In this note, we consider all possible extensions G of a non-trivial perfect group H acting faithfully on a K3 surface X. The pair (X, G) is proved to be uniquely determined by G if the transcendental value of G is maximum. In particular,…

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…