Counting MSTD sets in finite abelian groups

In an abelian group G, a more sums than differences (MSTD) set is a subset A⊂G such that |A+A|>|A−A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof contains an application of a recently resolved conjecture of Alon and Kahn on the number of independent sets in a regular graph.     

Explicit constructions of infinite families of MSTD sets

Text

We explicitly construct infinite families of MSTD (more sums than differences) sets, i.e., sets where |A+A|>|A−A|. There are enough of these sets to prove that there exists a constant C such that at least C/r⁴ of the r² subsets of {1,…,r} are MSTD sets; thus our family is significantly denser than previous constructions (whose densities are at most f(r)/²r/2 for some polynomial f(r)). We conclude by generalizing our method to compare linear forms ?₁A+?+?nA with ?i∈{−1,1}.

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=vIDDa1R2.     

Partition identities II. The results of Bateman and Erd?s

This paper shows that the natural setting for the Bateman and Erd?s study of monotonicity of the kth difference of partition functions a(n) is the class of partition identities

     

On the largest size of a partition that is both s-core and t-core

Text

Let s,t be relatively prime positive integers. We prove a conjecture of Aukerman, Kane and Sze regarding the largest size of a partition that is simultaneously s-core and t-core by solving an equivalent problem concerning sets S of positive integers with the property that for n∈S, n−s∈S whenever n?s and n−t∈S whenever n?t.

Video

For a video summary of this paper, please visit http://www.youtube.com/watch?v=o1OEug8LryU.     

Logarithmic behavior of some combinatorial sequences

Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic behavior of some combinatorially relevant sequences, such as Motzkin and Schröder numbers, sequences of values of some classic orthogonal polynomials and many others. The calculus method extends also to numbers indexed by two or more parameters.     

q-Pell sequences and two identities of V.A. Lebesgue

We examine a pair of Rogers-Ramanujan type identities of Lebesgue, and give polynomial identities for which the original identities are limiting cases. The polynomial identities turn out to be q-analogs of the Pell sequence. Finally, we provide combinatorial interpretations for the identities.     

On the maximal cardinality of half-factorial sets in cyclic groups

We consider the function μ(G), introduced by W. Narkiewicz, which associates to an abelian group G the maximal cardinality of a half-factorial subset of it. In this article, we start a systematic study of this function in the case where G is a finite cyclic group and prove several results on its behaviour. In particular, we show that the order of magnitude of this function on cyclic groups is the same as the one of the number of divisors of its cardinality. This work was supported by the Austrian Science Fund FWF (Project P16770-N12) and by the Austrian-French Program ``Amadeus 2003–2004'.     

Asymptotic normality of additive functions on polynomial sequences in canonical number systems

The objective of this paper is the study of functions which only act on the digits of an expansion. In particular, we are interested in the asymptotic distribution of the values of these functions. The presented result is an extension and generalization of a result of Bassily and Kátai to number systems defined in a quotient ring of the ring of polynomials over the integers.     

Some identities involving the binomial sequences

Using the exponential generating function and the Bell polynomials, we obtain several new identities for the binomial sequences. As applications, some interesting identities are established for the Abel polynomials, exponential polynomials and factorial powers.     

Linear recurring sequences over modules

The aim of this paper is to extend some fundamental and applied results of the theory of linear recurring sequences over fields to the case of polylinear recurring sequences over rings and modules. Quasi-Frobenius modules and Galois rings play a very special role in this project.     

Picard sequences with every orbit containing infinitely many perfect n-powers

Text

Finding a function which generates a sequence via iteration whose values at one or many points in its domain satisfy certain prescribed properties, i.e., finding a function such that the Picard orbit(s) of one or many points in its domain which possess some given properties, is an interesting problem. Given any positive integer n greater than one, we construct in this paper families of functions on the natural numbers such that the sequence of the iterations of each of these functions at any positive integer s contains infinitely many perfect n-powers. In terms of Picard sequences, this amounts to constructing a function whose Picard orbit at every point in its domain contains infinitely many perfect n-powers.

