English
Related papers

Related papers: Nonabelian partial difference sets constructed usi…

200 papers

Recent experiments have successfully realized multi-band non-Abelian topological insulators with parity-time symmetry. Their topological classification transcends the conventional ten-fold classification, necessitating the use of…

Mesoscale and Nanoscale Physics · Physics 2025-04-15 Xiangxu He , Ruo-Yang Zhang , Xiaohan Cui , Lei Zhang , C. T. Chan

Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known…

Combinatorics · Mathematics 2018-09-05 Yu-pei Huang , Chia-an Liu , Yaotsu Chang , Chong-Dao Lee

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

Combinatorics · Mathematics 2020-05-26 Joy Morris , Josip Smolcic

Given a subset $S$ of the non-identity elements of the dihedral group of order $2m$, is it possible to order the elements of $S$ so that the partial products are distinct? This is equivalent to the sequenceability of the group when $|S| =…

Combinatorics · Mathematics 2019-04-17 M. A. Ollis

In this paper, I show that if $p$ is an odd prime, and if $P$ is a finite $p$-group, then there exists an exact sequence of abelian groups $$0\to T(P)\to D(P)\to\lproj{P}\to H^1\big(\apdeux(P),\Z\big)^{(P)},$$ where $D(P)$ is the Dade group…

Group Theory · Mathematics 2008-09-03 Serge Bouc

We study anomalies of non-Abelian discrete symmetries; which part of non-Abelian group is anomaly free and which part can be anomalous. It is found that the anomaly-free elements of the group $G$ generate a normal subgroup $G_0$ of $G$ and…

High Energy Physics - Theory · Physics 2022-03-14 Tatsuo Kobayashi , Hikaru Uchida

In analogy with epsilon-biased sets over Z_2^n, we construct explicit epsilon-biased sets over nonabelian finite groups G. That is, we find sets S subset G such that | Exp_{x in S} rho(x)| <= epsilon for any nontrivial irreducible…

Computational Complexity · Computer Science 2013-05-01 Sixia Chen , Cristopher Moore , Alexander Russell

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

Combinatorics · Mathematics 2025-02-14 Xiongfeng Zhan , Xueyi Huang , Lu Lu

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…

Combinatorics · Mathematics 2018-04-23 Jonathan Jedwab , Shuxing Li , Samuel Simon

It is proven that for any representation over a field of characteristic 0 of the non-abelian semidirect product of a cyclic group of prime order p and the group of order 3 the corresponding algebra of polynomial invariants is generated by…

Representation Theory · Mathematics 2012-05-29 K. Cziszter

We discuss the the notion of a partial dynamical symmetry (PDS), for which a prescribed symmetry is obeyed by only a subset of solvable eigenstates, while other eigenstates are strongly mixed. We present an explicit construction of…

Nuclear Theory · Physics 2013-04-16 A. Leviatan

A difference matrix over a group is a discrete structure that is intimately related to many other combinatorial designs, including mutually orthogonal Latin squares, orthogonal arrays, and transversal designs. Interest in constructing…

Combinatorics · Mathematics 2020-05-22 Koen van Greevenbroek , Jonathan Jedwab

This paper considers non-Abelian homology groups of a group diagram introduced as homotopy groups of a simplicial change. We prove a theorem stating that the non-Abelian homology groups of a group diagram are isomorphic to the homotopy…

Algebraic Topology · Mathematics 2026-05-11 Ahmet A. Husainov

The numerical solution of differential equations can be formulated as an inference problem to which formal statistical approaches can be applied. However, nonlinear partial differential equations (PDEs) pose substantial challenges from an…

Numerical Analysis · Mathematics 2021-08-26 Junyang Wang , Jon Cockayne , Oksana Chkrebtii , T. J. Sullivan , Chris. J. Oates

There are several examples in the literature of finite non-abelian $p$-groups whose automorphism group is abelian. For some time only examples that were special $p$-groups were known, until Jain and Yadav [JY12] and Jain, Rai and Yadav…

Group Theory · Mathematics 2013-09-13 A. Caranti

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

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…

Group Theory · Mathematics 2012-12-11 Eldho K. Thomas , Nadya Markin , Frédérique Oggier

We discuss a hierarchy of broken symmetries with special emphasis on partial dynamical symmetries (PDS). The latter correspond to a situation in which a non-invariant Hamiltonian accommodates a subset of solvable eigenstates with good…

Nuclear Theory · Physics 2013-04-16 A. Leviatan

In this paper, using group actions, we introduce a new method for constructing partial geometric designs (sometimes referred to as $1\frac{1}{2}$-designs). Using this new method, we construct several infinite families of partial geometric…

Combinatorics · Mathematics 2019-04-15 Jerod Michel , Qi Wang

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

Combinatorics · Mathematics 2022-04-04 Simone Costa , Stefano Della Fiore , M. A. Ollis , Sarah Z. Rovner-Frydman