منابع مشابه
Divisibility problem for one relator monoids
Theorem 1 The word problem for any 1-relator monoids can be reduced to the left side divisibility problem for monoids M presented in 2 generators by 1 defining relation of the form aU = bV . For the solution of this problem it sufficies to find an algorithm to recognize for any word aW (or for any word bW ) whether or not it is left side divisible in M by the letter b (accordingly by the letter...
متن کاملThe Diophantine Problem for Addition and Divisibility
An algorithm is given for deciding existential formulas involving addition and the divisibility relation over the natural numbers. In this paper it will be shown that there is an algorithm for deciding formulas of the form k 0) 3x,.3x„6N A /,(*.,..., xn)\g¡(xx, ...,xtt) /-I in N (the natural numbers), where the / and g¡ are linear polynomials with integer coefficients. (a\b means "a divides b"....
متن کاملA problem related to the divisibility of exponential sums
Francis Castro, et al computed the exact divisibility of families of exponential sums associated to binomials F (X) = aX1 + bX2 over Fp, and a conjecture is presented for related work. Here we study this question.
متن کاملPerfect divisibility and 2-divisibility
A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that ω(A) < ω(H) and ω(B) < ω(H). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that H[A] is perfect and ω(B) < ω(H). We prove that if a graph is (P5, C5)-free, then it is 2-divisibl...
متن کاملOn a divisibility relation for Lucas sequences
Article history: Received 9 October 2015 Received in revised form 24 November 2015 Accepted 26 November 2015 Available online 8 January 2016 Communicated by Steven J. Miller MSC: 11B39
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rendiconti del Seminario Matematico della Università di Padova
سال: 2013
ISSN: 0041-8994
DOI: 10.4171/rsmup/130-8