AI Chat AI Image Generator AI Video Text to Speech

On the Skolem Problem and Prime Powers

06/12/2020

∙

by George Kenison, et al.

∙

∙

The Skolem Problem asks, given a linear recurrence sequence (u_n), whether there exists n∈ℕ such that u_n=0. In this paper we consider the following specialisation of the problem: given in addition c∈ℕ, determine whether there exists n∈ℕ of the form n=lp^k, with k,l≤ c and p any prime number, such that u_n=0.

George Kenison
8 publications
Richard Lipton
1 publication
Joël Ouaknine
29 publications
James Worrell
37 publications

page 1

page 2

page 3

page 4

research

∙ 03/01/2019

On the Existence of Perfect Splitter Sets

Given integers k_1, k_2 with 0< k_1<k_2, the determinations of all posit...

0 Pingzhi Yuan, et al. ∙

research

∙ 10/25/2019

A Curious Link Between Prime Numbers, the Maundy Cake Problem and Parallel Sorting

We present new theoretical algorithms that sums the n-ary comparators ou...

0 Jonathan Blanchette, et al. ∙

research

∙ 04/26/2018

Linear (2,p,p)-AONTs do Exist

A (t,s,v)-all-or-nothing transform (AONT) is a bijective mapping defined...

0 Xin Wang, et al. ∙

research

∙ 04/03/2023

On the Prime Number Divisibility by Deep Learning

Certain tasks such as determining whether a given integer can be divided...

0 Da Wu, et al. ∙

research

∙ 01/18/2019

Boolean lifting property in quantales

In ring theory, the lifting idempotent property (LIP) is related to some...

0 Daniela Cheptea, et al. ∙

research

∙ 01/13/2020

On the Jacobi sums over Galois rings

In this paper, we study the Jacobi sums over Galois rings of arbitrary c...

0 Dengming Xu, et al. ∙

research

∙ 03/25/2018

Goldbach's Function Approximation Using Deep Learning

Goldbach conjecture is one of the most famous open mathematical problems...

0 Avigail Stekel, et al. ∙