相关论文: The Diffie-Hellman Key Exchange Protocol and non-a…
An abelian network is a collection of communicating automata whose state transitions and message passing each satisfy a local commutativity condition. This paper is a continuation of the abelian networks series of Bond and Levine (2016),…
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…
We show that the central representation is nontrivial for all one-dimensional central extensions of nilpotent Lie algebras possessing a codimension one abelian ideal.
We demonstrate that a large class of one-dimensional quantum and classical exchange models can be described by the same type of graphs, namely Cayley graphs of the permutation group. Their well-studied spectral properties allow us to derive…
The Cayley-Dickson loop Q_n is the multiplicative closure of basic elements of the algebra constructed by n applications of the Cayley-Dickson doubling process (the first few examples of such algebras are real numbers, complex numbers,…
Let F/Q be a totally real field extension of degree g and let D be a definite quaternion algebra with center F. Fix an odd prime p which is unramified in F and D. We produce weight shiftings between (mod p) automorphic forms on the…
Let $G$ be a group and write $\mbox{Perm}(G)$ for its symmetric group. Define $\mbox{Hol}(G)$ to be the holomorph of $G$, regarded as a subgroup of $\mbox{Perm}(G)$, and let $\mbox{NHol}(G)$ denote its normalizer. The quotient $T(G) =…
Let K be a field and \ell be a prime such that char K \neq \ell. In the presence of sufficiently many roots of unity in K, we show how to recover some of the inertia/decomposition structure of valuations inside the maximal (\Z/\ell)-abelian…
In this paper we review the Habeeb-Kahrobaei-Shpilrain secret sharing scheme and introduce a variation based on the shortlex order on a free group. Drawing inspiration from adjustments to classical schemes, we also present a method that…
Non-Abelian holonomy in dynamical systems may arise in adiabatic transport of energetically degenerate sets of states. We examine such a holonomy structure for mixtures of energetically degenerate quantal states. We demonstrate that this…
An algorithmic approach towards the formulation of non-relativistic diffeomorphism invariance has been developed which involves both matter and gauge fields. A step by step procedure has been provided which can accommodate all types of…
In this paper we study the description of the functional graphs associated with the power maps over finite groups. We present a structural result which describes the isomorphism class of these graphs for abelian groups and also for flower…
Diffie-Hellman key-agreement and RSA cryptosystem are widely used to provide security in internet protocols. But both of the two algorithms are totally breakable using Shor's algorithms. This paper proposes two connected matrix-based…
Let $\Lambda$ be a finite abelian group. A dynamical system with transformation group $\Lambda$ is a triple $(A,\Lambda,\alpha)$, consisting of a unital locally convex algebra $A$, the finite abelian group $\Lambda$ and a group homomorphism…
For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…
The standard notion of the non-Abelian duality in string theory is generalized to the class of $\si$-models admitting `non-commutative conserved charges'. Such $\si$-models can be associated with every Lie bialgebra $(\cg ,\cgt)$ and they…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
Blockchains and other public ledger structures promise a new way to create globally consistent event logs and other records. We make use of this consistency property to detect and prevent man-in-the-middle attacks in a key exchange such as…
If we pick two elements of a non-abelian group at random, the odds this pair commutes is at most 5/8, so there is a "gap" between abelian and non-abelian groups \cite{G}. We prove a "topological" generalization estimating the odds a word…
We extend results on transitive self-similar abelian subgroups of the group of automorphisms $\mathcal{A}_m$ of an $m$-ary tree $\mathcal{T}_m$ in \cite{BS}, to the general case where the permutation group induced on the first level of the…