Video

For a video summary of this paper, please visit http://www.youtube.com/watch?v=wJqaXyB2pdo.     

On sets of integers with prescribed gaps

For a fixed setI of positive integers we consider the set of paths (p _o,...,p _k ) of arbitrary length satisfyingp _l –p _l–1I forl=2,...,k andp ₀=1,p _k =n. Equipping it with the uniform distribution, the random path lengthT _n is studied. Asymptotic expansions of the moments ofT _n are derived and its asymptotic normality is proved. The step lengthsp _l –p _l–1 are seen to follow asymptotically a restricted geometrical distribution. Analogous results are given for the free boundary case in which the values ofp ₀ andp _k are not specified. In the special caseI={m+1,m+2,...} (for some fixed m) we derive the exact distribution of a random m-gap subset of {1,...,n} and exhibit some connections to the theory of representations of natural numbers. A simple mechanism for generating a randomm-gap subset is also presented.     

Odd multiperfect numbers of abundancy 4

Euler's structure theorem for any odd perfect number is extended to odd multiperfect numbers of abundancy power of 2. In addition, conditions are found for classes of odd numbers not to be 4-perfect: some types of cube, some numbers divisible by 9 as the maximum power of 3, and numbers where 2 is the maximum even prime power.     

Primitive divisors of elliptic divisibility sequences

Silverman proved the analogue of Zsigmondy's Theorem for elliptic divisibility sequences. For elliptic curves in global minimal form, it seems likely this result is true in a uniform manner. We present such a result for certain infinite families of curves and points. Our methods allow the first explicit examples of the elliptic Zsigmondy Theorem to be exhibited. As an application, we show that every term beyond the fourth of the Somos-4 sequence has a primitive divisor.     

Sum of sets in several dimensions

LetA, B be finite sets in ^d with|A|=m|B|=n, and assume that there is no hyperplane containing both a translation ofA and a translation ofB. Under this condition it is proved that the number of distinct vectors in the form {a+baA, bB} is at leastn+dm–d(d+1)/2. This generalizes results of Freiman (caseA=B) and Freiman, Heppes, Uhrin (caseA=–B). A more complicated estimate is also given which yields the exact bound for alln>2d.Supported by Hungarian National Foundation for Scientific Research, Grant No. 1901.     

Nontrivial lower bounds for the least common multiple of some finite sequences of integers

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and lower bounds less efficient (but nontrivial) for quadratic sequences whose general term has the form un=an(n+t)+b with (a,t,b)∈Z³, a?5, t?0, gcd(a,b)=1. From this, we deduce for instance the lower bound: lcm{¹²+1,²²+1,…,n²+1}?0,32n(1,442) (for all n?1). In the last part of this article, we study the integer lcm(n,n+1,…,n+k) (k∈N, n∈N^∗). We show that it has a divisor dn,k simple in its dependence on n and k, and a multiple mn,k also simple in its dependence on n. In addition, we prove that both equalities: lcm(n,n+1,…,n+k)=dn,k and lcm(n,n+1,…,n+k)=mn,k hold for an infinitely many pairs (n,k).     

Paradoxical decompositions of planar sets of positive outer measure

We give examples of paradoxical subsets of the plane which do not have Lebesgue measure zero.     

Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)

The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically   discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for _pm(n)$p_m(n)$ for any desired m. We do this to demonstrate the power of “rigorous guessing” as facilitated by the quasi-polynomial ansatz.     

Mixed sums of squares and triangular numbers (III)

In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and only if Tm=m(m+1)/2 cannot be expressed as a sum of two odd squares and a triangular number, i.e., p²=x²+8(y²+z²) for no odd integers x,y,z. We also show that a positive integer cannot be written as a sum of an odd square and two triangular numbers if and only if it is of the form 2Tm(m>0) with 2m+1 having no prime divisor congruent to 3 modulo 4.