一些包含Chebyshev多项式和Stirling数的恒等式

利用初等方法研究Chebyshev多项式的性质,建立了广义第二类Chebyshev多项式的一个显明公式,并得到了一些包含第一类Chebyshev多项式,第一类Stirling数和Lucas数的恒等式.     

Classification of Graeco‐Latin Cubes

A q‐ary code of length n, size M, and minimum distance d is called an code. An code with is said to be maximum distance separable (MDS). Here one‐error‐correcting () MDS codes are classified for small alphabets. In particular, it is shown that there are unique (5, 5³, 3)₅ and (5, 7³, 3)₇ codes and equivalence classes of (5, 8³, 3)₈ codes. The codes are equivalent to certain pairs of mutually orthogonal Latin cubes of order q, called Graeco‐Latin cubes.     

直流高压加速管轴向绝缘的优化设计

 为了降低500 mA直流高压加速管高梯度区的电位梯度，对加速管轴向绝缘结构进行优化设计。首先分析了沿面闪络的机理和该加速管轴向绝缘体结构。根据SEEA理论并通过数值模拟，发现阴极、真空和绝缘体三结合点处电场畸变是产生高场强的原因，并分别对4种绝缘体结构进行模拟分析，最终确定出比较理想的结构：绝缘体沿面与阴极电极夹角为+45°，绝缘体两端开槽并均匀嵌入金属电极环，绝缘体均匀嵌入阳极电极片内。     

On topological properties of the Hartman-Mycielski functor

We investigate some topological properties of a normal functorH introduced earlier by Radul which is some functorial compactification of the Hartman-Mycielski construction HM. We prove that the pair (H X, HMY) is homeomorphic to the pair (Q, σ) for each nondegenerated metrizable compactumX and each denseσ-compact subsetY.     

A redundant Klee–Minty construction with all the redundant constraints touching the feasible region

We have previously shown, by redundant Klee–Minty constructions, that the central path may arbitrarily closely visit every vertex of the Klee–Minty cube. In those constructions, the redundant constraints are far away from the feasible region. In this paper, we provide a construction in which all redundant constraints touch the feasible region.     

Elliptic Solutions of Dynamical Lucas Sequences

We study two types of dynamical extensions of Lucas sequences and give elliptic solutions for them. The first type concerns a level-dependent (or discrete time-dependent) version involving commuting variables. We show that a nice solution for this system is given by elliptic numbers. The second type involves a non-commutative version of Lucas sequences which defines the non-commutative (or abstract) Fibonacci polynomials introduced by Johann Cigler. If the non-commuting variables are specialized to be elliptic-commuting variables the abstract Fibonacci polynomials become non-commutative elliptic Fibonacci polynomials. Some properties we derive for these include their explicit expansion in terms of normalized monomials and a non-commutative elliptic Euler–Cassini identity.     

广义Pell方程Ax^2-By^2=4的通解公式

主要运用 Lucas 数的奇偶性,讨论了当 A, B 是适合 A〉1,2-AB 且 AB 非平方数的正整数时,广义 Pell 方程的整数解（x, y）,即给出了方程 Ax^2 -By^2=4适合gcd（x, y）=1的整数解（x, y）的通解公式。     

Dynamic discovery of query path on the lattice of cuboids using hierarchical data granularity and storage hierarchy

Analytical processing on multi-dimensional data is performed over data warehouse. This, in general, is presented in the form of cuboids. The central theme of the data warehouse is represented in the form of fact table. A fact table is built from the related dimension tables. The cuboid that corresponds to the fact table is called base cuboid. All possible combination of the cuboids could be generated from base cuboid using successive roll-up operations and this corresponds to a lattice structure. Some of the dimensions may have a concept hierarchy in terms of multiple granularities of data. This means a dimension is represented in more than one abstract form. Typically, neither all the cuboids nor all the concept hierarchy are required for a specific business processing. These cuboids are resided in different layers of memory hierarchy like cache memory, primary memory, secondary memory, etc. This research work dynamically finds the most cost effective path from the lattice structure of cuboids based on concept hierarchy to minimize the query access time. The knowledge of location of cuboids at different memory elements is used for the purpose.     

角锥棱镜的直角面面形问题

从一个侧面论述了角锥棱镜直角面面形误差所导致的出射波面像差及两面直角误差之间的定量关系 ,因而可以分别从后两者的精度要求提出对面形误差的要求。对于高精度的角锥棱镜 ,直角面面形问题应如同两面直角误差一样受到重视和关注     

三项式xn-x-a的二次不可约因式

设n是正整数,f(x)=xn-x-a,其中a是非零整数. 证明了当n>5时,如果f(x)有首项系数为1的二次整系数不可约因式g(x),则必有n≡2(mod6),a=-1,g(x)=x2-x+1或者n=7,a=±280,g(x)=x2t(±)x+5.