Related papers: Strong external difference families in abelian and…
The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…
Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…
We provide a classification of graphical models according to their representation as subfamilies of exponential families. Undirected graphical models with no hidden variables are linear exponential families (LEFs), directed acyclic…
Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type $30^u$ with…
The main focus of this paper is the complete enumeration of self-dual abelian codes in non-principal ideal group algebras $\mathbb{F}_{2^k}[A\times \mathbb{Z}_2\times \mathbb{Z}_{2^s}]$ with respect to both the Euclidean and Hermitian inner…
The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian…
The power graph and the enhanced power graph of a group $\mathbf G$ are simple graphs with vertex set $G$; two elements of $G$ are adjacent in the power graph if one of them is a power of the other, and they are adjacent in the enhanced…
We provide an algebraic characterization of strong ordered Abelian groups: An ordered Abelian group is strong iff it has bounded regular rank and almost finite dimension. Moreover, we show that any strong ordered Abelian group has finite…
This paper provides a combinatorial characterization of weak algebraic manipulation detection (AMD) codes via a kind of generalized external difference families called bounded standard weighted external difference families (BSWEDFs). By…
We show that a large family of groups without non-abelian free subgroups satisfy the following strengthening of non-amenability: they each have a rich supply of irreducible representations defining exotic C*-algebras. The construction is…
We describe convolutional deep exponential families (CDEFs) in this paper. CDEFs are built based on deep exponential families, deep probabilistic models that capture the hierarchical dependence between latent variables. CDEFs greatly reduce…
Motivated by a connection between semi-regular relative difference sets and mutually unbiased bases, we study relative difference sets with parameters $(m,n,m,m/n)$ in groups of non-prime-power orders. Let $p$ be an odd prime. We prove that…
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
Strongly regular graphs (SRGs) provide a fertile area of exploration in algebraic combinatorics, integrating techniques in graph theory, linear algebra, group theory, finite fields, finite geometry, and number theory. Of particular interest…
We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…
A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…
Generalising a previous result, we determine all non-abelian finite simple groups whose order has largest prime divisor not exceeding $10^4$. The computer code for this and similar calculations is made available.
The use of nonabelian discrete groups G as family symmetries is discussed in detail. Out of all such groups up to order g = 31, the most appealing candidates are two subgroups of SU(2): the dicyclic [double dihedral] group G = $Q_6 ={…
In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup $\mathcal{H}$ of a FATF group $\mathcal{G}$,…
Recently, new combinatorial structures called disjoint partial difference families (DPDFs) and external partial difference families (EPDFs) were introduced, which simultaneously generalize partial difference sets, disjoint difference…