Multiplicative relations with conjugate algebraic numbers

We study what algebraic numbers can be represented by a product of algebraic numbers conjugate over a fixed number field K in fixed integer powers. The problem is nontrivial if the sum of these integer powers is equal to zero. The norm of such a number over K must be a root of unity. We show that there are infinitely many algebraic numbers whose norm over K is a root of unity and which cannot be represented by such a product. Conversely, every algebraic number can be expressed by every sufficiently long product in algebraic numbers conjugate over K. We also construct nonsymmetric algebraic numbers, i.e., algebraic numbers such that no elements of the corresponding Galois group acting on the full set of their conjugates form a Latin square. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 59, No. 7, pp. 890–900, July, 2007.     

Algebraic and Differential Nonlinear Superposition Formulas

Knowledge of the Lax pair and the Darboux transformation for a completely integrable system provides an iterative approach for generating exact solutions. This approach involves solving for the eigenfunction of the Lax pair at each step. But this process can be considerably simplified using the Bäcklund transformation and Bianchi's permutability theorem. This allows constructing the so-called nonlinear superposition formula, which provides a new solution of the system in terms of three previous solutions. The advantage of this approach is that the differential order of the nonlinear superposition formulas is lower than that of the Lax pairs, and in some cases, these formulas reduce to algebraic equations. We consider the construction of new nonlinear superposition formulas in the form of both differential equations and algebraic equations.     

On matrix analogs of Fermat’s little theorem

The theorem proved in this paper gives a congruence for the traces of powers of an algebraic integer for the case in which the exponent of the power is a prime power. The theorem implies a congruence in Gauss’ form for the traces of the sums of powers of algebraic integers, generalizing many familiar versions of Fermat’s little theorem. Applied to the traces of integer matrices, this gives a proof of Arnold’s conjecture about the congruence of the traces of powers of such matrices for the case in which the exponent of the power is a prime power.     

微分方程组(dX)/(dt)=AX+e~(αt)P_m(t)具有重特征根α时的特解结构定理及应用

对于常系数非齐线性微分方程组(dX)/(dt)=AX+eαt sum (Bktk) from k=0 to m,当n级方阵A具有s≥1重特征根α时,本文给出了其特解X(t)的结构定理和计算方法,将求特解X(t)的积分运算转化为简单的代数运算,解决了利用计算机求特解X(t)的计算问题.     

Hua’s theorem with <Emphasis Type="Italic">s</Emphasis> almost equal prime variables

It is proved unconditionally that every sufficiently large positive integer satisfying some necessary congruence conditions can be represented as the sum of s almost equal k-th powers of prime numbers for 2 ≤ k ≤ 10 and s =2k ＋ 1, which gives a short interval version of Hun＇s theorem.     

微分方程组（dX）/（dt）=AX＋e^αtPm（t）具有重特征根α时的特解结构定理及应用

对于常系数非齐线性微分方程组（dX）/（dt）=AX＋eαt sum （Bktk） from k=0 to m,当n级方阵A具有s≥1重特征根α时,本文给出了其特解X（t）的结构定理和计算方法,将求特解X（t）的积分运算转化为简单的代数运算,解决了利用计算机求特解X（t）的计算问题.     

向量优化中集合的一些相对代数性质和相对拓扑性质

基于 Flores-Baz′an 等人的思想,提出了假设 B1和假设 B2,证明了集合和的相对代数内部等于相对代数内部的和;集合代数闭包与相对代数内部的和等于和的相对代数内部;集合和的相对拓扑内部等于相对拓扑内部的和;集合拓扑闭包与相对拓扑内部的和等于和的相对拓扑内部,建立了集合代数闭包相等与代数内部相等,拓扑闭包相等与拓扑内部相等之间的一些等价关系。     

二维Fredholm方程的Taylor展开式解法

本文讨论了一类二维Fredholm方程的一种近拟解,通过利用二元函数的Taylor展开式,积分方程转化成一个关于未知函数及其相应的偏导数的线性代数方程组.数值例子表明了该方法的有效性.     

Applying the three-dimensional block-pulse functions to solve system of Volterra–Hammerstein integral equations

In this paper, a numerical scheme is utilized to solve three-dimensional nonlinear system of Volterra-Hammerstein integrals equations, which is based on the three-dimensional block-pulse functions (3D-BPFs) and their operational matrices. Then the primary nonlinear system is transferred into a linear system of algebraic equations by applying the approximate expression and operational matrices, which can be easily solved through any numerical techniques. According to the convergence of 3D-BPFs, the new convergence analysis and error estimation theorem of the research system is detailed investigated. Lastly illustrative examples are included to demonstrate the validity and applicability of the technique.     

A new conservation theorem

A general theorem on conservation laws for arbitrary differential equations is proved. The theorem is valid also for any system of differential equations where the number of equations is equal to the number of dependent variables. The new theorem does not require existence of a Lagrangian and is based on a concept of an adjoint equation for non-linear equations suggested recently by the author. It is proved that the adjoint equation inherits all symmetries of the original equation. Accordingly, one can associate a conservation law with any group of Lie, Lie-Bäcklund or non-local symmetries and find conservation laws for differential equations without classical Lagrangians.     

