Polygonal chain sequences in the space of compact sets.
Schlicker, Steven, Morales, Lisa, Schultheis, Daniel (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Schlicker, Steven, Morales, Lisa, Schultheis, Daniel (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Fédou, Jean-Marc, Fici, Gabriele (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Schlage-Puchta, Jan-Christoph (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Keiichi Miyajima, Takahiro Kato (2010)
Formalized Mathematics
Similarity:
This article extends the [10]. We define the sum and the product of the sequence of complex numbers, and formalize these theorems. Our method refers to the [11].
Darvasi, Gyula (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Qi, Feng, Debnath, Lokenath (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Jose C. Iniguez, B. Argentina Iniguez (2008)
The Teaching of Mathematics
Similarity:
Langley, Thomas, Liese, Jeffrey, Remmel, Jeffrey (2011)
Journal of Integer Sequences [electronic only]
Similarity:
Kärki, Tomi, Lacroix, Anne, Rigo, Michel (2010)
Journal of Integer Sequences [electronic only]
Similarity:
Katsumi Wasaki (2008)
Formalized Mathematics
Similarity:
We continue to formalize the concept of the Generalized Full Addition and Subtraction circuits (GFAs), define the structures of calculation units for the Redundant Signed Digit (RSD) operations, then prove its stability of the calculations. Generally, one-bit binary full adder assumes positive weights to all of its three binary inputs and two outputs. We define the circuit structure of two-types n-bit GFAs using the recursive construction to use the RSD arithmetic logical units that...
Noboru Endou, Hiroyuki Okazaki, Yasunari Shidama (2013)
Formalized Mathematics
Similarity:
Double sequences are important extension of the ordinary notion of a sequence. In this article we formalized three types of limits of double sequences and the theory of these limits.
Yatsuka Nakamura, Hisashi Ito (2008)
Formalized Mathematics
Similarity:
Here, we develop the theory of zero based finite sequences, which are sometimes, more useful in applications than normal one based finite sequences. The fundamental function Sgm is introduced as well as in case of normal finite sequences and other notions are also introduced. However, many theorems are a modification of old theorems of normal finite sequences, they are basically important and are necessary for applications. A new concept of selected subsequence is introduced. This concept...