On unitary analogs of GCD reciprocal LCM matrices

A divisor d ∈ ?₊ of n ∈ ?₊ is said to be a unitary divisor of n if (d, n/d) = 1. In this article we examine the greatest common unitary divisor (GCUD) reciprocal least common unitary multiple (LCUM) matrices. At first we concentrate on the difficulty of the non-existence of the LCUM and we present three different ways to overcome this difficulty. After that we calculate the determinant of the three GCUD reciprocal LCUM matrices with respect to certain types of functions arising from the LCUM problematics. We also analyse these classes of functions, which may be referred to as unitary analogs of the class of semimultiplicative functions, and find their connections to rational arithmetical functions. Our study shows that it does make a difference how to extend the concept of LCUM.     

BOUNDARY LAYER ESTIMATION OF A SINGULAR PROBLEM WITH LIMIT EQUATION OF ORDER 2

ＢＯＵＮＤＡＲＹＬＡＹＥＲＥＳＴＩＭＡＴＩＯＮＯＦＡＳＩＮＧＵＬＡＲＰＲＯＢＬＥＭＷＩＴＨＬＩＭＩＴＥＱＵＡＴＩＯＮＯＦＯＲＤＥＲ２ＨＥＣＨＥＮＧ（何成）ＺＨＡＮＧＷＥＩＴＡＯ（张维弢）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ，Ｃｈｉｎｅ...     

关于Smarandache函数的两个方程

对于著名的伪Smarandache函数Z（n）,Smarandache互反函数Sc（n）,以及伪Smarandache对偶函数Z^＊（n）,利用初等方法,借助同余方程理论,研究了包含函数Z（n）,Sc（n）以及Z^＊（n）的两个方程解的问题,并给出了一些有趣的结果.     

多项式的最大公因式的一种新求法

本文介绍了一种利用数域上矩阵的初等行变换求一组一元ｎ次多项式的最大公因式的方法．     

一个包含Z（n）和D（n）函数的方程及其它的正整数解

对于任意正整数n,著名的伪Smarandache函数Z（n）定义为最小的正整数m使得n｜m（m＋1）／2．而数论函数D（n）定义为最小的正整数m使得n｜d（1）d（2）d（3）…d（m）,其中d（n）为Dirichlet除数函数．本文的主要目的是利用初等方法研究一类包含伪Smarandache函数Z（n）和数论函数D（n）的方程2^z（n）=D（n）的可解性,并获得了该方程的所有正整数解．     

Apportionment methods and the Liu–Layland problem

The Liu–Layland periodic scheduling problem can be solved by the house monotone quota methods of apportionment. This paper shows that staying within the quota is necessary for any apportionment divisor method to solve this problem. As a consequence no divisor method, or equivalently no population monotone method, solves the Liu–Layland problem.     

Smarandache可求积因数对问题

对任意正整数n,设d(n)表示n的Dirichlet除数函数,即就是n的所有不同正因数的个数.Smarandache可求积因数对问题是:求所有正整数对m及n使得d(m)+d(n)=d(mn).主要目的是利用初等方法以及除数函数的性质研究这一问题,并给予彻底解决.具体地说也就是证明了正整数对m及n满足方程d(m)+d(n)=d(mn)当且仅当(m,n)=(pq~α,q)或者(m,n)=(p,p~αq),其中p及q为不同的素数,α为非负整数.     

On the average order of a class of arithmetical functions,II

We consider a large class of arithmetical functions generated by Dirichlet series satisfying a very general functional equation with gamma factors. In our previous paper we obtained a “one-sided” Ω result, but here a “two-sided” Ω result is obtained in most cases. Unfortunately, the method fails in the classical circle and Dirichlet divisor problems.     

一个关于广义完全数的数论函数方程

本文运用初等方法,讨论了一个含有约数函数、约数和函数与Euler函数的数论函数方程,给出了该方程的全部偶数解,并且解决了一个有关广义完全数的问题.     

The loci of abelian varieties with points of high multiplicity on the theta divisor

We study the loci of principally polarized abelian varieties with points of high multiplicity on the theta divisor. Using the heat equation and degeneration techniques, we relate these loci and their closures to each other, as well as to the singular set of the universal theta divisor. We obtain bounds on the dimensions of these loci and relations among their dimensions, and make further conjectures about their structure. Research of the first author is supported in part by National Science Foundation under the grant DMS-05-55867.     

Sur L'equation Diophantienne (xn-1)/(x-1)=yq, III

In this paper we study the diophantine equation of the title,which was first introduced by Nagell and Ljunggren during thefirst half of the twentieth century. We describe a method whichallows us, on the one hand when n is fixed, to obtain an upperbound for q, and on the other hand when n and q are fixed, toobtain upper bounds for x and y which are far sharper than thosederived from the theory of linear forms in logarithms. We alsoshow how these bounds can be used even when they seem too largefor a straightforward enumeration of the remaining possiblevalues of x. By combining all these techniques, we are ableto solve the equation in many cases, including the case whenn has a prime divisor less than 13, or the case when n has aprime divisor which is less than or equal to 23 and distinctfrom q. 2000 Mathematical Subject Classification: primary 11D41;secondary 11J86, 11Y50.     