微分方程组(dX)/(dt)=AX+e~(αt) sum from k=0 to m(B_kt~k)特解结构定理及应用

对于常系数非齐线性微分方程组(dX)/(dt)=AX+F(t),当强迫项F(t)=e~(at) sum from k=0 to m(B_kt~k)(这里Bk=(b1k,b2k,…,bnk)T∈Rn),给出了微分方程组(dt)/(dX)=AX+F(t)特解(t)的结构定理和计算方法,使求特解-X(t)的积分运算转化为简单的代数运算.解决了计算机特解(t)的计算问题.     

分数阶积分微分方程的近似解

本文给出了分数阶积分微分方程的一种新的解法.利用未知函数的泰功多项式展开将分数阶积分微分方程近拟转化为一个涉及未知函数及其n阶导数的线性方程组.数值例子表明该方法的有效性.     

正规升列在参数代数方程组求解中的应用

本文提出一种利用多项式系统的正规零点分解的算法来求解代数方程组以及带有参数的代数方程组的方法．对于给定的的代数方城组,通过正规分解,可以得到一组具有三角形式的分解．根据这种三角形式,我们可以给出代数方程组的所有解．而对于带有参数方程组,将给出方程组有解时参数需满足的条件．进一步,对于给定的参数值,正规分解中得到三角形式仍然保持,通过求解三角形式的方程组从而得出原参数方程组的解．     

Sums of even powers in Archimedean rings

This note is devoted to the study of totally archimedean rings of regular functions. We extend Schmüdgen's theorem to this class of rings. Moreover, we show that, in such rings, every totally positive element is a sum of even powers of totally positive elements, and hence is a sum of even powers of units. Received: 21 October 1999; in final form: 10 November 2000 / Published online: 18 January 2002     

Mixed multiplicities of ideals versus mixed volumes of polytopes

The main results of this paper interpret mixed volumes of lattice polytopes as mixed multiplicities of ideals and mixed multiplicities of ideals as Samuel's multiplicities. In particular, we can give a purely algebraic proof of Bernstein's theorem which asserts that the number of common zeros of a system of Laurent polynomial equations in the torus is bounded above by the mixed volume of their Newton polytopes.

     

Newton-like methods for two-point boundary value problems

A class of Newton-like methods for discrete two-point boundary value problems is constructed from the sum equation formulation of the problem. Each step of the Newton-like method can be described as first solving a system of linear algebraic equations. The solution vector of this system gives boundary values to a number of discrete boundary value problems which can be solved explicitly.     

On the Representations of a Number as the Sum of Four Fifth Powers

It is known from Vaughan and Wooley's work on Waring's problemthat every sufficiently large natural number is the sum of atmost 17 fifth powers [13]. It is also known that at least sixfifth powers are required to be able to express every sufficientlylarge natural number as a sum of fifth powers (see, for instance,[5, Theorem 394]). The techniques of [13] allow one to showthat almost all natural numbers are the sum of nine fifth powers.A problem of related interest is to obtain an upper bound forthe number of representations of a number as a sum of a fixednumber of powers. Let R(n) denote the number of representationsof the natural number n as a sum of four fifth powers. In thispaper, we establish a non-trivial upper bound for R(n), whichis expressed in the following theorem.     

Degenerate difference-differential equations: Algebraic theory

In this paper we consider the algebraic aspects of the theory of degenerate difference-differential equations. It will be shown that the fundamental algebraic concepts to be used are module theoretic. We have to consider similarity of polynomial matrices in one or more indeterminates. In the case of systems with commensurable lags the underlying modules have a simple structure, because the corresponding ring of scalars is the principal ideal domain of polynomials in one indeterminate. This fact makes it possible to prove a structure theorem for degenerate difference-differential equations with commensurable lags. This theorem shows that degenerate systems of this type essentially are trivial in the sense of Henry [15], i.e., the characteristic quasipolynomial is a polynomial. Further it is shown that coordinate transforms with “time lag” play an essential role for the construction of degenerate equations. The power of the method is demonstrated by some examples, some of which are equations with incommensurable lags.     

The Formula of General Term of the Sum of Equal Powers of Natural Numbers

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＴｏｆｉｎｄｔｈｅｇｅｎｅｒａｌｔｅｒｍｆｏｒｍｕｌａｏｆｃａｌｃｕｌａｔｉｎｇｗａｓａｎｏｌｄｅｓｔｐｒｏｂｌｅｍｉｎＮｕｍｂｅｒＴｈｅｏｒｙ．Ｅａｒｌｙｉｎ３００Ｂ．Ｃ．,Ａｒｃｈｉｍｅｄｏ,ｔｈｅｍａｔｈｅｍａｔｉｃｉａｎｏｆａｎｃｉｅｎｔＧｒｅｅｃｅ,ｗｏｒｋｅｄｏｕｔｔｈｅｆｏｒｍｕｌａ∑ｎｋ＝１ｋ＝ｎ（ｎ＋１）２ａｎｄ∑ｎｋ＝１ｋ２＝ｎ（ｎ＋１）（２ｎ＋１）６．Ｓｏｆａｒ,ｐｅｏｐｌｅｈａｖｅｇｏｔｍａｎｙｆｏｒｍｓｏｆｅｐｒｅｓｓｉｏｎｏｆｔｈｅｇｅ…