scholarly journals An equivalent of Kronecker's theorem for powers of an algebraic number and structure of linear recurrences of fixed length

2012 ◽  
Vol 153 (1) ◽  
pp. 15-33
Author(s):  
Nevio Dubbini ◽  
Maurizio Monge
1968 ◽  
Vol 07 (03) ◽  
pp. 156-158
Author(s):  
Th. R. Taylor

The technique, scope and limitations of a fixed field/fixed length case record utilising the IBM 1232 system is described. The principal problems lie with personnel rather than machinery and with programmes for analysis rather than clinical data.


2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.


Author(s):  
CLEMENS FUCHS ◽  
SEBASTIAN HEINTZE

Abstract Let $ (G_n)_{n=0}^{\infty } $ be a nondegenerate linear recurrence sequence whose power sum representation is given by $ G_n = a_1(n) \alpha _1^n + \cdots + a_t(n) \alpha _t^n $ . We prove a function field analogue of the well-known result in the number field case that, under some nonrestrictive conditions, $ |{G_n}| \geq ( \max _{j=1,\ldots ,t} |{\alpha _j}| )^{n(1-\varepsilon )} $ for $ n $ large enough.


2018 ◽  
Vol 53 (2) ◽  
pp. 128-138
Author(s):  
Sepideh Maleki ◽  
Martin Burtscher
Keyword(s):  

2021 ◽  
Vol 54 (1) ◽  
pp. 1-22
Author(s):  
Rayan Chikhi ◽  
Jan Holub ◽  
Paul Medvedev

The analysis of biological sequencing data has been one of the biggest applications of string algorithms. The approaches used in many such applications are based on the analysis of k -mers, which are short fixed-length strings present in a dataset. While these approaches are rather diverse, storing and querying a k -mer set has emerged as a shared underlying component. A set of k -mers has unique features and applications that, over the past 10 years, have resulted in many specialized approaches for its representation. In this survey, we give a unified presentation and comparison of the data structures that have been proposed to store and query a k -mer set. We hope this survey will serve as a resource for researchers in the field as well as make the area more accessible to researchers outside the field.


2021 ◽  
Vol 69 ◽  
pp. 102946
Author(s):  
María Teresa García-Ordás ◽  
Héctor Alaiz-Moretón ◽  
José Alberto Benítez-Andrades ◽  
Isaías García-Rodríguez ◽  
Oscar García-Olalla ◽  
...  

1955 ◽  
Vol 9 ◽  
pp. 115-118 ◽  
Author(s):  
Tomio Kubota

We shall prove in the present note a theorem on units of algebraic number fields, applying one of the strongest formulations, be Hasse [3], of Grunwald’s existence theorem.


Sign in / Sign up

Export Citation Format

Share Document