关于k次加法补函数的因子函数的均值公式

对于任意正整数n,如果m n是完全k次方数,称最小非负整数m是n的k次加法补.为了研究m的性质及变化规律,这里运用初等数论和分析数论的方法,得到了d(n ak(n))的一个有趣的均值公式,从而得到了更一般的加法补函数的计算公式,完善了加法补函数在数论中的研究和应用.     

Smarandache LCM函数与数论函数(S)(n)的混合均值计算

利用初等和解析方法研究了F.Smarandache LCM函数与数论函数(S)(n)的混合均值分布问题,获得了一些较强的渐近公式,发展丰富了数论领域里相关研究工作.     

Smarandache LCM函数与数论函数(n)的混合均值计算

利用初等和解析方法研究了F.Smarandache LCM函数与数论函数(n)的混合均值分布问题,获得了一些较强的渐近公式,发展丰富了数论领域里相关研究工作.     

Erds除数问题

<正> 值的分布问题,从五十年代到七十年代期间,曾有不少数论工作者用初等方法及筛法作出了若干研究成果,其中最出色的工作是王元教授在五十年代末的新筛法工作[8].王元在[8]中,对于一些著名数论函数如Euler.函数φ(n),除数和函数σ(n),以及除数函数     

关于方程φ(abc)=2(φ(a)+φ(b)+φ(c))

设n为任意正整数,φ(n)是Euler函数.主要研究了方程φ(abc)=2(φ(a)+φ(b)+φ(c))的可解性问题,利用数论中的理论和方法,获得了该方程的所有正整数解.     

一些新的数论函数及其均值公式

对于给定的自然数m,我们利用最大公约数和最小公倍数定义数论函数(m,n)和[m,n]/m.本文主要目的是研究这两个新的函数的渐近性质,利用解析方法得到这两个函数的几个渐近公式.     

复合欧拉函数方程φ(φ(n-φ(φ(n))))=4,6的正整数解

