ORDINAL NUMBERS IN ARITHMETIC PROGRESSION

The class of all ordinal numbers can be partitioned into two subclasses in such a way that neither subclass contains an arithmetic progression of order type ω, where an arithmetic progression of order type τ means an increasing sequence of ordinal numbers (ß + δγ)γ<γ<>r, δ ≠ 0.     

On End-Extensions of Models of ¬exp

Every model of IΔ₀ is the tally part of a model of the stringlanguage theory Th-FO (a main feature of which consists in having induction on notation restricted to certain AC⁰. sets). We show how to “smoothly” introduce in Th-FO the binary length function, whereby it is possible to make exponential assumptions in models of Th-FO. These considerations entail that every model of IΔ₀ + ¬exp is a proper initial segment of a model of Th-FO and that a modicum of bounded collection is true in these models. Mathematics Subject Classification: 03F30, 03C62, 68Q15.     

LAMOST光纤单元定位参数研究

大天区多目标光纤光谱天文望远镜LAMOST是世界上光谱获取量最大的望远镜,4000个双回转光纤单元的精确定位是关键因素之一。根据对星像观测的要求以及单元的定位方式,确立了所需的7个定位参数,研究了在复杂现场环境下获取定位参数的具体流程和可行性算法,包括光重心法、摄像机快速标定算法、基于最小二乘拟合圆算法、空间坐标旋转算法等。通过模拟星像观测仿真测试和现场星像试观测证明,定位参数精度能很好地满足观测需求。目前LAMOST望远镜观测光谱获取率已达到90%以上。     

Minimality and other properties of the width- nonadjacent form

Let be an integer and let be the set of integers that includes zero and the odd integers with absolute value less than . Every integer can be represented as a finite sum of the form , with , such that of any consecutive 's at most one is nonzero. Such representations are called width- nonadjacent forms (-NAFs). When these representations use the digits and coincide with the well-known nonadjacent forms. Width- nonadjacent forms are useful in efficiently implementing elliptic curve arithmetic for cryptographic applications. We provide some new results on the -NAF. We show that -NAFs have a minimal number of nonzero digits and we also give a new characterization of the -NAF in terms of a (right-to-left) lexicographical ordering. We also generalize a result on -NAFs and show that any base 2 representation of an integer, with digits in , that has a minimal number of nonzero digits is at most one digit longer than its binary representation.

     

Short interval asymptotics for a class of arithmetic functions

Summary We provide a general asymptotic formula which permits applications to sums like <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"6"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"7"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"8"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"9"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation> \sum_{x< n\le x+y} \big(d(n)\big)^2, \quad \sum_{x< n\le x+y} d(n^3),\quad \sum_{x< n\le x+y}\big(r(n)\big)^2, \quad \sum_{x< n\le x+y}r(n^3), $$ where $d(n)$ and $r(n)$ are the usual arithmetic functions (number of divisors, sums of two squares), and $y$ is small compared to~$x$.     

On the local distribution of certain arithmetic functions

Let d(n), σ ₁(n), and φ(n) stand for the number of positive divisors of n, the sum of the positive divisors of n, and Euler’s function, respectively. For each ν ∈, Z, we obtain asymptotic formulas for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd integer m as well as for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd rational number r. Our method also applies when φ(n) is replaced by σ ₁(n), thus, improving upon an earlier result of Bateman, Erdős, Pomerance, and Straus, according to which the set of integers n such that is an integer is of density 1/2. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 3, pp. 315–331, July–September, 2006.     

Quantum Fourier Transform-Based Arithmetic Logic Unit on a Quantum Processor

This study proposes and construct a primitive quantum arithmetic logic unit (qALU) based on the quantum Fourier transform (QFT). The qALU is capable of performing arithmetic ADD (addition) and logic NAND gate operations. It designs a scalable quantum circuit and presents the circuits for driving ADD and NAND operations on two-input and four-input quantum channels, respectively. By comparing the required number of quantum gates for serial and parallel architectures in executing arithmetic addition, it evaluates the performance. It also execute the proposed quantum Fourier transform-based qALU design on real quantum processor hardware provided by IBM. The results demonstrate that the proposed circuit can perform arithmetic and logic operations with a high success rate. Furthermore, it discusses in detail the potential implementations of the qALU circuit in the field of computer science, highlighting the possibility of constructing a soft-core processor on a quantum processing unit.     

Intuitionistic nonstandard bounded modified realisability and functional interpretation

We present a bounded modified realisability and a bounded functional interpretation of intuitionistic nonstandard arithmetic with nonstandard principles.The functional interpretation is the intuitionistic counterpart of Ferreira and Gaspar's functional interpretation and has similarities with Van den Berg, Briseid and Safarik's functional interpretation but replacing finiteness by majorisability.We give a threefold contribution: constructive content and proof-theoretical properties of nonstandard arithmetic; filling a gap in the literature; being in line with nonstandard methods to analyse compactness arguments.