The Module Df s for Locally Quasi-homogeneous Free Divisors

We find explicit free resolutions for the D-modules Df ^s and D[s] f ^s / D[s] f ^s+1, where f is a reduced equation of a locally quasi-homogeneous free divisor. These results are based on the fact that every locally quasi-homogeneous free divisor is Koszul free, which is also proved in this paper.     

On the possibility of exact reciprocal transformations for one-soliton solutions to equations of the Lobachevsky class

Problems on reciprocal transformation of solutions to equations of Λ²-class (equations related to special coordinate nets on the Lobachevsky plane Λ²) are discussed. A method of construction of solutions to one analytic differential equation of Λ²-class by a given solution of another analytic differential equation of this class is proposed. The reciprocal transformation of one-soliton solutions of the sine-Gordon equation and one-soliton solutions of the modified Korteweg-de Vries equation (MKdV) is obtained. This result confirms the possibility of construction of such transition. __________ Translated from Fundamental’naya i Prikladnaya Matematika (Fundamental and Applied Mathematics), Vol. 11, No. 1, Geometry, 2005.     

Solving Thue equations without the full unit group

The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of finite index is actually sufficient. Two examples linked with the primitive divisor problem for Lucas and Lehmer sequences are given.

     

On the Existence of Quasipattern Solutions of the Swift–Hohenberg Equation

Quasipatterns (two-dimensional patterns that are quasiperiodic in any spatial direction) remain one of the outstanding problems of pattern formation. As with problems involving quasiperiodicity, there is a small divisor problem. In this paper, we consider 8-fold, 10-fold, 12-fold, and higher order quasipattern solutions of the Swift–Hohenberg equation. We prove that a formal solution, given by a divergent series, may be used to build a smooth quasiperiodic function which is an approximate solution of the pattern-forming partial differential equation (PDE) up to an exponentially small error.     

非齐次弹性力学问题双互易边界元方法研究北大核心CSCD

基于弹性力学边界元方法理论,将边界元法与双互易法结合,采用指数型基函数对非齐次项进行插值得到双互易边界积分方程.将边界积分方程离散为代数方程组,利用已知边界条件和方程特解求解方程组,得出域内位移和边界面力.指数型基函数的形状参数是由插值点最近距离的最小值决定,采用这种形状参数变化方案,分析径向基函数(RBF)插值精度以及插值稳定性.再次将指数型基函数应用到双互易边界元法中,分析双互易边界元方法下计算精度及稳定性,验证了指数型插值函数作为双互易边界元方法的径向基函数解决弹性力学域内体力项问题的有效性.     

Small divisor problem for an analytic q-difference equation

Similar to the problem of linearization, the “small divisor problem” also arises in the discussion of invertible analytic solutions of a class of q-difference equations. In this paper we give the existence of such solutions under the Brjuno condition and prove that the equation may not have a nontrivial analytic solution when the Brjuno condition is violated. These results are applied to discussing a nonlinear iterative equation.     

Zero Divisors Among Digraphs

A digraph C is called a zero divisor if there exist non-isomorphic digraphs A and B for which ${A \times C \cong B \times C}$ , where the operation is the direct product. In other words, C being a zero divisor means that cancellation property ${A \times C \cong B \times C \Rightarrow A \cong B}$ fails. Lovász proved that C is a zero divisor if and only if it admits a homomorphism into a disjoint union of directed cycles of prime lengths.Thus any digraph C that is homomorphically equivalent to a directed cycle (or path) is a zero divisor. Given such a zero divisor C and an arbitrary digraph A, we present a method of computing all solutions X to the digraph equation ${A \times C \cong X \times C}$ .     

Blind image deconvolution using a banded matrix method

In this paper we study the blind image deconvolution problem in the presence of noise and measurement errors. We use a stable banded matrix based approach in order to robustly compute the greatest common divisor of two univariate polynomials and we introduce the notion of approximate greatest common divisor to encapsulate the above approach, for blind image restoration. Our method is analyzed concerning its stability and complexity resulting to useful conclusions. It is proved that our approach has better complexity than the other known greatest common divisor based blind image deconvolution techniques. Examples illustrating our procedures are given.     

A New Integrable Equation with Peakon Solutions

We consider a new partial differential equation recently obtained by Degasperis and Procesi using the method of asymptotic integrability; this equation has a form similar to the Camassa–Holm shallow water wave equation. We prove the exact integrability of the new equation by constructing its Lax pair and explain its relation to a negative flow in the Kaup–Kupershmidt hierarchy via a reciprocal transformation. The infinite sequence of conserved quantities is derived together with a proposed bi-Hamiltonian structure. The equation admits exact solutions as a superposition of multipeakons, and we describe the integrable finite-dimensional peakon dynamics and compare it with the analogous results for Camassa–Holm peakons.