Related papers: Very good and very bad field generators

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. We find that the mixed multiplicative…

For each nonnegative integer $i$, let $a_i$ be the number of $i$-subsets of $V(G)$ that induce an acyclic subgraph of a given graph $G$. We define $A(G,x) = \sum_{i \geq 0} a_i x^i$ (the generating function for $a_i$) to be the acyclic…

We study perturbations of Feller generators under `lower order terms' with measurable coefficients. We investigate which properties of the original semigroup -- such as positivity, conservativeness and the Feller property -- are passed to…

Quantum fields are considered as generators of infinite-dimensional Clifford algebra $Cl(\infty)$, which can be either orthogonal (in case of fermions) or symplectic (in case of bosons). A generic quantum state can be expressed as a…

Pseudorandom generators (PRGs) for low-degree polynomials are a central object in pseudorandomness, with applications to circuit lower bounds and derandomization. Viola's celebrated construction gives a PRG over the binary field, but with…

We introduce a class of finite dimensional nonlinear superalgebras $L = L_{\bar{0}} + L_{\bar{1}}$ providing gradings of $L_{\bar{0}} = gl(n) \simeq sl(n) + gl(1)$. Odd generators close by anticommutation on polynomials (of degree $>1$) in…

We extend methods of Fontaine, Abrashkin and Schoof to obtain criteria determining number fields K over which no non-zero abelian variety with everywhere good reduction exists. As an application, under the GRH, we find 24744 such fields of…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater than…

One popular generative model that has high-quality results is the Generative Adversarial Networks(GAN). This type of architecture consists of two separate networks that play against each other. The generator creates an output from the input…

Let $\Gamma \,=\, \mathbb{Q}(\sqrt[5]{n})$ be a pure quintic field, where $n$ is a positive integer, $5^{th}$ power-free. Let $k_0\,=\,\mathbb{Q}(\zeta_5)$ be the cyclotomic field containing a primitive $5^{th}$ root of unity $\zeta_5$, and…

For nonzero coprime integers $a$ and $b$, a positive integer $\ell$ is said to be \emph{good with respect to $a$ and $b$} if there exists a positive integer $k$ such that $\ell$ divides $a^{k} + b^{k}$. The concept of good integers has been…

We study the arithmetic complexity of hitting set generators, which are pseudorandom objects used for derandomization of the polynomial identity testing problem. We give new explicit constructions of hitting set generators whose outputs are…

We study degree bounds on rational but not necessarily polynomial generators for the field $\mathbf{k}(V)^G$ of rational invariants of a linear action of a finite abelian group. We show that lattice-theoretic methods used recently by the…

In this paper we introduce a notion of Feynman geometry on which quantum field theories could be properly defined. A strong Feynman geometry is a geometry when the vector space of $A_\infty$ structures is finite dimensional. A weak Feynman…

In the last decade, interest in projective MV-algebras has grown greatly; see [1], [5] e [6]. In this paper we establish a necessary and sufficient condition for n elements of the free n-generator MV-algebra to generate a projective…

It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…

Random tensors are the natural generalization of random matrices to higher order objects. They provide generating functions for random geometries and, assuming some familiarity with random matrix theory and quantum field theory, we discuss…

Let $\mathscr{R}$ denote the ring of real polynomials on $\mathbb{R}^{n}$. Fix $m\geq 0$, and let $A_{1},\cdots ,A_{M}\in \mathscr{R}$. The $ C^{m}$-closure of $\left( A_{1},\cdots ,A_{M}\right) $, denoted here by $ \left[ A_{1},\cdots…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…