研究了复合欧拉函数方程φ(φ(n-φ(φ(n))))=4,6的可解性问题,其中φ(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）的可解性,并获得了该方程的所有正整数解．     

一个新的数论函数及其均值性质

对于给定的自然数q,我们利用最小公倍数定义一个新的数论函数g(n)=[q,n]/q.本文的主要目的是研究δm(g(n))的均值性质,并利用解析方法得到这个函数的几个渐近公式.     

关于r是数补数序列的复合函数的均值研究

对任意的正整数m和一个确定的正整数r(r≥3),a(n)、b(n)为r是数上下补数序列,利用初等方法和解析方法,给出了a(n)、b(n)与三个数论函数(n)、V(n)和e_p(n)的复合函数(a(n))、(b(n)),V(a(n))、V(b(n))及e_p(a(n))、e_p(b(n))的均值,获得了准确的渐近公式,发展了相关问题的研究工作.     

On algebraic points in the plane near smooth curves∗

In the paper, we solve the problem on the number of points with algebraic real coordinates near smooth curve. This question is a natural extension of the problems of number theory connected with integer points in the domains and the rational numbers near curves. The main idea of the proof is based on the metric theory on Diophantine approximations.     

Extreme functions with an arbitrary number of slopes

For the one dimensional infinite group relaxation, we construct a sequence of extreme valid functions that are piecewise linear and such that for every natural number \(k\ge 2\), there is a function in the sequence with k slopes. This settles an open question in this area regarding a universal bound on the number of slopes for extreme functions. The function which is the pointwise limit of this sequence is an extreme valid function that is continuous and has an infinite number of slopes. This provides a new and more refined counterexample to an old conjecture of Gomory and Johnson stating that all extreme functions are piecewise linear. These constructions are extended to obtain functions for the higher dimensional group problems via the sequential-merge operation of Dey and Richard.     

Conglomerable natural extension

At the foundations of probability theory lies a question that has been open since de Finetti framed it in 1930: whether or not an uncertainty model should be required to be conglomerable. Conglomerability is related to accepting infinitely many conditional bets. Walley is one of the authors who have argued in favor of conglomerability, while de Finetti rejected the idea. In this paper we study the extension of the conglomerability condition to two types of uncertainty models that are more general than the ones envisaged by de Finetti: sets of desirable gambles and coherent lower previsions. We focus in particular on the weakest (i.e., the least-committal) of those extensions, which we call the conglomerable natural extension. The weakest extension that does not take conglomerability into account is simply called the natural extension. We show that taking the natural extension of assessments after imposing conglomerability—the procedure adopted in Walley’s theory—does not yield, in general, the conglomerable natural extension (but it does so in the case of the marginal extension). Iterating this process of imposing conglomerability and taking the natural extension produces a sequence of models that approach the conglomerable natural extension, although it is not known, at this point, whether this sequence converges to it. We give sufficient conditions for this to happen in some special cases, and study the differences between working with coherent sets of desirable gambles and coherent lower previsions. Our results indicate that it is necessary to rethink the foundations of Walley’s theory of coherent lower previsions for infinite partitions of conditioning events.     

基于效用函数的模糊数的比较与排序

对相同的模糊数进行比较,不同风险偏好的决策者,会得到不同的结论.效用函数是对风险偏好的度量,因此,模糊数的比较与排序的方法,一定要结合决策者的效用函数来构造.为此,根据效用函数定义了模糊效用函数,在此基础上定义了效用序.之后,证明效用序为全序,进一步利用结构元理论对效用序进行表述.根据效用函数反映风险偏好的程度,对效用序进行分类.这样,决策者对模糊数进行比较时,依据自身对风险偏好程度来选择效用序.     

Conditional computability of real functions with respect to a class of operators

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect to this class. These two computability notions are natural generalizations of certain notions introduced in a previous paper co-authored by Andreas Weiermann and in another previous paper by the same authors, respectively. Under certain weak assumptions about the class in question, we show that conditional computability is preserved by substitution, that all conditionally computable real functions are locally uniformly computable, and that the ones with compact domains are uniformly computable. The introduced notions have some similarity with the uniform computability and its non-uniform extension considered by Katrin Tent and Martin Ziegler, however, there are also essential differences between the conditional computability and the non-uniform computability in question.     

On realizability of sign patterns by real polynomials

The classical Descartes’ rule of signs limits the number of positive roots of a real polynomial in one variable by the number of sign changes in the sequence of its coefficients. One can ask the question which pairs of nonnegative integers (p, n), chosen in accordance with this rule and with some other natural conditions, can be the pairs of numbers of positive and negative roots of a real polynomial with prescribed signs of the coefficients. The paper solves this problem for degree 8 polynomials.     

The monoid of ordered partitions of a natural number

The sequences of non-negative integers form a monoid, a natural submonoid of which has elements corresponding to order-preserving transformations of a finite chain. This, in turn, has a submonoid whose elements are ordered partitions of a natural number. A presentation for the last monoid is given, and the inclusion poset of principal right ideals is described. The poset of principal left ideals has a recursive structure that gives rise to an interesting sequence of numbers.     

The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.     

Transcendence of Thue–Morse p-Adic Continued Fractions

It has been proved that real numbers defined as a limit of continued fractions with a Thue–Morse sequence as the sequence of positive integer partial quotients are transcendental. The same holds for more general sequences of partial quotients. Moreover, transcendence results have been proved for p-adic numbers defined by Hensel development. Here, we tackle the transcendence question in case of p-adic numbers defined as a limit of continued fractions by proving a similar result as the first one.     

Fibonacci, Van der Corput and Riesz-Nágy

What do the three names in the title have in common? The purpose of this paper is to relate them in a new and, hopefully, interesting way. Starting with the Fibonacci numeration system — also known as Zeckendorff's system — we will pose ourselves the problem of extending it in a natural way to represent all real numbers in (0,1). We will see that this natural extension leads to what is known as the ?-system restricted to the unit interval. The resulting complete system of numeration replicates the uniqueness of the binary system which, in our opinion, is responsible for the possibility of defining the Van der Corput sequence in (0,1), a very special sequence which besides being uniformly distributed has one of the lowest discrepancy, a measure of the goodness of the uniformity.Lastly, combining the Fibonacci system and the binary in a very special way we will obtain a singular function, more specifically, the inverse of one of the family of Riesz-Nágy.