Comparing topologies on linearly recursive sequences
نویسندگان
چکیده
منابع مشابه
Linearly Unrelated Sequences
There are not many new results concerning the linear independence of numbers. Exceptions in the last decade are, e.g., the result of Sorokin [8] which proves the linear independence of logarithmus of special rational numbers, or that of Bezivin [2] which proves linear independence of roots of special functional equations. The algebraic independence of numbers can be considered as a generalizati...
متن کاملRecursive Functions on Lazy Lists via Domains and Topologies pdfauthor
The usual definition facilities in theorem provers cannot handle all recursive functions on lazy lists; the filter function is a prime counterexample. We present two new ways of directly defining functions like filter by exploiting their dual nature as producers and consumers. Borrowing from domain theory and topology, we define them as a least fixpoint (producer view) and as a continuous exten...
متن کاملOn the Periodicity of Certain Recursive Sequences
In 2000, Viswanath showed that random Fibonacci sequences grow exponentially and calculated the rate at which they grow assuming the coin flipped was fair. In this paper, we explore the Fibonacci sequences generated by finite, repeating sequences of pluses and minuses. The main results of this paper will be to show the necessary conditions for a sequence to be periodic, as well as to show all t...
متن کاملLinear Recursive Sequences
A sequence is an infinite list of numbers, like The numbers in the sequence are called its terms. The general form of a sequence is a 1 , a 2 , a 3 ,. .. where a n is the n-th term of the sequence. In the example (1) above, a 1 = 1, a 2 = 2, a 3 = 4, and so on. The notations {a n } or {a n } ∞ n=1 are abbreviations for a 1 , a Occasionally the indexing of the terms will start with something oth...
متن کاملSecure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matrix: Bob holds an n×n matrix, encrypted with Alice’s secret key, and wants to learn whether or not the matrix is singular (while leaking nothing further). We give an interactive protocol between Alice and Bob that solv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2019
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1436.7a2