scholarly journals Periodic ultradiscrete transformations of the plane with periods of 5, 7, 8, 9

2021 ◽  
Vol 21 (2) ◽  
pp. 127-132
Author(s):  
M.O. Avdeeva ◽  
Keyword(s):  

V.A. Bykovskii constructed three new periodic ultradiscrete transformations of the plane In addition to the two well-known. In his work, only the idea of proving these statements was proposed. We give a complete and detailed proof of them for sequences with periods 5, 7, 8, 9.

1880 ◽  
Vol 10 ◽  
pp. 562-564
Author(s):  
Edmund J. Mills

AbstractHaving had occasion in the course of my work to investigate some of the properties of the mercurial thermometer, I have obtained a series of results which are comprised in a memoir now submitted to the Society. A brief summary of these is given in the following abstract.1. After describing a simple method of calibrating a thermometer, I give a detailed proof (following Pierre) that the calibration unit gradually undergoes a slight diminution in value. In the course of five years this may amount, in a new thermometer, to as much as ·21 per cent. The 0°–100° interval, therefore, requires periodic verification.


2003 ◽  
Vol 68 (1) ◽  
pp. 65-131 ◽  
Author(s):  
Andreas Blass ◽  
Yuri Gurevich

AbstractThis paper developed from Shelah's proof of a zero-one law for the complexity class “choiceless polynomial time,” defined by Shelah and the authors. We present a detailed proof of Shelah's result for graphs, and describe the extent of its generalizability to other sorts of structures. The extension axioms, which form the basis for earlier zero-one laws (for first-order logic, fixed-point logic, and finite-variable infinitary logic) are inadequate in the case of choiceless polynomial time; they must be replaced by what we call the strong extension axioms. We present an extensive discussion of these axioms and their role both in the zero-one law and in general.


2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Frédérique Bassino ◽  
Julien Clément ◽  
J. Fayolle ◽  
P. Nicodème

International audience In this paper, we give the multivariate generating function counting texts according to their length and to the number of occurrences of words from a finite set. The application of the inclusion-exclusion principle to word counting due to Goulden and Jackson (1979, 1983) is used to derive the result. Unlike some other techniques which suppose that the set of words is reduced (<i>i..e.</i>, where no two words are factor of one another), the finite set can be chosen arbitrarily. Noonan and Zeilberger (1999) already provided a MAPLE package treating the non-reduced case, without giving an expression of the generating function or a detailed proof. We give a complete proof validating the use of the inclusion-exclusion principle and compare the complexity of the method proposed here with the one using automata for solving the problem.


2018 ◽  
Vol 10 (2) ◽  
pp. 287-297 ◽  
Author(s):  
Feng Qi ◽  
Ai-Qi Liu

Abstract In the paper, the authors provide five alternative proofs of two formulas for a tridiagonal determinant, supply a detailed proof of the inverse of the corresponding tridiagonal matrix, and provide a proof for a formula of another tridiagonal determinant. This is a companion of the paper [F. Qi, V. Čerňanová,and Y. S. Semenov, Some tridiagonal determinants related to central Delannoy numbers, the Chebyshev polynomials, and the Fibonacci polynomials, Politehn. Univ. Bucharest Sci. Bull. Ser. A Appl. Math. Phys. 81 (2019), in press.


Author(s):  
Sergiu Klainerman ◽  
Jérémie Szeftel

This chapter evaluates the proof for Theorems M4 and M5. It relies on the decay of q, α‎ and α‎ to prove the decay estimates for all the other quantities. More precisely, the chapter relies on the results of Theorems M1, M2, and M3 to prove Theorems M4 and M5. The detailed proof of Theorem M4 provides the main decay estimates in (ext)M. The proof depends in a fundamental way on the geometric properties of the GCM hypersurface Σ‎∗, the spacelike future boundary of (ext)M introduced in section 3.1.2. The chapter then reformulates the main bootstrap assumptions in the form needed in the proof of Theorem M4.


2005 ◽  
Vol 6 (2) ◽  
pp. 247-267 ◽  
Author(s):  
Laszlo Erdös ◽  
David Hasler ◽  
Jan Philip Solovej
Keyword(s):  

1993 ◽  
Vol 47 (3) ◽  
pp. 353-375 ◽  
Author(s):  
M.D. Gould ◽  
R.B. Zhang ◽  
A.J. Bracken

A detailed proof of the quantum double construction is given for Z2 -graded Hopf algebras, and an explicit formula for the graded universal R−matrix is obtained in a general fashion.


2014 ◽  
Vol 889-890 ◽  
pp. 513-517
Author(s):  
Zhong Yi Ren

Arc-gear is sensitive to central distance error, but there havent any literature give detailed proof for how does it sensitive to central distance error. In this article, contact line was analysised, and find that meshing point will move along tooth profile, tansmission ratio will change, overtaking phenomenon appears when there has central distance error, this will cause vibration and noise. The research results is useful for improve arc-gear drive performance.


2008 ◽  
Vol 14 (2) ◽  
pp. 240-257 ◽  
Author(s):  
Jan von Plato

AbstractGentzen writes in the published version of his doctoral thesis Untersuchungen über das logische Schliessen (Investigations into logical reasoning) that he was able to prove the normalization theorem only for intuitionistic natural deduction, but not for classical. To cover the latter, he developed classical sequent calculus and proved a corresponding theorem, the famous cut elimination result. Its proof was organized so that a cut elimination result for an intuitionistic sequent calculus came out as a special case, namely the one in which the sequents have at most one formula in the right, succedent part. Thus, there was no need for a direct proof of normalization for intuitionistic natural deduction. The only traces of such a proof in the published thesis are some convertibilities, such as when an implication introduction is followed by an implication elimination [1934–35, II.5.13]. It remained to Dag Prawitz in 1965 to work out a proof of normalization. Another, less known proof was given also in 1965 by Andres Raggio.We found in February 2005 an early handwritten version of Gentzen's thesis, with exactly the above title, but with rather different contents: Most remarkably, it contains a detailed proof of normalization for what became the standard system of natural deduction. The manuscript is located in the Paul Bernays collection at the ETH-Zurichwith the signum Hs. 974: 271. Bernays must have gotten it well before the time of his being expelled from Göttingen on the basis of the racial laws in April 1933.


Sign in / Sign up

Export Citation Format

Share Document