Related papers: On circular external difference families
Continuously-indexed flows (CIFs) have recently achieved improvements over baseline normalizing flows on a variety of density estimation tasks. CIFs do not possess a closed-form marginal density, and so, unlike standard flows, cannot be…
In the context of modulated-symmetry distributions, there exist various forms of skew-elliptical families. We present yet another one, but with an unusual feature: the modulation factor of the baseline elliptical density is represented by a…
In this paper we explicitly determine all indicators for groups isomorphic to the semidirect product of two cyclic groups by an automorphism of prime order, as well as the generalized quaternion groups. We then compute the indicators for…
A skew morphism of a finite group $B$ is a permutation of $B$ fixing the identity and satisfying $\varphi(xy) = \varphi(x)\varphi^{i_x}(y)$ for some integers $i_x$ indexed by $x \in B$. The enumeration of skew morphisms of finite cyclic…
We study a class $\mathfrak{M}$ of cyclically presented groups that includes both finite and infinite groups and is defined by a certain combinatorial condition on the defining relations. This class includes many finite metacyclic…
We introduce the Circular Directional Flow Decomposition (CDFD), a new framework for analyzing circularity in weighted directed networks. CDFD separates flow into two components: a circular (divergence-free) component and an acyclic…
Subgraph matching is a fundamental problem in graph analysis with a wide range of applications. However, due to its inherent NP-hardness, enumerating subgraph matches efficiently on large real-world graphs remains highly challenging. Most…
We consider two families of Pascal-like triangles that have all ones on the left side and ones separated by $m-1$ zeros on the right side. The $m=1$ cases are Pascal's triangle and the two families also coincide when $m=2$. Members of the…
In the paper we describe the group $\mathbf{Aut}\left(\mathscr{C}_{\mathbb{Z}}\right)$ of automorphisms of the extended bicyclic semigroup $\mathscr{C}_{\mathbb{Z}}$ and study the variants $\mathscr{C}_{\mathbb{Z}}^{m,n}$ of the extended…
In this paper, we define two matrices named as "difference matrices", denoted by $D$ and $DD$ which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and…
Time series causal discovery is essential for understanding dynamic systems, yet many existing methods remain sensitive to noise, non-stationarity, and sampling variability. We propose the Validated Consensus-Driven Framework (VCDF), a…
The main objective of this paper is to extend the previously defined code family over the ring $\mathfrak{R}=\sum\limits_{s=0}^{4} v_{5}^{s} \mathcal{A}_{4}$ to $\mathfrak{R}^{s,m}=\sum\limits_{\varsigma=1}^{m}…
We prove that there exists a functorial correspondence between MV-algebras and partially cyclically ordered groups which are wound round of lattice-ordered groups. It follows that some results about cyclically ordered groups can be stated…
Symmetry groups of PDEs allow to transform solutions continuously into other solutions. In this paper, we use this property for the observability analysis of nonlinear PDEs with input and output. Based on a differential-geometric…
Error Correcting Output Codes (ECOC) is a successful technique in multi-class classification, which is a core problem in Pattern Recognition and Machine Learning. A major advantage of ECOC over other methods is that the multi- class problem…
Reverse derivative categories (RDCs) have recently been shown to be a suitable semantic framework for studying machine learning algorithms. Whereas emphasis has been put on training methodologies, less attention has been devoted to…
A skew morphism of a finite group $B$ is a permutation $\varphi$ of $B$ that preserves the identity element of $B$ and has the property that for every $a\in B$ there exists a positive integer $i_a$ such that $\varphi(ab) =…
Pseudorandom sequences with optimal three-level autocorrelation have important applications in CDMA communication systems. Constructing the sequences with three-level autocorrelation is equivalent to finding cyclic almost difference sets as…
Let $F$ be any field of characteristic $p$. It is well-known that there are exactly $p$ inequivalent indecomposable representations $V_1,V_2,...,V_p$ of $C_p$ defined over $F$. Thus if $V$ is any finite dimensional $C_p$-representation…
The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…