Related papers: Higher-Order Autocorrelations on Finite Abelian Gr…
The multi-group learning model formalizes the learning scenario in which a single predictor must generalize well on multiple, possibly overlapping subgroups of interest. We extend the study of multi-group learning to the natural case where…
We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.
The model order of a wireless channel plays an important role for a variety of applications in communications engineering, e.g., it represents the number of resolvable incident wavefronts with non-negligible power incident from a…
We define a determinant on the group of automorphisms of non-trivial Severi-Brauer surfaces over a perfect field. Using the generators and relations, we extend this determinant to birational maps between Severi-Brauer surfaces. Using this…
We consider a general class of two-dimensional spin systems, with continuous but not necessarily smooth, possibly long-range, $O(N)$-symmetric interactions, for which we establish algebraically decaying upper bounds on spin-spin…
The higher-order correlation clustering problem is an expressive model, and recently, local search heuristics have been proposed for several applications. Certifying optimality, however, is NP-hard and practically hampered already by the…
The full automorphism group of a certain elementary abelian $p$-cover of the Hermitian curve in characteristic $p>0$ is determined. It is remarkable that the order of Sylow $p$-groups of the automorphism group is close to Nakajima's bound…
The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…
Uncovering causal relationships in data is a major objective of data analytics. Causal relationships are normally discovered with designed experiments, e.g. randomised controlled trials, which, however are expensive or infeasible to be…
This paper discovers that the neural network with lower decision boundary (DB) variability has better generalizability. Two new notions, algorithm DB variability and $(\epsilon, \eta)$-data DB variability, are proposed to measure the…
Analysis of higher-order organizations, usually small connected subgraphs called motifs, is a fundamental task on complex networks. This paper studies a new problem of testing higher-order clusterability: given query access to an undirected…
Testing for dependence has been a well-established component of spatial statistical analyses for decades. In particular, several popular test statistics have desirable properties for testing for the presence of spatial autocorrelation in…
The classical result by Dyer--Scott about fixed subgroups of finite order automorphisms of $F_n$ being free factors of $F_n$ is no longer true in $Z^m\times F_n$. Within this more general context, we prove a relaxed version in the spirit of…
In this work we characterize all ambiguities of the linear (aperiodic) one-dimensional convolution on two fixed finite-dimensional complex vector spaces. It will be shown that the convolution ambiguities can be mapped one-to-one to…
There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or…
In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…
We prove lower bounds on learning the M\"obius or Liouville function with a variety of standard learning techniques, including kernel methods, noisy gradient methods, and correlational statistical query algorithms. These results follow from…
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…
An abelian lattice-ordered group, or abelian $\ell$-group, is an abelian group equipped with a compatible lattice ordering. In this paper, we introduce two multi-sorted extensions of abelian lattice-ordered groups inspired by the zero-set…
In super-resolution it is necessary to locate with high precision point sources from noisy observations of the spectrum of the signal at low frequencies capped by f_c. In the case when the point sources are positive and are located on a…