#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1985

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jan De Beule, Jeroen Demeyer, Klaus Metsch, Morgan Rodgers
- Des. Codes Cryptography
- 2016

In this paper, we describe a new infinite family of q −1 2 -tight sets in the hyperbolic quadrics Q(5, q), for q ≡ 5 or 9 mod 12. Under the Klein correspondence, these correspond to Cameron–Liebler line classes of PG(3, q) having parameter q −1 2 . This is the second known infinite family of nontrivial Cameron–Liebler line classes, the first family having… (More)

In [Phe00] Thanases Pheidas proves, what he calls, existential divisibility lemmas for K = Fq(z) where q is a prime congruent to 3 mod 4 and for K = Q. Let R be the set of primes p in Z, respectively in Fq[t], such that −1 is not a square in the residue field of p. The existential divisibility lemmas state the existence of an existential formula φ(x, y)… (More)

- J P Fauchier, P Cosnay, +4 authors J F Demeyer
- Archives des maladies du coeur et des vaisseaux
- 1985

Flecainide, a new Vaughan-Williams Class Ic anti-arrhythmic agent, was used in 21 patients with an accessory AV conduction pathway which was apparent in 16 cases (WPW syndrome), latent in 1 case and concealed in 4 cases (block in the anterograde direction). Seventeen patients had spontaneous and inducible arrhythmias; 13 supraventricular tachycardias (SVT)… (More)

- JEROEN DEMEYER
- 2008

Let R be a number field or a recursive subring of a number field and consider the polynomial ring R[T ]. We show that the set of polynomials with integer coefficients is diophantine over R[T ]. Applying a result by Denef, this implies that every recursively enumerable subset of R[T ]k is diophantine over R[T ].

- Claudia Degroote, Jeroen Demeyer
- J. Symb. Log.
- 2014

- Jeroen Demeyer, William Stein, Ursula Whitcher
- ArXiv
- 2016

As developers of SageMath, we show how open software facilitates corrections. “Commercial computer algebra systems are black boxes, and their algorithms are opaque to the users,” complained a trio ofmathematicianswhose “misfortunes” are detailed in a recent Notices article [2]. “We reported the bug on October 7, 2013...By June 2014, nothing had changed… (More)

- Jeroen Demeyer
- 2009

Let K be a field with a valuation satisfying the following conditions: both K and the residue field k have characteristic zero; the value group is not 2-divisible; there exists a maximal subfield F in the valuation ring such that Gal(F̄ /F ) and Gal(k̄/k) have the same 2-cohomological dimension and this dimension is finite. Then Hilbert’s Tenth Problem has… (More)

- Jeroen Demeyer
- 2008

Let R be a recursive noetherian integral domain of characteristic zero with fraction field K. Assume that K is finitely generated (as a field) over Q. Equivalently, assume that K is the function field of a variety over a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z]. 2000 MSC: 11D99 (primary), 03D25,… (More)

Consider the language L = {+, ·, 0, 1,#,≤}, where #(x, y) := x Question 3 (Demeyer). Consider the ring Fq[W,Z]. Does there exist a Diophantine predicate α(f,~g) with f ∈ Fq[W,Z] and ~g ∈ Fq[Z] n such that (1) For all f ∈ Fq[W,Z], there exists a ~g ∈ Fq[Z] n such that α(f,~g) holds. (2) For all ~g ∈ Fq[Z] , the set {f ∈ Fq[W,Z] | α(f,~g) holds} is finite.… (More)

- ‹
- 1
- ›