Related papers: Higher-Order Autocorrelations on Finite Abelian Gr…
Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. Associate a graph $\Gamma_G$ (called non-commuting graph of $G$) with $G$ as follows: take $G\setminus Z(G)$ as the vertices of $\Gamma_G$ and join two distinct vertices $x$…
Let $G$ be a finite abelian group and $E$ a subset of it. Suppose that we know for all subsets $T$ of $G$ of size up to $k$ for how many $x \in G$ the translate $x+T$ is contained in $E$. This information is collectively called the $k$-deck…
In this paper we propose a conceptual framework for higher-order artificial neural networks. The idea of higher-order networks arises naturally when a model is required to learn some group of transformations, every element of which is…
We present a new notion $R_\ell$ of higher-order common information, which quantifies the information that $\ell\geq 2$ arbitrarily distributed random variables have in common. We provide analytical lower bounds on $R_3$ and $R_4$ for…
The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…
The problem of signal recovery from the autocorrelation, or equivalently, the magnitudes of the Fourier transform, is of paramount importance in various fields of engineering. In this work, for one-dimensional signals, we give conditions,…
The topic of this paper are (multi-window) Gabor frames for signals over finite Abelian groups, generated by an arbitrary lattice within the finite time-frequency plane. Our generic approach covers simultaneously multi-dimensional signals…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
To perform any meaningful optimization task, distribution grid operators need to know the topology of their grids. Although power grid topology identification and verification has been recently studied, discovering instantaneous interplay…
We present some Zermelo-Fraenkel consistency results regarding bi-orderability of groups, as well as a construction of groups with Conradian orders whose every action on metric spaces has bounded orbits. A classical consequence of the…
We consider the multi-target detection problem of recovering a set of signals that appear multiple times at unknown locations in a noisy measurement. In the low noise regime, one can estimate the signals by first detecting occurrences, then…
In this paper, the second-order statistics of the instantaneous mutual information are studied, in time-varying Rayleigh fading channels, assuming general non-isotropic scattering environments. Specifically, first the autocorrelation…
The problem of controlling higher-order interactions in neural networks is addressed with techniques commonly applied in the cluster analysis of quantum many-particle systems. For multi-neuron synaptic weights chosen according to a…
Information-theoretic quantities reveal dependencies among variables in the structure of joint, marginal, and conditional entropies, but leave some fundamentally different systems indistinguishable. Furthermore, there is no consensus on how…
A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…
Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of…
In the study of quantum nonlocality, one obstacle is that the analytical criterion for identifying the boundaries between quantum and postquantum correlations has not yet been given, even in the simplest Bell scenario. We propose a…
A notion of degeneration of elements in groups is introduced. It is used to parametrize the orbits in a finite abelian group under its full automorphism group by a finite distributive lattice. A pictorial description of this lattice leads…
Network data has become widespread, larger, and more complex over the years. Traditional network data is dyadic, capturing the relations among pairs of entities. With the need to model interactions among more than two entities, significant…
Given integers $d\ge 3$ and $N\ge 3$. Let $G$ be a finite abelian group acting faithfully and linearly on a smooth hypersurface of degree $d$ in the complex projective space $\mathbb{P}^{N-1}$. Suppose $G\subset PGL(N, \mathbb{C})$ can be…