English
Related papers

Related papers: Group Marriage Problem

200 papers

We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A…

Combinatorics · Mathematics 2024-02-15 Mohsen Aliabadi , Shira Zerbib

Let $G \leq \mathrm{GL}(V)$ be a group with a unique subnormal quasisimple subgroup $E(G)$ that acts absolutely irreducibly on $V$. A base for $G$ acting on $V$ is a set of vectors with trivial pointwise stabiliser in $G$. In this paper we…

Group Theory · Mathematics 2021-07-05 Melissa Lee

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…

Group Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We determine the rings of invariants in the symmetric algebra on the dual of a vector space V over the field of two elements, for the group G of orthogonal transformations preserving a non-singular quadratic form on V. The invariant ring is…

Group Theory · Mathematics 2007-05-23 P. H. Kropholler , S. Mosheni Rajaei , J. Segal

Let $G$ be a group of permutations of a denumerable set $E$. The profile of $G$ is the function $\phi_G$ which counts, for each $n$, the (possibly infinite) number $\phi_G(n)$ of orbits of $G$ acting on the $n$-subsets of $E$. Counting…

Combinatorics · Mathematics 2018-04-11 Justine Falque , Nicolas M. Thiéry

Let $G$ be a transitive permutation group on $\Omega$. The $G$-invariant partitions form a sublattice of the lattice of all partitions of $\Omega$, having the further property that all its elements are uniform (that is, have all parts of…

Group Theory · Mathematics 2026-01-14 Marina Anagnostopoulou-Merkouri , R. A. Bailey , Peter J. Cameron

For a finite group $G$ and an element $x\in G$, the subset $$ nil_G(x)=\{y\in G \mid <x,y>~~ is ~~ nilpotent\}$$ is called nilpotentizer of $x$ in $G$. In this paper, we give two solvabilty criteria for a finite group by the structure and…

Group Theory · Mathematics 2024-02-27 N. Ahmadkhah , M. Zarrin

Suppose that a finite solvable group $G$ acts faithfully, irreducibly and quasi-primitively on a finite vector space $V$. Then $G$ has a uniquely determined normal subgroup $E$ which is a direct product of extraspecial $p$-groups for…

Group Theory · Mathematics 2020-12-21 Yong Yang , Alexey Vasil'ev , Evgeny Vdovin

Denote by $G$ a finite group and let $\psi(G)$ denote the sum of element orders in $G$. In 2009, H.Amiri, S.M.Jafarian Amiri and I.M.Isaacs proved that if $|G|=n$ and $G$ is non-cyclic, then $\psi(G)<\psi(C_n)$, where $C_n$ denotes the…

Group Theory · Mathematics 2019-01-29 Marcel Herzog , Patrizia Longobardi , Mercede Maj

In this Note we study the groups $G$ satisfying condition $(\mathcal{N},n)$, that is, every subset of $G$ with $n+1$ elements contains a pair $\{x,y\}$ such that the subgroup $<x,y>$ is nilpotent.

Group Theory · Mathematics 2007-05-23 Alireza Abdollahi

Let $G$ and $N$ be finite groups of order $2n$ where $n$ is odd. We say the pair $(G,N)$ is Hopf-Galois realizable if $G$ is a regular subgroup of $\h(N)=N\rtimes\au(N)$. In this article we give necessary conditions on $G$ (similarly $N$)…

Group Theory · Mathematics 2022-01-27 Namrata Arvind , Saikat Panja

Let $\sigma =\{\sigma_{i} | i\in I\}$ be a partition of the set of all primes $\Bbb{P}$ and $G$ a finite group. Let $\sigma (G)=\{\sigma _{i} : \sigma _{i}\cap \pi (G)\ne \emptyset$. A set ${\cal H}$ of subgroups of $G$ is said to be a…

Group Theory · Mathematics 2017-10-17 Jianhong Huang , Bin Hu , Alexander N. Skiba

We consider the conjugation-action of an arbitrary upper-block parabolic subgroup of GL_n(C) on the variety of x-nilpotent complex matrices. We obtain a criterion as to whether the action admits a finite number of orbits and specify a…

Representation Theory · Mathematics 2012-07-19 Magdalena Boos

There are several variants of the inverse Galois problem which involve restrictions on ramification. In this paper we give sufficient conditions that a given finite group $G$ occurs infinitely often as a Galois group over the rationals…

Number Theory · Mathematics 2017-11-15 Joachim Koenig , Daniel Rabayev , Jack Sonn

Suppose that a finite solvable group $G$ acts faithfully, irreducibly and quasi-primitively on a finite vector space $V$, and $G$ is not metacyclic. Then $G$ always has a regular orbit on $V$ except for a few "small" cases. We completely…

Group Theory · Mathematics 2021-12-15 Derek Holt , Yong Yang

A $k$-tuple $(H_1, \ldots, H_k)$ of core-free subgroups of a finite group $G$ is said to be regular if $G$ has a regular orbit on the Cartesian product $G/H_1 \times \cdots \times G/H_k$. The regularity number of $G$, denoted $R(G)$, is the…

Group Theory · Mathematics 2024-10-29 Marina Anagnostopoulou-Merkouri , Timothy C. Burness

L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…

Group Theory · Mathematics 2020-01-22 Meisam Soleimani Malekan , Alireza Abdollahi , Mahdi Ebrahimi

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

Combinatorics · Mathematics 2020-12-24 Rupert H. Levene , Polona Oblak , Helena Šmigoc

Let $G$ be a finite group and $x$ be an element of $G$. Define $\textrm{Sol}_G(x)$ as the set of all $y \in G$ such that $\langle {x,y}\rangle$ is soluble. We provide an equivalent condition for the normalizer-solubilizer conjecture, namely…

Group Theory · Mathematics 2025-06-11 Hamid Mousavi

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

Group Theory · Mathematics 2008-10-03 Martin R. Bridson
‹ Prev 1 3 4 5 6 7 10 Next ›