Andreas DressBielefeld UniversityFlorian LucaBielefeld UniversitySpringer Berlin HeidelbergDress, A., Luca, F., Unbounded Integer Sequences (An)n≥0 with An+1An-1 -A2n Bounded are of Fibonacci Type, to appear in the Proceedings of AL- COMA99....
Since M never uses more than p(|x|) space on input x, our encoding is well defined for all configurations appearing in the execution of M on x. So M accepts input x if and only if from sx one reaches the configuration tx by a sequence of transitions. Such a transition corresponds ...
Let x/2 denote the integer division by 2. Let odd(x) denote 1 if x is odd, 0 otherwise. Let inc(x,y) denote x+y−odd(x). Then inc(x,1) is the function that moves x to the closest odd number (including itself), and inc(x,2) is the function that moves x to the closes...
In this paper, we extend the methods of Maynard by generalizing the Selberg sieve further and by performing more extensive numerical calculations. As a consequence, we can obtain the boundH1≤246 unconditionally andH1≤6 under the assumption of the generalized Elliott-Halberstam conjecture. Indeed, ...
among all possible sequences of weight w, the probability that this sequence translates a given c ∈ C 1 to a sequence of weight w 2 is given by p = ω 1 n ω 1 ωn (1−ω 1 )n (1−ω 1 )ωn n ωn . This implies that a vector t that is randomly and uniformly chose...
IntD=floor(mn);# integer part of conversion ratio FracD=remainder(mn,1);# fractional part of conversion ratio Int_reg = IntD + 1;# register for input sample count to trigger output calculation frac_reg = 0;# register for output sample time instant ...
For a sequence σσ=p1p2⋯pn∈P∗, we say that σσ is a context if there is a process p∈P such that pi=p for all i:1≤i≤n. We say that ππ is committed (resp. k -bounded) if πlast(π) is committed (resp. if πσσσπ↑=σ1⋅σ2⋅⋯σk where σσi ...
Let n, b and c be positive integers with b c and let A = a iini = 0 n be a sequence of integers such that 0 = a 0 < a 1 <…< a n and a i + b a i + c for all i with 0 i n b. We find all n function of b, c and k, k a positive integer, so that all ...
Regardless of whether 𝛿𝑎𝑥𝑖𝑠δaxis or 𝛿𝐿2δL2 is used, EB-HC merges nearby integer coordinates into fewer unique values, then compresses those representative values (and mapping information) via Huffman coding. Because EB-HC relies on dimension-wise or cluster-based merging (ra...
Regardless of whether 𝛿𝑎𝑥𝑖𝑠δaxis or 𝛿𝐿2δL2 is used, EB-HC merges nearby integer coordinates into fewer unique values, then compresses those representative values (and mapping information) via Huffman coding. Because EB-HC relies on dimension-wise or cluster-based merging (ra...