Related papers: Symmetric group blocks of small defect
If G is a finite group and p is a prime number, we investigate the relationship between the p-modular decomposition numbers of characters of height zero in the principal p-block of G and the p-local structure of G.
A perfect isometry is an important relation between blocks of finite groups as many information about blocks are preserved by it. If we consider the group of all perfect isometries between a block to itself then this gives another…
This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…
Let $p$ be a prime number, $k$ an algebraically closed field of characteristic $p$, $\tilde{G}$ a finite group, and $G$ a normal subgroup of $\tilde{G}$ having a $p$-power index in $\tilde{G}$. Moreover let $B$ be a block of $kG$ with a…
Little groups are enumerated for the irreps and their components in any basis of O(3) and SO(3) up to rank 9, and for all irreps of C$_{\infty}$, C$_{\infty h}$, C$_{\infty v}$, D$_{\infty}$ and D$_{\infty h}$. The results are obtained by a…
For a quantum error correcting code to be used in practice, it needs to be equipped with an efficient decoding algorithm, which identifies corrections given the observed syndrome of errors.Hypergraph product codes are a promising family of…
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been…
The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's…
Modeling symmetry breaking is essential for understanding the fundamental changes in the behaviors and properties of physical systems, from microscopic particle interactions to macroscopic phenomena like fluid dynamics and cosmic…
We prove descent theorems for semiorthogonal decompositions using techniques from derived algebraic geometry. Our methods allow us to capture more general filtrations of derived categories and even marked filtrations, where one descends not…
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…
Let $KG$ denote the group algebra of the group $G$ over the field $K$ and let $U(KG)$ denote its group of units. Here without the use of a computer we give presentations for the unit groups of all group algebras $KG$, where the size of $KG$…
We propose upper bounds for the number of modular constituents of the restriction modulo $p$ of a complex irreducible character of a finite group, and for its decomposition numbers, in certain cases.
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
We consider indecomposable representations of the Klein four group over a field of characteristic $2$ and of a cyclic group of order $pm$ with $p,m$ coprime over a field of characteristic $p$. For each representation we explicitly describe…
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…
The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
In this paper, we investigate the block that has an abelian defect group of rank $2$ and its Brauer correspondent has only one simple module. We will get an isotypy between the block and its Brauer correspondent. It will generalize the…
Wilhelm (2021) has recently defended a criterion for comparing structure of mathematical objects, which he calls Subgroup. He argues that Subgroup is better than SYM * , another widely adopted criterion. We argue that this is mistaken;…
As an application of the representation theory for the dihedral groups, we study the symmetric central configurations in the n-body problem where $n$ equal masses are placed at the vertices of a regular $n$-gon. Since the Hessian matrices…