Related papers: Counting The Generator Matrices of $\mathbb{Z}_{2}…
The paper presents a method to generate some families of linear codes over finite fields of characteristics greater than two in the widest class due to the size of Grassmann manifold, i.e. when the dimension is equal to codimension. Our…
An additive-multiplicative magic square is a square grid of numbers whose rows, columns, and long diagonals all have the same sum (called the magic sum) and the same product (called the magic product). There are numerous open problems about…
We consider the problem of training generative models with deep neural networks as generators, i.e. to map latent codes to data points. Whereas the dominant paradigm combines simple priors over codes with complex deterministic models, we…
We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length 2^N using Boolean functions. The algorithm follows our earlier paraunitary algorithm,…
The spectral test of random number generators (R.R. Coveyou and R.D. McPherson, 1967) is generalized. The sequence of random numbers is analyzed explicitly not just via their n-tupel distributions. The generalized analysis of many…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
In this article, we consider the problem of determining formulas for the number of representations of a natural number $n$ by a sum of figurate numbers with certain positive integer coefficients. To achieve this, we prove that the…
Generalized concatenated codes were introduced in the 1970s by Zinoviev. There are many types of codes in the literature that are known by other names that can be viewed as generalized concatenated codes. Examples include matrix-product…
In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…
We use the generating function of the characters of $C_2$ to obtain a generating function for the multiplicities of the weights entering in the irreducible representations of that simple Lie algebra. From this generating function we derive…
We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…
It is shown that the $M$-algebra related with the $M$ theory comes in two variants. Besides the standard $M$ algebra based on the real structure, an alternative octonionic formulation can be consistently introduced. This second variant has…
We investigate the generation of magnetic fields from non-linear effects around recombination. As tight-coupling is gradually lost when approaching $z\simeq 1100$, the velocity difference between photons and baryons starts to increase,…
Four natural boundary statistics and two natural bulk statistics are considered for alternating sign matrices (ASMs). Specifically, these statistics are the positions of the 1's in the first and last rows and columns of an ASM, and the…
Generating high-quality random numbers with a Gaussian probability distribution function is an important and resource consuming computational task for many applications in the fields of machine learning and Monte Carlo algorithms. Recently,…
In this paper we study two dimensional minimal linear code over the ring $\mathbb{Z}_{p^n}$(where $p$ is prime). We show that if the generator matrix $G$ of the two dimensional linear code $M$ contains $p^n+p^{n-1}$ column vector of the…
This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…
We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…
Deep generative models, such as generative adversarial networks (GANs), are pivotal in discovering novel drug-like candidates via de novo molecular generation. However, traditional character-wise tokenizers often struggle with identifying…
We develop a method for generating pseudorandom binary sequences using the Bernoulli map on cubic algebraic integers. The distinguishing characteristic of our generator is that it generates chaotic true orbits of the Bernoulli map by exact…