English
Related papers

Related papers: Explicit genus formula for any separable cubic glo…

200 papers

In this work we give direct proofs of two theorems concerning explicitly defined polynomial vector fields connected to differentiation of hyperelliptic functions of any genus. We prove that the operators determining the fields commute, and…

Commutative Algebra · Mathematics 2025-12-17 E. Yu. Bunkova

Let $X$ be a definable group definable over a small model $M_0$. Recall that a global type $p$ on $X$ is definable $f$-generic over $M_0$ if every left translate of $p$ is definable over $M_0$. We call $p$ strongly $f$-generic over $M_0$ if…

Logic · Mathematics 2023-11-01 Ningyuan Yao , Zhentao Zhang

We obtain an explicit expression for the number of ramified coverings of the sphere by the torus with given ramification type for a small number of ramification points, and conjecture this to be true for an arbitrary number of ramification…

Algebraic Geometry · Mathematics 2007-05-23 P. P. Goulden , D. M. Jackson , A. Vainshtein

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

Group Theory · Mathematics 2018-10-02 Jonas Deré , Mark Pengitore

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

Logic in Computer Science · Computer Science 2007-05-23 J. V. Tucker , J. I. Zucker

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

Logic in Computer Science · Computer Science 2007-12-11 Klaus Aehlig , Arnold Beckmann

Let $G$ be a finite abelian $p$-group. We count \'etale $G$-extensions of global rational function fields $\mathbb F_q(T)$ of characteristic $p$ by the degree of what we call their Artin-Schreier conductor. The corresponding (ordinary)…

Number Theory · Mathematics 2025-07-23 Fabian Gundlach

Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…

Logic · Mathematics 2016-03-10 Vera Fischer , Sy David Friedman , Asger Törnquist

Some time ago we extended our monogenity investigations and calculations of generators of power integral bases to the relative case. Up to now we considered (usually totally real) extensions of complex quartic fields. In the present paper…

Number Theory · Mathematics 2020-04-14 István Gaál

We describe a straightforward construction of the pseudo-split absolutely pseudo-simple groups of minimal type with irreducible root systems of type $BC_n$; these exist only in characteristic $2$. We also give a formula for the dimensions…

Group Theory · Mathematics 2024-01-09 Michael Bate , Gerhard Röhrle , Damian Sercombe , David I. Stewart

In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…

Discrete Mathematics · Computer Science 2016-08-12 Nader H. Bshouty , Nuha Diab , Shada R. Kawar , Robert J. Shahla

Let $\mathcal F=(F, +. \cdot, <, 0, 1, \dots)$ be a definably complete locally o-minimal expansion of an ordered field. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several…

Logic · Mathematics 2026-01-09 Masato Fujita , Tomohiro Kawakami

Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…

Data Structures and Algorithms · Computer Science 2015-03-27 Chandan Dubey , Thomas Holenstein

We study function fields of curves over a base field $K$ which is either a global field or a large field having a separable field extension of degree divisible by $4$. We show that, for any such function field, Hilbert's 10th Problem has a…

Number Theory · Mathematics 2025-09-24 Karim Johannes Becher , Nicolas Daans , Philip Dittmann

We determine a precise necessary and sufficient condition for completeness of the Hamiltonian vector field associated to a homogeneous cubic polynomial on a symplectic plane.

Symplectic Geometry · Mathematics 2015-05-05 P. L. Robinson

Let $T$ be a complete, model-complete, geometric dp-minimal $\mathcal{L}$-theory of topological fields of characteristic $0$ and let $T(\partial)$ be the theory of expansions of models of $T$ by a derivation $\partial$. We assume that…

Logic · Mathematics 2025-05-13 Françoise Point

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

Logic · Mathematics 2014-02-26 G. O. Jones , A. J. Wilkie

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…

Representation Theory · Mathematics 2007-05-23 Jeb F. Willenbring , Gregg J. Zuckerman

We introduce a common generalization of essentially all known methods for explicit computation of Selmer groups, which are used to bound the ranks of abelian varieties over global fields. We also simplify and extend the proofs relating what…

Number Theory · Mathematics 2016-08-03 Nils Bruin , Bjorn Poonen , Michael Stoll

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

Number Theory · Mathematics 2021-05-18 Simon Kuttner , Qiang Wang