On an additive property of sequences of nonnegative integers

Periodica Mathematica Hungarica - Let a1&;lt;... be an infinite sequence of positive integers, let k≥2 be a fixed integer and denote by Rk(n) the number of solutions of n=ai1+ai2+...+aik....     

On a regularity property of additive representation functions

Summary Let <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"6"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"7"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"8"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"9"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"10"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"11"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"12"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"13"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"14"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"15"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>\mathcal{A}=\{a_{1},a_{2},\dots{}\}$ $(a_{1} \le a_{2} \le \dots{})$ be an infinite sequence of nonnegative integers, and let $R(n)$ denote the number of solutions of $a_{x}+a_{y}=n$ $(a_{x},a_{y}\in\mathcal{A})$. P. Erd?s, A. Sárk?zyand V. T. Sós proved that if $\lim_{N\to\infty}\frac{B(\mathcal{A},N)}{\sqrt{N}}=+\infty$ then $|\Delta_{1}(R(n))|$ cannot be bounded, where ${B(\mathcal{A},N)}$ denotes the number of blocks formed by consecutive integers in $\mathcal{A}$ up to $N$ and $\Delta_{k}$ denotes the $k$-th difference. The aim of this paper is to extend this result to $\Delta_{k}(R(n))$ for any fixed $k\ge2$.     

On an additive representation function

Let A be an infinite subset of natural numbers, and X a positive real number. Let r(n) denotes the number of solution of the equation n=a₁+a₂ where a₁?a₂ and a₁, a₂∈A. Also let |A(X)| denotes the number of natural numbers which are less than or equal to X and belong to A. For those A which satisfy the condition that for all sufficiently large natural numbers n we have r(n)≠1, we improve the lower bound of |A(X)| given by Nicolas et. al. [NRS98]. The bound which we obtain is essentially best possible.     

On the monotonicity properties of additive representation functions, II

For a set A of positive integers and any positive integer n, let R₁(A,n), R₂(A,n) and R₃(A,n) denote the number of solutions of a+a^′=n with the additional restriction a,a^′∈A; a,a^′∈A,a<a^′ and a,a^′∈A,a≤a^′ respectively. In this paper, we specially focus on the monotonicity of R₃(A,n). Moreover, we show that there does not exist any set A⊂N such that R₂(A,n) or R₃(A,n) is eventually strictly increasing.     

A general principle for limit theorems in finitely additive probability: The dependent case

In this paper we formulate and prove a general principle which enables us to deduce limit theorems for a sequence of random variables on a finitely additive probability space.     

Catalan-like number sequences and Hausdorff moment sequences

Many well-known Catalan-like sequences turn out to be Stieltjes moment sequences (Liang et al. (2016)). However, a Stieltjes moment sequence is in general not determinate; Liang et al. suggested a further analysis about whether these moment sequences are determinate and how to obtain the associated measures. In this paper we find necessary conditions for a Catalan-like sequence to be a Hausdorff moment sequence. As a consequence, we will see that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy numbers, are Hausdorff moment sequences. We can also identify the smallest interval including the support of the unique representing measure. Since Hausdorff moment sequences are determinate and a representing measure for above mentioned sequences are already known, we could almost complete the analysis raised by Liang et al. In addition, subsequences of Catalan-like number sequences are also considered; we will see a necessary and sufficient condition for subsequences of Stieltjes Catalan-like number sequences to be Stieltjes Catalan-like number sequences. We will also study a representing measure for a linear combination of consecutive terms in Catalan-like number sequences.     

On the counting function of the lattice profile of periodic sequences

The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period.     

The generating function of a family of the sequences in terms of the continuant

Let a₀, a₁, … , a_r−1 be positive numbers and define a sequence {q_m}, with initial conditions q₀ = 0 and q₁ = 1, and for all m ? 2, q_m = a_tq_m−1 + q_m−2 where m ≡ t(mod r). For r = 2, the author called the sequence {q_m} as the generalized Fibonacci sequences and studied it in [1]. But, it remains open to find a closed form of the generating function for general {q_m}. In this paper, we solve this open problem, that is, we find a closed form of the generating function for {q_m}in terms of the continuant.     

On additive representation of integers

Acta Mathematica Hungarica -     

On F-almost split sequences

Let A be an Artinian algebra and F an additive subbifunctor of Ext,（-, -） having enough projectives and injectives. We prove that the dualizing subvarieties of mod A closed under F-extensions have F-almost split sequences. Let T be an F-cotilting module in mod A and S a cotilting module over F = End（T）. Then Horn（-, T） induces a duality between F-almost split sequences in ⊥FT and almost sl31it sequences in ⊥S, where addrS = Hom∧（f（F）, T）. Let A be an F-Gorenstein algebra, T a strong F-cotilting module and 0→A→B→C→0 and F-almost split sequence in ⊥FT.If the injective dimension of S as a Г-module is equal to d, then C≌（ΩCM^-dΩ^dDTrA^＊）^＊,where（-）^＊=Hom（g,T）.In addition, if the F-injective dimension of A is equal to d, then A≌ΩMF^-dDΩFop^-d TrC≌ΩCMF^-d ≌F^d DTrC.     

A trace representation of binary Jacobi sequences

We determine the trace function representation, or equivalently, the Fourier spectral sequences of binary Jacobi sequences of period pq, where p and q are two distinct odd primes. This includes the twin-prime sequences of period p(p+2) whenever both p and p+2 are primes, corresponding to cyclic Hadamard difference sets.     

On Appell sequences of polynomials of Bernoulli and Euler type

A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number theoretical properties. A class of Euler-type polynomials is also presented.     

On certain unimodal sequences and strict partitions

Building on a bijection of Vandervelde, we enumerate certain unimodal sequences whose alternating sum equals zero. This enables us to refine the enumeration of strict partitions with respect to the number of parts and the BG-rank.     

Primitive connected and additive theories of polygons

We study into monoids S the class of all S-polygons over which is primitive normal, primitive connected, or additive, that is, the monoids S the theory of any S-polygon over which is primitive normal, primitive connected, or additive. It is proved that the class of all S-polygons is primitive normal iff S is a linearly ordered monoid, and that it is primitive connected iff S is a group. It is pointed out that there exists no monoid S with an additive class of all S-polygons. __________ Translated from Algebra i Logika, Vol. 45, No. 3, pp. 300–313, May–June, 2006.     

A new combinatorial representation of the additive coalescent

The standard additive coalescent starting with n particles is a Markov process which owns several combinatorial representations, one by Pitman as a process of coalescent forests, and one by Chassaing and Louchard as the block sizes in a parking scheme. In the coalescent forest representation, edges are added successively between a random node and a random root. In this paper, we investigate an alternative construction by, instead, adding edges between roots. This construction induces exactly the same process in terms of cluster sizes, meanwhile, it allows us to make numerous new connections with other combinatorial and probabilistic models: size biased percolation, parking scheme in a tree, increasing trees, random cuts of trees. The variety of the combinatorial objects involved justifies our interest in this construction.     

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

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

A theorem on the -adic representation of positive integers

In this paper, a theorem on the asymptotic property of a summation of digits in a -adic representation is presented.

     

The representation of integers by binary additive forms

Let a, b and n be integers with 3. We show that, in the sense of natural density, almost all integers represented by the binary form axⁿ – byⁿ are thus represented essentially uniquely. By exploiting this conclusion, we derive an asymptotic formula for the total number of integers represented by such a form. These conclusions augment earlier work of Hooley concerning binary cubic and quartic forms, and generalise or sharpen work of Hooley, Greaves, and Skinner and Wooley concerning sums and differences of two nth powers.