scholarly journals Linear perfect codes of infinite length over infinite fields

2020 ◽  
Vol 17 ◽  
pp. 1165-1182
Author(s):  
S. A. Malyugin
10.37236/1962 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Paul Dorbec ◽  
Michel Mollard

We introduce and study a common generalization of 1-error binary perfect codes and perfect single error correcting codes in Lee metric, namely perfect codes on products of paths of length 2 and of infinite length. Both existence and nonexistence results are given.


The theory of the vibrations of the pianoforte string put forward by Kaufmann in a well-known paper has figured prominently in recent discussions on the acoustics of this instrument. It proceeds on lines radically different from those adopted by Helmholtz in his classical treatment of the subject. While recognising that the elasticity of the pianoforte hammer is not a negligible factor, Kaufmann set out to simplify the mathematical analysis by ignoring its effect altogether, and treating the hammer as a particle possessing only inertia without spring. The motion of the string following the impact of the hammer is found from the initial conditions and from the functional solutions of the equation of wave-propagation on the string. On this basis he gave a rigorous treatment of two cases: (1) a particle impinging on a stretched string of infinite length, and (2) a particle impinging on the centre of a finite string, neither of which cases is of much interest from an acoustical point of view. The case of practical importance treated by him is that in which a particle impinges on the string near one end. For this case, he gave only an approximate theory from which the duration of contact, the motion of the point struck, and the form of the vibration-curves for various points of the string could be found. There can be no doubt of the importance of Kaufmann’s work, and it naturally becomes necessary to extend and revise his theory in various directions. In several respects, the theory awaits fuller development, especially as regards the harmonic analysis of the modes of vibration set up by impact, and the detailed discussion of the influence of the elasticity of the hammer and of varying velocities of impact. Apart from these points, the question arises whether the approximate method used by Kaufmann is sufficiently accurate for practical purposes, and whether it may be regarded as applicable when, as in the pianoforte, the point struck is distant one-eighth or one-ninth of the length of the string from one end. Kaufmann’s treatment is practically based on the assumption that the part of the string between the end and the point struck remains straight as long as the hammer and string remain in contact. Primâ facie , it is clear that this assumption would introduce error when the part of the string under reference is an appreciable fraction of the whole. For the effect of the impact would obviously be to excite the vibrations of this portion of the string, which continue so long as the hammer is in contact, and would also influence the mode of vibration of the string as a whole when the hammer loses contact. A mathematical theory which is not subject to this error, and which is applicable for any position of the striking point, thus seems called for.


2021 ◽  
Vol 40 (2) ◽  
Author(s):  
Giselle Strey ◽  
João E. Strapasson ◽  
Sueli I. R. Costa

2021 ◽  
Vol 174 (1) ◽  
Author(s):  
Amirlan Seksenbayev

AbstractWe study two closely related problems in the online selection of increasing subsequence. In the first problem, introduced by Samuels and Steele (Ann. Probab. 9(6):937–947, 1981), the objective is to maximise the length of a subsequence selected by a nonanticipating strategy from a random sample of given size $n$ n . In the dual problem, recently studied by Arlotto et al. (Random Struct. Algorithms 49:235–252, 2016), the objective is to minimise the expected time needed to choose an increasing subsequence of given length $k$ k from a sequence of infinite length. Developing a method based on the monotonicity of the dynamic programming equation, we derive the two-term asymptotic expansions for the optimal values, with $O(1)$ O ( 1 ) remainder in the first problem and $O(k)$ O ( k ) in the second. Settling a conjecture in Arlotto et al. (Random Struct. Algorithms 52:41–53, 2018), we also design selection strategies to achieve optimality within these bounds, that are, in a sense, best possible.


1972 ◽  
Vol 37 (4) ◽  
pp. 677-682 ◽  
Author(s):  
George Metakides

Let α be a limit ordinal with the property that any “recursive” function whose domain is a proper initial segment of α has its range bounded by α. α is then called admissible (in a sense to be made precise later) and a recursion theory can be developed on it (α-recursion theory) by providing the generalized notions of α-recursively enumerable, α-recursive and α-finite. Takeuti [12] was the first to study recursive functions of ordinals, the subject owing its further development to Kripke [7], Platek [8], Kreisel [6], and Sacks [9].Infinitary logic on the other hand (i.e., the study of languages which allow expressions of infinite length) was quite extensively studied by Scott [11], Tarski, Kreisel, Karp [5] and others. Kreisel suggested in the late '50's that these languages (even which allows countable expressions but only finite quantification) were too large and that one should only allow expressions which are, in some generalized sense, finite. This made the application of generalized recursion theory to the logic of infinitary languages appear natural. In 1967 Barwise [1] was the first to present a complete formalization of the restriction of to an admissible fragment (A a countable admissible set) and to prove that completeness and compactness hold for it. [2] is an excellent reference for a detailed exposition of admissible languages.


2009 ◽  
Vol 57 (4) ◽  
pp. 873-878 ◽  
Author(s):  
Haider Al-Lawati ◽  
Fady Alajaji
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document