相关论文: The symmetry of intersection numbers in group theo…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
We introduce group crosscoders, an extension of crosscoders that systematically discover and analyse symmetrical features in neural networks. While neural networks often develop equivariant representations without explicit architectural…
We study in general spacetime dimension the symmetry of the theory obtained by gauging a non-anomalous finite normal Abelian subgroup $A$ of a $\Gamma$-symmetric theory. Depending on how anomalous $\Gamma$ is, we find that the symmetry of…
We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.
The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…
We present a theoretical and computational framework to compute the symmetry number of a flexible sphere cluster in $\mathbb{R}^3$, using a definition of symmetry that arises naturally when calculating the equilibrium probability of a…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
This is a translation. I have added translations for (possibly) outdated definitions in an appendix at the end. In this paper, we define distributive groups and show some properties of them. We then concern ourselves with the homogeinity of…
Based on a fundamental symmetry between space, time, mass and charge, a series of group structures of physical interest is generated, ranging from C2 to E8. The most significant result of this analysis is a version of the Dirac equation…
We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.
We give a characterization of the sets of objects of the derived category of a block of a finite group algebra (or other symmetric algebra) that occur as the set of images of simple modules under an equivalence of derived categories. We…
New notions are introduced in algebra in order to better study the congruences in number theory. For example, the <special semigroups> makes an important such contribution.
Given a diagram for a trisection of a 4-manifold $X$, we describe the homology and the intersection form of $X$ in terms of the three subgroups of $H_1(\Sigma;\mathbb{Z})$ generated by the three sets of curves and the intersection pairing…
We study graphs of (generalized) joins and intersections of finitely generated subgroups of a free group. We show how to disprove a lemma of Imrich and M\"uller on these graphs and how to repair this lemma.
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
The intersection graph $\Delta_G$ of a finite group $G$ is a simple graph with vertices the non-trivial proper subgroups of $G$, and an edge between two vertices if their corresponding subgroups intersect non-trivially. These graphs were…
A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…
A set of proper subgroups is a covering for a group if its union is the whole group. The minimal number of subgroups needed to cover $G$ is called the covering number of $G$, denoted by $\sigma(G)$. Determining $\sigma(G)$ is an open…
Given a quantum system consisting of many parts, we show that symmetry of the system's state, i.e., invariance under swappings of the subsystems, implies that almost all of its parts are virtually identical and independent of each other.…
Based on Nielsen fixed point theory and Gr\"{o}bner-Shirshov basis, we obtain a simple method to compute geometric intersection numbers and self-intersection geometric numbers of loops on surfaces.