Related papers: Very good and very bad field generators

This article is a survey of two subjects: the first part is devoted to field generators in two variables, and the second to birational endomorphisms of the affine plane. Each one of these subjects originated in Abhyankar's seminar in Purdue…

In this paper, for a field $k$ of characteristic zero and a finitely generated $k$-algebra $R$, we give a set of generators for the image ideals of irreducible nice and quasi-nice $R$-derivations on the polynomial ring $R[X,Y]$, where $R$…

For a finite valued field extension $(L/K,v)$ we describe the problem of find sets of generators for the corresponding extension $\mathcal O_L/\mathcal O_K$ of valuation rings. The main tool to obtain such sets are complete sets of (key)…

We classify the pairs of polynomials $f,g$ over a field $K$, such that $f(X)-g(Y)$ has a factor of total degree at most 2. This was done by Y. Bilu for characteristic 0 fields $K$. As his method does not work in positive characteristic, we…

Semi-supervised learning methods based on generative adversarial networks (GANs) obtained strong empirical results, but it is not clear 1) how the discriminator benefits from joint training with a generator, and 2) why good semi-supervised…

This paper targets to search so-called \emph{good} generators by doing a brief survey over the generators developed in the history of pseudo-random number generators (PRNGs), verify their claims and rank them based on strong empirical tests…

This is a revised version of ANT-0045. If K is a number field of degree n with discriminant D, if K=Q(a) then H(a)>c(n)|D|^(1/(2n-2)) where H(a) is the height of the minimal polynomial of a. We ask if one can always find a generator a of K…

Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This…

Let $K/k$ be a finite extension of a global field. Such an extension can be generated over $k$ by a single element. The aim of this article is to prove the existence of a "small" generator in the function field case. This answers the…

We study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…

In this paper, we propose one index $i_1(f)-i_2(f)$ which measures how well-behaved a given finitely determined multigerm $f: (\mathbb{K}^n,S)\to (\mathbb{K}^p,0)$ $(n\le p)$ of corank at most one is from the viewpoint of liftable vector…

The paper is devoted to invariant theory problems. In particular, to the problem of finding generators of invariant fields in an explicit form. The set of generators is given for invariant field of unitriangular group of adjoint…

Let M be a smooth manifold, and let O(M) be the poset of open subsets of M. Let C be a category that has a zero object and all small limits. A homogeneous functor (in the sense of manifold calculus) of degree k from O(M) to C is called very…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

We define standardized constructions of finite fields, and standardized generators of (multiplicative) cyclic subgroups in these fields. The motivation is to provide a substitute for Conway polynomials which can be used by various software…

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length $s\ell$ with index $s$ over the finite field $\mathbb{F}$ are $\mathbb{F}[y]$-submodules of the ring $\frac{\mathbb{F}[x,y]}{<…

The generation of pseudorandom elements over finite fields is fundamental to the time, space and randomness complexity of randomized algorithms and data structures. We consider the problem of generating $k$-independent random values over a…

Suppose $I$ is an ideal of a polynomial ring over a field, $I\subseteq k[x_1,\ldots,x_n]$, and whenever $fg\in I$ with degree $\leq b$, then either $f\in I$ or $g\in I$. When $b$ is sufficiently large, it follows that $I$ is prime.…

Two-dimensional cyclic codes of length $n=\ell s$ over the finite field $\mathbb{F}$ are ideals of the polynomial ring $\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >}$. The aim of this paper, is to present a novel method to study the…

We discuss the problem of calculating generators of power integral bases in sextic fields, especially focusing on the case of sextic fields with real quadratic subfields. Our main purpose is to describe an efficient algorithm for…