English
Related papers

Related papers: Maximal subset of pairwise non-commuting elements …

200 papers

An element of a finitely generated non-Abelian free group F(X) is said to be filling if that element has positive translation length in every very small action of F(X) on an $\mathbb{R}$-tree. We give a proof that the set of filling…

Group Theory · Mathematics 2010-07-26 Brent B. Solie

A quasigroup $Q$ is called maximally nonassociative if for $x,y,z\in Q$ we have that $x\cdot (y\cdot z) = (x\cdot y)\cdot z$ only if $x=y=z$. We show that, with finitely many exceptions, there exists a maximally nonassociative quasigroup of…

Combinatorics · Mathematics 2021-07-09 Ales Drapal , Ian M. Wanless

We show that the set of all commuting probabilities in finite rings is a subset of the set of all commuting probabilities in finite nilpotent groups of class $\le2$. We believe that these two sets are equal; we prove they are equal, when…

Rings and Algebras · Mathematics 2020-10-06 Martin Juráš , Mihail Ursul

In this paper, we study gapsets and we focus on obtaining information on how the maximum distance between to consecutive elements influences the behaviour of the set. In particular, we prove that the cardinality of the set of gapsets with…

Combinatorics · Mathematics 2022-01-25 Gilberto B. Almeida Filho , Matheus Bernardini

For a non-abelian group $G$, its commuting conjugacy class graph $\mathcal{CCC}(G)$ is a simple undirected graph whose vertex set is the set of conjugacy classes of the non-central elements of $G$ and two distinct vertices $x^G$ and $y^G$…

Group Theory · Mathematics 2020-06-09 Parthajit Bhowal , Rajat Kanti Nath

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

Group Theory · Mathematics 2022-03-03 Daniele Garzoni , Andrea Lucchini

The set of all centralizers of elements in a finite group $G$ is denoted by $Cent(G)$ and $G$ is called $n-$centralizer if $|Cent(G)| = n$. In this paper, the structure of centralizers in a non-abelian finite group $G$ with this property…

Group Theory · Mathematics 2021-01-25 A. R. Ashrafi , M. A. Salahshour

The existence of maximal subrings in certain non-commutative rings, especially in rings which are integral over their centers, are investigated. We prove that if a ring $T$ is integral over its center, then either $T$ has a maximal subring…

Rings and Algebras · Mathematics 2024-10-16 Alborz Azarang

Recent investigations on the set of commutators between the elements of a finite group having relatively prime orders have prompt us to propose a variant of the Ore conjecture: For every finite non-abelian simple group and for every $g\in…

Group Theory · Mathematics 2025-04-07 Andrea Lucchini , Pablo Spiga

Let $G(X,Y)$ be a connected, non-complete bipartite graph with $|X|\leq |Y|$. An independent set $A$ of $G(X,Y)$ is said to be trivial if $A\subseteq X$ or $A\subseteq Y$. Otherwise, $A$ is nontrivial. By $\alpha(X,Y)$ we denote the size of…

Combinatorics · Mathematics 2011-01-13 Jun Wang , Huajun Zhang

Recent results of Qu and Tuarnauceanu describe explicitly the finite p-groups which are not elementary abelian and have the property that the number of their subgroups is maximal among p-groups of a given order. We complement these results…

Group Theory · Mathematics 2020-09-21 Stefanos Aivazidis , Thomas Müller

The maximal dimension of a commutative subalgebra of the Grassmann algebra is determined. It is shown that for any commutative subalgebra there exists a commutative subalgebra which is spanned by monomials and has the same dimension. It…

Rings and Algebras · Mathematics 2014-04-16 M. Domokos , M. Zubor

The Ellis semigroup of a dynamical system $(X,T)$ is tame if every element is the limit of a sequence (as opposed to a net) of homeomorphisms coming from the $T$ action. This topological property is related to the cardinality of the…

Dynamical Systems · Mathematics 2025-10-08 Johannes Kellendonk

A space $X$ is submaximal if any dense subset of $X$ is open. In this paper, we prove that every submaximal topological gyrogroup of non-measurable cardinality is strongly $\sigma$-discrete. Moreover, we prove that every submaximal strongly…

General Topology · Mathematics 2020-11-11 Meng Bao , Fucai Lin

Let K be a set of infinite cardinals such that the cardinality of K is the first strong limit cardinal greater than uncountably many strong limit cardinals. We construct a family of pairwise non-embeddable groups which contains 2^k groups…

Group Theory · Mathematics 2026-01-08 Gerald Kuba

We show that for a finite group $G$, the commuting probability of $G$ can be explicitly bounded from below in a nontrivial way by a function in the maximum fraction of elements inverted resp. squared by an automorphism of $G$. Using these…

Group Theory · Mathematics 2016-06-03 Alexander Bors

We study mixing properties of epimorphisms of a compact connected finite-dimensional abelian group $X$. In particular, we show that a set $F$, $|F|>\dim X$, of epimorphisms of $X$ is mixing iff every subset of $F$ of cardinality $(\dim…

Dynamical Systems · Mathematics 2007-05-23 Vitaly Bergelson , Alexander Gorodnik

A coalition in a graph $G$ with vertex set $V$ consists of two disjoint sets $V_1, V_2\subset V$ such that neither $V_1$ nor $V_2$ is a dominating set, but the union $V_1\cup V_2$ is a dominating set in $G$. A partition of graph vertices is…

Combinatorics · Mathematics 2024-04-29 Andrey A. Dobrynin , Hamidreza Golmohammadi

Every infinite group $G$ of regular cardinality can be partitioned $G=A_1\cup A_2$ so that $G\neq FA_1$, $G\neq FA_2$ for every subset $F\subset G$ of cardinality $|F|<|G|$. The first author asked whether the same is true for each group $G$…

Group Theory · Mathematics 2014-08-26 Igor Protasov , Sergii Slobodianiuk

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

Combinatorics · Mathematics 2022-04-04 Simone Costa , Stefano Della Fiore , M. A. Ollis , Sarah Z. Rovner-Frydman