Related papers: Classification of near-normal sequences
The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…
We generally classify the equivalence classes of the $T^2/Z_m$ $(m=2,3,4,6)$ orbifold boundary conditions (BCs) for the $SO(N)$ gauge group. Higher-dimensional gauge theories are defined by gauge groups, matter field contents, and the BCs.…
A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give a new approach for generating a graphic approximation of…
We propose a novel class of neural network-like parametrized functions, i.e., general transformation neural networks (GTNNs), for high-dimensional approximation. Conventional deep neural networks sometimes perform less accurately on…
An approach is suggested defining effective sums of divergent series in the form of self-similar exponential approximants. The procedure of constructing these approximants from divergent series with arbitrary noninteger powers is developed.…
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
In the following article we consider approximate Bayesian computation (ABC) for certain classes of time series models. In particular, we focus upon scenarios where the likelihoods of the observations and parameter are intractable, by which…
The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…
Quantum neural networks (QNNs) are an analog of classical neural networks in the world of quantum computing, which are represented by a unitary matrix with trainable parameters. Inspired by the universal approximation property of classical…
Under some mild regularity on the normalizing sequence, we obtain necessary and sufficient conditions for the Strong Law of Large Numbers for (symmetrized) U-statistics. We also obtain nasc's for the a.s. convergence of series of an…
We present simplicial neural networks (SNNs), a generalization of graph neural networks to data that live on a class of topological spaces called simplicial complexes. These are natural multi-dimensional extensions of graphs that encode not…
The classical Farey sequence of height $Q$ is the set of rational numbers in reduced form with denominator less than $Q$. In this paper we introduce the concept of a generalized Farey sequence. While these sequences arise naturally in the…
Using an asymmetric associative network with synchronous updating, it is possible to recall a sequence of patterns. To obtain a stable sequence generation with a large storage capacity, we introduce a threshold that eliminates the…
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
It is well-known that any sequence of at least N integers contains a subsequence whose sum is 0 (mod N). However, there can be very few subsequences with this property (e.g. if the initial sequence is just N 1's, then there is only one…
Sequences whose terms are equal to the number of functions with specified properties are considered. Properties are based on the notion of derangements in a more general sense. Several sequences which generalize the standard notion of…
A. Renyi \cite{Renyi} made a definition that gives one generalization of simple normality in the context of $Q$-Cantor series. Similarly, in this paper we give a definition which generalizes the notion of normality in the context of…
We provide a generalization of the normal mode decomposition for non-symmetric or locality constrained situations. This allows for instance to locally decouple a bipartitioned collection of arbitrarily correlated oscillators up to…
We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed…
We give a canonical form for a complex matrix, whose square is normal, under transformations of unitary similarity as well as a canonical form for a real matrix, whose square is normal, under transformations of orthogonal similarity.