Related papers: Heisenberg Groups as Platform for the AAG key-exch…
We define joint exchangeability on arrays indexed by a vector of natural numbers with coordinates being the vertices of directed acyclic graphs (DAGs) using local isomorphisms. The notion provides a new version of exchangeability, which is…
An important problem in the theory of cluster algebras is to compute the fundamental group of the exchange graph. A non-trivial closed loop in the exchange graph, for example, generates a non-trivial identity for the classical and quantum…
This paper investigates the use of quasigroups, Hadamard transforms and Number Theoretic Transforms for use in sequence randomization. This can also be used to generate hash functions for sequence encryption.
We suggest the usage of algebraic subsets instead of subgroups in public-key cryptography. In particular, we present the subset version of two protocols introduced by Shpilrain and Ushakov with some examples in ascending HNN-extensions of…
We consider actions of a group or a semigroup on a set, which generalize the setup of discrete logarithm based cryptosystems. Such cryptographic group actions have gained increasing attention recently in the context of isogeny-based…
In this article we describe extensions of some K-theory classes of Heisenberg modules over higher-dimensional noncommutative tori to projective modules over crossed products of noncommutative tori by finite cyclic groups, aka noncommutative…
We propose quasiperiodic chains with tunable mobility edge physics, as a promising platform for engineering long-range quantum entanglement. Using the generalized Aubry-Andr\'e model, we show that the mobility edges play a key role in…
We construct a Heisenberg-like algebra for the one dimensional quantum free Klein-Gordon equation defined on the interval of the real line of length $L$. Using the realization of the ladder operators of this type Heisenberg algebra in terms…
Starting from the one-way group action framework of Brassard and Yung (Crypto '90), we revisit building cryptography based on group actions. Several previous candidates for one-way group actions no longer stand, due to progress both on…
We develop a public key cryptosystem based on invariants of diagonalizable groups and investigate properties of such cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of…
Message-Passing Neural Networks (MPNNs) are extensively employed in graph learning tasks but suffer from limitations such as the restricted scope of information exchange, by being confined to neighboring nodes during each round of message…
Probabilistic graphical models are graphical representations of probability distributions. Graphical models have applications in many fields including biology, social sciences, linguistic, neuroscience. In this paper, we propose directed…
We introduce a structure for the directed acyclic graph (DAG) and a mechanism design based on that structure so that peers can reach consensus at large scale based on proof of work (PoW). We also design a mempool transaction assignment…
Recent studies have shown that novel collective behaviors emerge in complex systems due to the presence of higher-order interactions. However, how the collective behavior of a system is influenced by the microscopic organization of its…
We discuss the following topics: n-dimensional local fields and adelic groups; harmonic analysis on local fields and adelic groups for two-dimensional schemes (function spaces, Fourier transform, Poisson formula); representations of…
Heterogeneous Text-Attributed Graphs (HTAGs), where different types of entities are not only associated with texts but also connected by diverse relationships, have gained widespread popularity and application across various domains.…
The Heisenberg group, here denoted $H$, is the group of all $3\times 3$ upper unitriangular matrices with entries in the ring $\mathbb{Z}$ of integers. A.G. Myasnikov posed the question of whether or not the universal theory of $H$, in the…
The purpose of the paper is to give new key agreement protocols (a multi-party extension of the protocol due to Anshel-Anshel-Goldfeld and a generalization of the Diffie-Hellman protocol from abelian to solvable groups) and a new…
We demonstrate the transport of interface states in the one-dimensional ferromagnetic Heisenberg model by a time dependent magnetic field. Our analysis is based on the standard Adiabatic Theorem. This is supplemented by a numerical analysis…
In this paper, we propose to use a twisted dihedral group algebra for public-key cryptography. For this, we introduce a new $2$-cocycle $\alpha_{\lambda}$ to twist the dihedral group algebra. Using the ambient space…