Related papers: Heisenberg Groups as Platform for the AAG key-exch…
In this paper we present a new key establishment protocol based on the decomposition problem in non-commutative groups which is: given two elements $w, w_1$ of the platform group $G$ and two subgroups $A, B \subseteq G$ (not necessarily…
A composite quantum system comprising a finite number k of subsystems which are described with position and momentum variables in Z_{n_{i}}, i=1,...,k, is considered. Its Hilbert space is given by a k-fold tensor product of Hilbert spaces…
Let $\h_n$ be the $(2n+1)$-dimensional Heisenberg group. and let ${\cal L}_\alpha$ be the sublaplacian of the Lie algebra of $\h_n$ A new spherical harmonics with its orthogonal polynomial properties is presented for the group.
Hypergraphs, which belong to the family of higher-order networks, are a natural and powerful choice for modeling group interactions in the real world. For example, when modeling collaboration networks, which may involve not just two but…
We explore the geometry that underlies the osculating nilpotent group structures of the Heisenberg calculus. For a smooth manifold $M$ with a distribution $H\subseteq TM$ analysts use explicit (and rather complicated) coordinate formulas to…
Effect of biquadratic exchange on phase transitions of a planar classical Heisenberg (or XY) ferromagnet on a stacked triangular lattice is investigated by Standard Monte Carlo and Histogram Monte Carlo simulations in the region of a…
For an isotropic reductive group G satisfying a suitable rank condition over an infinite field k, we show that the sections of the $\mathbb{A}^1$-fundamental group sheaf of G over an extension field L/k can be identified with the second…
Using an ensemble of atoms in an optical cavity, we engineer a family of nonlocal Heisenberg Hamiltonians with continuously tunable anisotropy of the spin-spin couplings. We thus gain access to a rich phase diagram, including a…
Irregular data in real-world are usually organized as heterogeneous graphs (HGs) consisting of multiple types of nodes and edges. To explore useful knowledge from real-world data, both the large-scale encyclopedic HG datasets and…
This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…
We use the mathematical structure of group algebras and $H^{+}$-algebras for describing certain problems concerning the quantum dynamics of systems of angular momenta, including also the spin systems. The underlying groups are ${\rm SU}(2)$…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
Cyclic number fields of odd prime degree are constructed as ray class fields over the rational number field. They are collected in multiplets sharing a common conductor and discriminant. The algorithms are implemented in Magma and applied…
Coordination graphs are a central abstraction in cooperative multi-agent reinforcement learning (MARL), yet existing sparse-graph learners lack a theoretically grounded mechanism to decide which edges should exist and how much information…
In this paper we propose cryptosystems based on subgroup distortion in hyperbolic groups. We also include concrete examples of hyperbolic groups as possible platforms.
While large language model-based agents demonstrate great potential in collaborative tasks, their interactivity also introduces security vulnerabilities. In this paper, we propose and model group collusive attacks, a highly destructive…
We characterize the epimorphisms in homotopy type theory (HoTT) as the fiberwise acyclic maps and develop a type-theoretic treatment of acyclic maps and types in the context of synthetic homotopy theory as developed in univalent…
We propose the study of Markov chains on groups as a "quasi-isometry invariant" theory that encompasses random walks. In particular, we focus on certain classes of groups acting on hyperbolic spaces including (non-elementary) hyperbolic and…
The stochastic block model is widely used to generate graphs with a community structure, but no simple alternative currently exists for hypergraphs, in which more than two nodes can be connected together through a hyperedge. We discuss here…
This paper presents the current state of the art on attack and defense modeling approaches that are based on directed acyclic graphs (DAGs). DAGs allow for a hierarchical decomposition of complex scenarios into simple, easily understandable…