相关论文: Hilbert's Tenth Problem for function fields of var…

We prove an effective form of Hilbert's irreducibility theorem for polynomials over a global field $K$. More precisely, we give effective bounds for the number of specializations $t\in \mathcal{O}_K$ that do not preserve the irreducibility…

Let M be a field of finite type over {\bf Q} and X a variety defined over M. We study when the set {P \in X(K) \mid f^{\circ n} (P) = P for some n \geq 1} is finite for any finite extension fields K of M and for any dominant K-morphisms f :…

In this short note, we will show the following weak evidence of S. Lang conjecture over function fields. Let f : X ---> Y be a projective and surjective morphism of algebraic varieties over an algebraically closed field k of characteristic…

Fractionally-quadratic transformations which reduce any two-dimensional quadratic system to the special Lienard equation are introduced. Existence criteria of cycles are obtained.

This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…

We investigate the problem of deciding whether a system of linear equations, together with divisibility conditions on the variables, has a solution over holomorphy subrings of global fields. We obtain decidability results when we allow…

Let $H$ be a skew field of finite dimension over its center $k$. We solve the Inverse Galois Problem over the field of fractions $H(X)$ of the ring of polynomial functions over $H$ in the variable $X$, if $k$ contains an ample field.

We establish sharp upper bounds on shifted moments of quadratic Dirichlet $L$-functions over function fields. As an application, we prove some bounds for moments of quadratic Dirichlet character sums over function fields.

Using the technique of formative processes, I solve the decidability problem of MLS with unordered cartesian product in the positive. Moreover I give a pure combinatorial description of the satisfiable MLS with unordered cartesian…

We construct some examples of polynomial maps over finite fields that admit subvarieties with a peculiar property: every geometric point is mapped to a fixed point by some iteration of the map, while the whole subvariety is not. Several…

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a…

For every prime number p, we show the existence of a solvable number field L ramified only at {p and infinity whose p-Hilbert Class field tower is infinite.

Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of…

Let $L$ be a number field. For a given prime $p$ we define integers $\alpha_{p}^{L}$ and $\beta_{p}^{L}$ with some interesting arithmetic properties. For instance, $\beta_{p}^{L}$ is equal to $1$ whenever $p$ does not ramify in $L$ and…

We show that in an ultraproduct of finite fields, the mod-$n$ nonstandard size of definable sets varies definably in families. Moreover, if $K$ is any pseudofinite field, then one can assign "nonstandard sizes mod $n$" to definable sets in…

The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…

The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

The aim is to determine the derivations of the three series of finite-dimensional Z-graded Lie superalgebras of Cartan-type over a field of characteristic p > 3, called the special odd Hamiltonian superalgebras. To that end we first…