The Sprague-Grundy function of the game Euclid

We show that the Sprague-Grundy function of the game Euclid is given by g(x,y)=⌊|y/x-x/y|⌋ for x,y≥1.     

Brouwer and Euclid

We explore the relationship between Brouwer’s intuitionistic mathematics and Euclidean geometry. Brouwer wrote a paper in 1949 called The contradictority of elementary geometry. In that paper, he showed that a certain classical consequence of the parallel postulate implies Markov’s principle, which he found intuitionistically unacceptable. But Euclid’s geometry, having served as a beacon of clear and correct reasoning for two millennia, is not so easily discarded.Brouwer started from a “theorem” that is not in Euclid, and requires Markov’s principle for its proof. That means that Brouwer’s paper did not address the question whether Euclid’s Elements really requires Markov’s principle. In this paper we show that there is a coherent theory of “non-Markovian Euclidean geometry”. We show in some detail that our theory is an adequate formal rendering of (at least) Euclid’s Book I, and suffices to define geometric arithmetic, thus refining the author’s previous investigations (which include Markov’s principle as an axiom).Philosophically, Brouwer’s proof that his version of the parallel postulate implies Markov’s principle could be read just as well as geometric evidence for the truth of Markov’s principle, if one thinks the geometrical “intersection theorem” with which Brouwer started is geometrically evident.     

n维欧氏空间的等角变换

在文[1—4]的基础上,运用矩阵理论讨论了”维欧氏空间上的等角变换的判定条件和性质以及可对角化的几个必要条件,对现有结论有一定的推广．     

A New Table of Binary/Ternary Mixed Covering Codes

A table of upper bounds for K3,2(n1,n2;R), the minimum number of codewords in a covering code with n1 ternary coordinates, n2 binary coordinates, and covering radius R, in the range n = n1 + n2 13, R 3, is presented. Explicit constructions of codes are given to prove the new bounds and verify old bounds. These binary/ternary covering codes can be used as systems for the football pool game. The results include a new binary code with covering radius 1 proving K2(13,1) 736, and the following upper bound for the football pool problem for 9 matches: K3(9,1) 1356.     

The Sprague–Grundy function of the real game Euclid

The game Euclid, introduced and named by Cole and Davie, is played with a pair of nonnegative integers. The two players move alternately, each subtracting a positive integer multiple of one of the integers from the other integer without making the result negative. The player who reduces one of the integers to zero wins. Unfortunately, the name Euclid has also been used for a subtle variation of this game due to Grossman in which the game stops when the two entries are equal. For that game, Straffin showed that the losing positions (a,b) with a<b are precisely the same as those for Cole and Davie’s game. Nevertheless, the Sprague–Grundy functions are not the same for the two games. We give an explicit formula for the Sprague–Grundy function for the original game of Euclid and we explain how the Sprague–Grundy functions of the two games are related.     

加权欧氏距离及其应用

本文定义了加权欧氏距离并讨论了它的性质 ,然后应用加权欧氏距离对 2 0 0 0年奥运金牌榜国家前 10名进行了聚类分析。     

一类二元容错码的扩展和算法

d-析取矩阵是非适应性群测(NGT)算法和二元叠加码最有效的数学模型,研究了d-析取矩阵M_q(n,k,d)的扩展码M_q~*(n,k,d)的析取性和容错性.     

改进二元分布估计算法求解置换流水车间调度问题

针对置换流水车间调度这类组合最优化问题的求解,提出了一种改进二元分布估计算法(Improved binary estimation distribution algorithm, I-EDA)。算法以二元分布估计算法为架构,使用NEH(Nawaz-Enscore-Ham)启发式算法生成初始解,提高了初始解的质量;通过对优势解的统计采样构建位置矩阵模型和链接矩阵模型,依照两个矩阵模型的合并概率组合链接区块产生子代。提出了NEH插入式重组策略和基于位置概率的交换策略和两种全新局部搜索机制替代原二元分布估计算法的相邻交换法,以进一步筛选优势解。最后通过对Reeves标准测试集的仿真实验和算法比较验证了所提出算法的有效性。     

What's wrong with Euclid Book V

Not having the real numbers, Euclid defined ratios abstractlyin Book V for use in geometric theorems, but failed to defineratios of ratios, in effect blocking certain further developmentsof Greek mathematics. We introduce a new axiom that can be usedinstead of subtraction, not only to prove the propositions ofBook V but also to define ratios of ratios.     

改进的二进制粒子群算法求解车辆路径问题

设计了一种改进的二进制粒子群优化算法来求解车辆路径问题,算法基于粒子群算法的寻优模式充分考虑粒子之间的导向作用,改进二进制粒子群算法的位取值方式,减小了在进化过程中停滞于局部最优解的概率,并通过构造辅助函数处理优化问题的约束条件,基于分层次实现多个目标的思路来寻优,提高了算法的搜索效率和计算速度.实验测试结果验证了该算法对求解车辆路径问题的适用性和有效性.     

The Forward Search Algorithm for Detecting Aberrant Response Patterns in Factor Analysis for Binary Data

In this article we implement a forward search algorithm for identifying atypical subjects/observations in factor analysis models for binary data. Forward plots of goodness-of-fit statistics, residuals, and parameter estimates help us identify aberrant observations and detect deviations from the hypothesized model. Methods to initialize, progress, and monitor the search are explored. Simulation envelopes are constructed to investigate whether changes in the statistics being monitored are solely due to random variation. One real and two simulated datasets are used to illustrate the performance of the suggested algorithm. The two simulated datasets explore the effectiveness of the method in the presence of a single outlier and a cluster of outliers. Matlab computer code for implementing the proposed methods is available online.     

一个关于混合变分不等式问题的投影算法

作者提出了混合变分不等式的一个新的投影算法. 混合变分不等式在弹性塑料学领域有实际应用, 而且形式上比经典的变分不等式更一般. 假设映射具有某种伪单调性, 作者证明了所提出的新算法是全局收敛的. 如果某种误差届成立, 算法的收敛率也被分析.     

Euclid and the fundamental theorem of arithmetic

Slight changes or benevolent interpretations of certain theorems and proofs in Euclid's Elements make his demonstration of the fundamental theorem of arithmetic satisfactory for square-free numbers, but Euclid's methods cannot be adapted to prove the uniqueness for numbers containing square factors.     

A remark on Euclid II, 11

Certain historical implications are drawn from the existence of a subproposition contained in Euclid II,11.     

An Algorithm for Solving Mixed Integer Linear Programmes

A simplified form of an algorithm for solving mixed integer linear programmes is presented. It is introduced by considering the geometry of the problem, from which most of the terminology originates. The ideas developed are then translated into algebra. A simple logical flow diagram is presented and its use illustrated by a worked example. An appendix covers the more important refinements.