English
Related papers

Related papers: Generating Sets of Mathieu Groups

200 papers

We compute for reflection groups of type $A,B,D,F_4,H_3$ and for dihedral groups a statistic counting the maximal cardinality of a set of elements in the group whose generalized inversions yield the full set of inversions and which are…

Representation Theory · Mathematics 2016-02-16 Claudia Malvenuto , Pierluigi Möseneder Frajria , Luigi Orsina , Paolo Papi

We derive a model-independent upper bound on the scale of Majorana-neutrino mass generation. The upper bound is $4\pi v^2/\sqrt 3 m_\nu$, where $v \simeq 246$ GeV is the weak scale and $m_\nu$ is the Majorana neutrino mass. For neutrino…

High Energy Physics - Phenomenology · Physics 2009-10-31 J. M. Niczyporuk

We derive a model-independent upper bound on the scale of Majorana-neutrino mass generation. The upper bound is $4\pi v^2/\sqrt 3 m_\nu$, where $v \simeq 246$ GeV is the weak scale and $m_\nu$ is the Majorana neutrino mass. For neutrino…

High Energy Physics - Phenomenology · Physics 2009-10-31 F. Maltoni , J. M. Niczyporuk , S. Willenbrock

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

Group Theory · Mathematics 2025-04-04 Christopher A. Schroeder , Hung P. Tong-Viet

In this paper we construct structures from Mathieu group $M_{11}$. We classify transitive $t$-designs with 11, 12 and 22 points admitting a transitive action of Mathieu group $M_{11}$. Thereby we proved the existence of designs with…

Combinatorics · Mathematics 2017-06-20 Dean Crnkovic , Andrea Svob

First, we consider order-$n$ ribbon tilings of an $M$-by-$N$ rectangle $R_{M,N}$ where $M$ and $N$ are much larger than $n$. We prove the existence of the growth rate $\gamma_n$ of the number of tilings and show that $\gamma_n \leq (n-1)…

Combinatorics · Mathematics 2023-07-04 Yinsong Chen , Vladislav Kargin

We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…

Formal Languages and Automata Theory · Computer Science 2013-10-23 Ines Klimann

We characterise the elements of the (maximum) idempotent generated subsemigroup of the Kauffman monoid in terms of combinatorial data associated to certain normal forms. We also calculate the smallest size of a generating set and idempotent…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , James East

This expository note presents simplifications of a theorem due to Gy\H{o}ri and an algorithm due to Franzblau and Kleitman: Given a family $F$ of $m$ intervals on a linearly ordered set of $n$ elements, we can construct in $O(m+n)^2$ steps…

Combinatorics · Mathematics 2008-02-03 Donald E. Knuth

In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…

Combinatorics · Mathematics 2026-05-27 Nathanaël Hassler , Andrew Treglown

In this paper, we give examples of maximal amenable subalgebras of the free group factor of two generators. More precisely, we consider two copies of the hyperfinite factor $R_i$ of type $\mathrm{II}_1$. From each $R_i$, we take a Haar…

Operator Algebras · Mathematics 2016-10-03 Koichi Shimada

An induced matching $M$ in a graph $G$ is a matching in $G$ that is also the edge set of an induced subgraph of $G$. That is, any edge not in $M$ must have no more than one incident vertex saturated by $M$. The maximum size $|M|$ of an…

Combinatorics · Mathematics 2017-06-28 Deborah Olayide Ajayi , Tayo Charles Adefokun

We show that there are hereditarily just infinite groups of any subgroup growth type between $n$ and $n^{\log n}$. This is obtained calculating the subgroup growth type of a family of hereditarily just infinite profinite groups obtained via…

Group Theory · Mathematics 2026-02-26 Matteo Vannacci

Let $Q_n$ be the $n$-dimensional Hamming cube and $N=2^n$. We prove that the number of maximal independent sets in $Q_n$ is asymptotically \[2n2^{N/4},\] as was conjectured by Ilinca and the first author in connection with a question of…

Combinatorics · Mathematics 2019-09-12 Jeff Kahn , Jinyoung Park

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Group Theory · Mathematics 2009-01-14 Alireza Abdollahi

We construct, at the linearized level, the three-dimensional (3D) N = 4 supersymmetric "general massive supergravity" and the maximally supersymmetric N = 8 "new massive supergravity". We also construct the maximally supersymmetric…

High Energy Physics - Theory · Physics 2011-03-28 Eric A. Bergshoeff , Olaf Hohm , Jan Rosseel , Paul K. Townsend

Let $F$ be a field. In this note we give a construction for a family of maximal Mathieu subspaces (or Mathieu-Zhao subspaces) of the matrix algebras $M_n(F)$ $(n\ge 2)$. As an application we also give a classification of Mathieu subspaces…

Rings and Algebras · Mathematics 2022-06-06 George F. Seelinger , Wenhua Zhao

Let $G$ be a non-abelian finite simple group. In addition, let $\Delta_G$ be the intersection graph of $G$, whose vertices are the proper nontrivial subgroups of $G$, with distinct subgroups joined by an edge if and only if they intersect…

Group Theory · Mathematics 2021-07-05 Saul D. Freedman

Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…

Logic · Mathematics 2016-03-10 Vera Fischer , Sy David Friedman , Asger Törnquist

A group $G$ is invariably generated by a subset $S$ of $G$ if $G= s^{g(s)} \mid s\in S$ for each choice of $g(s) \in G$, $s \in S$. Answering two questions posed by Kantor, Lubotzky and Shalev, we prove that the free prosoluble group of…

Group Theory · Mathematics 2014-10-22 Eloisa Detomi , Andrea Lucchini
‹ Prev 1 8 9 10 Next ›