Related papers: Characterizing Transfer Systems for Non-Abelian Gr…

For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of $G$--transfer systems on the subgroup lattice of $G$. In \cite{ABB+25}…

For a finite group $G$, $G$-transfer systems are combinatorial objects which encode the homotopy category of $G$-$N_\infty$ operads, whose algebras in $G$-spectra are $E_\infty$ $G$-spectra with a specified collection of multiplicative…

Global transfer systems are equivalent to global $N_\infty$-operads, which parametrize different levels of commutativity in globally equivariant homotopy theory, where objects have compatible actions by all compact Lie groups. In this paper…

For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a…

A transfer is a group homomorphism from a finite group to an abelian quotient group of a subgroup of the group. In this paper, we explain some of the properties of transfers by using noncommutative determinants. These properties enable us…

Transfer systems on finite posets have recently been gaining traction as a key ingredient in equivariant homotopy theory. Additionally, they also naturally occur in the data of a model structure. We give a complete characterization of all…

For a nonabelian group G, the non-commuting graph $\Gamma_G$ of $G$ is defined as the graph with vertex set $G-Z(G)$, where $Z(G)$ is the center of $G$, and two distinct vertices of $\Gamma_G$ are adjacent if they do not commute in $G$. In…

In this article, we apply the recently developed theory of transfer systems to study the relationship between $G$-equivariant linear isometries and infinite little discs operads, for a finite group $G$. This framework allows us to reduce…

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…

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…

In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups $D_n$, the generalized quaternion groups $Q_n$, the…

Building on the principle of combinatorial gauge symmetry, lattice gauge theories can be formulated with only one- and two-body interactions that ensure the exact realization of the symmetry rather than its approximate emergence in a…

We present a comprehensive and self-contained discussion of the use of the transfer matrix to study propagation in one-dimensional lossless systems, including a variety of examples, such as superlattices, photonic crystals, and optical…

We prove that Hill's characteristic function $\chi$ for transfer systems on a lattice $P$ surjects onto interior operators for $P$. Moreover, the fibers of $\chi$ have unique maxima which are exactly the saturated transfer systems. In order…

One way of expressing the self-duality $A\cong \Hom(A,\mathbb{C})$ of Abelian groups is that their character tables are self-transpose (in a suitable ordering). Noncommutative groups fail to satisfy this property. In this paper we extend…

We provide a general recursive method for constructing transfer systems on finite lattices. Using this we calculate the number of homotopically distinct $N_\infty$ operads for dihedral groups $D_{p^n}$, $p > 2$ prime, and cyclic groups…

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

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…

The commuting graph $\Delta(G)$ of a finite non-abelian group $G$ is a simple graph with vertex set $G$ and two distinct vertices $x, y$ are adjacent if $xy = yx$. In this paper, among some properties of $\Delta(G)$, we investigate…

Transfer Krull monoids are monoids which allow a weak transfer homomorphism to a commutative Krull monoid, and hence the system of sets of lengths of a transfer Krull monoid coincides with that of the associated commutative Krull monoid. We…