Related papers: Small generators of function fields

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

Let $k$ be a number field, suppose that $B$ is a central simple division algebra over $k$, and choose any maximal order $\mathcal{D}$ of $B$. The object of this paper is to show that the group $\mathcal{D}_S^*$ of $S$-units of $B$ is…

We construct compact descriptions of function fields and number fields.

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

We give constructions of some special cases of $[n,k]$ Reed-Solomon codes over finite fields of size at least $n$ and $n+1$ whose generator matrices have constrained support. Furthermore, we consider a generalisation of the GM-MDS…

We show that for each abelian number field $K$ of sufficiently large degree $d$ there exists an element $\alpha\in K$ with $K=\IQ(\alpha)$ and absolute Weil height $H(\alpha)\ll_d |\Delta_K|^{1/2d}$ , where $\Delta_K$ denotes the…

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…

In this paper we find the generating function for the number of vertices that have k elements in their subtree and use this generating function to calculate the probability that a vertex has a size k subtree. We also show how this same…

In this paper we exhibit a minimal set of generators form the annihilator of even neat elements of the exterior algebra of a vector space, when the base field is of positive characteristic and thus we prove the conjecture we established in…

We study the following question: given a global field $F$ and finite group $G$, what is the minimal $r$ such that there exists a finite extension $K/F$ with $\mathrm{Aut}(K/F)\cong G$ that is ramified over exactly $r$ places of $F$? We…

We discuss a method for computing the generating function for the multiplicity distribution in field theories with strong time dependent external sources. At leading order, the computation of the generating function reduces to finding a…

Normal bases in finite fields constitute a vast topic of large theoretical and practical interest. Recently, $k$-normal elements were introduced as a natural extension of normal elements. The existence and the number of $k$-normal elements…

The small object argument is a method for transfinitely constructing weak factorization systems originally motivated by homotopy theory. We establish a variant of the small object argument that is enriched over a cofibrantly generated weak…

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

Let G be a finite group. It has recently been proved that every nontrivial element of G is contained in a generating set of minimal size if and only if all proper quotients of G require fewer generators than G. It is natural to ask which…

We consider generating functionals for computing correlators in quantum field theories with random potentials. Examples of such theories include condensed matter systems with quenched disorder (e.g. spin glass) or cosmological systems in…

Let $D>1$ be an integer, and let $b=b(D)>1$ be its smallest divisor. We show that there are infinitely many number fields of degree $D$ whose primitive elements all have relatively large height in terms of $b$, $D$ and the discriminant of…

For $n$ and $k$ integers we introduce the notion of some partition of $n$ being able to generate another partition of $n$. We solve the problem of finding the minimum size partition for which the set of partitions this partition can…

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…