Results 21 to 30 of about 276,781 (279)
Anomalies of non-Abelian finite groups via cobordism
We use cobordism theory to analyse anomalies of finite non-abelian symmetries in 4 spacetime dimensions. By applying the method of ‘anomaly interplay’, which uses functoriality of cobordism and naturality of the η-invariant to relate anomalies in a group
Joe Davighi +2 more
doaj +1 more source
The Abelian Kernel of an Inverse Semigroup
The problem of computing the abelian kernel of a finite semigroup was first solved by Delgado describing an algorithm that decides whether a given element of a finite semigroup S belongs to the abelian kernel.
A. Ballester-Bolinches +1 more
doaj +1 more source
Sparse sums of squares on finite abelian groups and improved semidefinite lifts [PDF]
Let G be a finite abelian group. This paper is concerned with nonnegative functions on G that are sparse with respect to the Fourier basis. We establish combinatorial conditions on subsets S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage ...
Hamza Fawzi, J. Saunderson, P. Parrilo
semanticscholar +1 more source
Complementary dual abelian codes in group algebras of some finite abelian groups [PDF]
Linear complementary dual codes have become an interesting sub-family of linear codes over finite fields since they can be practically applied in various fields such as cryptography and quantum error-correction. Recently, properties of complementary dual
Jitman Somphong
doaj +1 more source
Thickness of the subgroup intersection graph of a finite group
Let $ G $ be a finite group. The intersection graph of subgroups of $ G $ is a graph whose vertices are all non-trivial subgroups of $ G $ and in which two distinct vertices $ H $ and $ K $ are adjacent if and only if $ H\cap K\neq 1 $. In this paper, we
Huadong Su, Ling Zhu
doaj +1 more source
Rainbow Arithmetic Progressions in Finite Abelian Groups [PDF]
For positive integers $n$ and $k$, the \emph{anti-van der Waerden number} of $\mathbb{Z}_n$, denoted by $aw(\mathbb{Z}_n,k)$, is the minimum number of colors needed to color the elements of the cyclic group of order $n$ and guarantee there is a rainbow ...
Michael Young
semanticscholar +1 more source
On Abelian group representability of finite groups
14 ...
Thomas, Eldho K. +2 more
openaire +4 more sources
On Undecidability of Finite Subsets Theory for Torsion Abelian Groups
Let M be a commutative cancellative monoid with an element of infinite order. The binary operation can be extended to all finite subsets of M by the pointwise definition. So, we can consider the theory of finite subsets of M.
Sergey Mikhailovich Dudakov
doaj +1 more source
Decomposing finite Abelian groups [PDF]
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups into a product of cyclic groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to ...
Cheung, K., Mosca, M.
openaire +3 more sources
Ranks for Families of Theories of Abelian Groups
The rank for families of theories is similar to Morley rank and can be considered as a measure for complexity or richness of these families. Increasing the rank by extensions of families we produce more rich families and obtaining families with the ...
In. I. Pavlyuk, S.V. Sudoplatov
doaj +1 more source

