<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Counting Frobenius extensions over local function fields</dc:title>
   	<dc:creator>Klüners, Jürgen</dc:creator>
   	<dc:creator>Müller, Raphael</dc:creator>
   	<dc:description>We determine the asymptotic growth of extensions of local function fields of characteristic p counted by discriminant, where the Galois group is a subgroup of the affine group AGL_1(p). More general, we solve the corresponding counting problems for all groups which arise in a tower of a cyclic extension of order p over a cyclic extension of degree d coprime to p. This in particular give answers for certain non-abelian groups including S_3, dihedral groups of order 2p, and many Frobenius groups.</dc:description>
   	<dc:date>2026</dc:date>
   	<dc:type>info:eu-repo/semantics/preprint</dc:type>
   	<dc:type>doc-type:preprint</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_816b</dc:type>
   	<dc:identifier>https://ris.uni-paderborn.de/record/65358</dc:identifier>
   	<dc:source>Klüners J, Müller R. Counting Frobenius extensions over local function fields. &lt;i&gt;arXiv:260402152&lt;/i&gt;. Published online 2026.</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2604.02152</dc:relation>
   	<dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
