Related papers: Heisenberg Groups as Platform for the AAG key-exch…

Based on some analogies with the Hodge theory of isolated hypersurface singularities, we define Hodge-type numerical invariants (called H-numbers) of any, not necessarily algebraic, link in $S^3$. They contain the same information as the…

This paper develops a basic theory of H-groups. We introduce a special quotient of H-groups and extend some algebraic constructions of topological groups to the category of H-groups and H-maps. We use these constructions to prove some…

We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…

Graph structure of quantum spin networks plays an essential role in applying quantum annealing (QA). The Ising model is the typical choice to describe the interactions between the spins in the networks. Here, we explore the interplay of…

Motivated by the problem of designing inference-friendly Bayesian nonparametric models in probabilistic programming languages, we introduce a general class of partially exchangeable random arrays which generalizes the notion of hierarchical…

In these lecture notes, the representation theory of the Heisenberg group as well as Howe's construction of the metaplectic group by means of twisted convolution operators with generalized, complex Gaussians are reviewed, and it is shown…

General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are easily established. Authentication and signature…

Directed acyclic graphs (DAGs) are a popular framework to express multivariate probability distributions. Acyclic directed mixed graphs (ADMGs) are generalizations of DAGs that can succinctly capture much richer sets of conditional…

In its most general formulation a quantum kinematical system is described by a Heisenberg group; the "configuration space" in this case corresponds to a maximal isotropic subgroup. We study irreducible models for Heisenberg groups based on…

Learning the structure of dependence relations between variables is a pervasive issue in the statistical literature. A directed acyclic graph (DAG) can represent a set of conditional independences, but different DAGs may encode the same set…

The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of the previously suggested length-based algorithms, that make…

The Heisenberg group is one of the simplest sub-Riemannian settings in which we can define non-elliptic H\"ormander type generators. We can then consider coercive inequalities associated to such generators. We prove that a certain class of…

We prove that the mapping class group of a sphere with five punctures admits uncountably many coarsely equivariant coarse median structures. The same is shown for right-angled Artin groups whose defining graphs are connected, triangle- and…

We construct categorical braid group actions from 2-representations of a Heisenberg algebra. These actions are induced by certain complexes which generalize spherical (Seidel-Thomas) twists and are reminiscent of the Rickard complexes…

We sketch a group-theoretical framework, based on the Heisenberg-Weyl group, encompassing both quantum and classical statistical descriptions of mechanical systems. We re-define in group-theoretical terms the kinematical arena and the…

Network data often arises via a series of structured interactions among a population of constituent elements. E-mail exchanges, for example, have a single sender followed by potentially multiple receivers. Scientific articles, on the other…

Unlocking the potential of topological order within many-body spin systems has long been a central pursuit in the realm of quantum materials. Despite extensive efforts, the quest for a versatile platform enabling site-selective spin…

Recent papers initiated the study of a generalization of group testing where the potentially contaminated sets are the members of a given hypergraph F=(V,E). This generalization finds application in contexts where contaminations can be…

In the context of a connected, simply connected, nilpotent Lie group, whose representations are square-integrable modulo the center, we find characterization results of extra-invariant spaces under the left translations associated with the…

Post-Quantum Cryptography PQC attempts to find cryptographic protocols resistant to attacks using Shors polynomial time algorithm for numerical field problems or Grovers algorithm to find the unique input to a black-box function that…