Page 1 Next

## Displaying 1 – 20 of 24

Showing per page

Acta Arithmetica

### Definability within structures related to Pascal’s triangle modulo an integer

Fundamenta Mathematicae

Let Sq denote the set of squares, and let $S{Q}_{n}$ be the squaring function restricted to powers of n; let ⊥ denote the coprimeness relation. Let ${B}_{n}\left(x,y\right)=\left(\genfrac{}{}{0pt}{}{x+y}{x}\right)MODn$. For every integer n ≥ 2 addition and multiplication are definable in the structures ⟨ℕ; Bn,⊥⟩ and ⟨ℕ; Bn,Sq⟩; thus their elementary theories are undecidable. On the other hand, for every prime p the elementary theory of ⟨ℕ; Bp,SQp⟩ is decidable.

### Deux propriétés décidables des suites récurrentes linéaires

Bulletin de la Société Mathématique de France

Acta Arithmetica

### Diophantine representation of the decimal expansions of $e$ and $\pi$

Mathematica Slovaca

### Diophantine undecidability for addition and divisibility in polynomial rings

Fundamenta Mathematicae

We prove that the positive-existential theory of addition and divisibility in a ring of polynomials in two variables A[t₁,t₂] over an integral domain A is undecidable and that the universal-existential theory of A[t₁] is undecidable.

### Diophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic 0

Annales de l’institut Fourier

Let $K$ be a one-variable function field over a field of constants of characteristic 0. Let $R$ be a holomorphy subring of $K$, not equal to $K$. We prove the following undecidability results for $R$: if $K$ is recursive, then Hilbert’s Tenth Problem is undecidable in $R$. In general, there exist ${x}_{1},...,{x}_{n}\in R$ such that there is no algorithm to tell whether a polynomial equation with coefficients in $ℚ\left({x}_{1},...,{x}_{n}\right)$ has solutions in $R$.

### Division-ample sets and the Diophantine problem for rings of integers

Journal de Théorie des Nombres de Bordeaux

We prove that Hilbert’s Tenth Problem for a ring of integers in a number field $K$ has a negative answer if $K$ satisfies two arithmetical conditions (existence of a so-called division-ample set of integers and of an elliptic curve of rank one over $K$). We relate division-ample sets to arithmetic of abelian varieties.

### Existence of rational points on smooth projective varieties

Journal of the European Mathematical Society

### Extensions of Büchi's problem: Questions of decidability for addition and kth powers

Fundamenta Mathematicae

We generalize a question of Büchi: Let R be an integral domain, C a subring and k ≥ 2 an integer. Is there an algorithm to decide the solvability in R of any given system of polynomial equations, each of which is linear in the kth powers of the unknowns, with coefficients in C? We state a number-theoretical problem, depending on k, a positive answer to which would imply a negative answer to the question for R = C = ℤ. We reduce a negative answer for k = 2 and for...

### Hilbert's Tenth Problem for fields of rational functions over finite fields.

Inventiones mathematicae

### O desátém Hilbertově problému

Pokroky matematiky, fyziky a astronomie

Acta Arithmetica

### Structures related to Pascal’s triangle modulo $2$ and their elementary theories

Mathematica Slovaca

### The cyclicity problem for the images of Q-rational series

RAIRO - Theoretical Informatics and Applications

We show that it is decidable whether or not a given Q-rational series in several noncommutative variables has a cyclic image. By definition, a series r has a cyclic image if there is a rational number q such that all nonzero coefficients of r are integer powers of q.

### The cyclicity problem for the images of Q-rational series

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We show that it is decidable whether or not a given Q-rational series in several noncommutative variables has a cyclic image. By definition, a series r has a cyclic image if there is a rational number q such that all nonzero coefficients of r are integer powers of q.

### The minimal resultant locus

Acta Arithmetica

Let K be a complete, algebraically closed nonarchimedean valued field, and let φ(z) ∈ K(z) have degree d ≥ 2. We study how the resultant of φ varies under changes of coordinates. For γ ∈ GL₂(K), we show that the map $\gamma ↦ord\left(Res\left({\phi }^{\gamma }\right)\right)$ factors through a function $ordRe{s}_{\phi }\left(·\right)$ on the Berkovich projective line, which is piecewise affine and convex up. The minimal resultant is achieved either at a single point in $P{¹}_{K}$, or on a segment, and the minimal resultant locus is contained in the tree in $P{¹}_{K}$ spanned by the fixed points and poles...

### The positivity problem for fourth order linear recurrence sequences is decidable

Colloquium Mathematicae

The problem whether each element of a sequence satisfying a fourth order linear recurrence with integer coefficients is nonnegative, referred to as the Positivity Problem for fourth order linear recurrence sequence, is shown to be decidable.

### Twin prime problem in an arithmetic without induction

Commentationes Mathematicae Universitatis Carolinae

### Арифметические представления степеней

Zapiski naucnych seminarov Leningradskogo

Page 1 Next