A-Sets and their application Anant Saxena December 1, 2014 1. Introduction We will first begin with the definition of A-sets ‘Then we will move onto the combinatorial formula for A-sets After which, we will move onto their application and connection with the dirchelet series 2 A-sets 2.1 What is an A-sets Note: A-sets are NOT sets! It is a different mathematical object! An A-set is simply a structure containing a sequence of numbers. The number on the right-hand comer of the A-set clement is the number of times it appears in the A-set. For example, the simplest. A-set is shown below is S(1) (1) = 1,2, 3.) In this example, the first element is 1 where (1) is the number of times it appears in the A-set. Another example is: (2) = (2, 4,6, 8,_.)S(3) = (3,6, 9, 12, ‘The general $(2) is: S(x) = [e220 32, ...] 2.2. Multiplication n.$(2r) is deitned as: nS (a) = 2, 20, 32) where n is a integer greater and ".” is the multiplication operator. For example 2.5(2) is 2.5(2) = (2,4, 62) 2.3 Addition In A-sets only elements which are the same interact. For example: S(1) + S(1) = 2.9(1) = [1,22 3, 1] Or consider the other example: S(1) + $(2) = 1, 22), 3, 42), 2.4 Substraction Similar to addition. St) - 80) =0 = 1, 2,3 .] Or 5(1) — 5) = [1,2 3,40, 50,..) = [10,3050]3 Combinatorial formula for A-sets 3.1 Motivation Can the sum of any A-set and multiplication by a number yield any arbitrary sequence of numbers? For instance, is it possible to get: S(i) = 7,9-, 11, .] ‘The answer is suprisingly, YES! In the following section we will not only manage to show it is possible but also manage to obtain the a, 3.2. Combinatorial formula ‘The combinatorial formula is as follows: Sa) + F(a?) + F(e8) + = gla) Where /(0) = (0) = 0 and g(x) is the weighting function. Taylor expanding both f(x) and g(x) with f(x) =O®, aie! and g(x) = T%, bia’. Then we get: tat a8 +.) + oat aletar tat tat ta +...) +ar(a We notice a striking similarity between the A-set and the combinatorial formula: y,S(1) + 42.5(2) +... = (100, 2), i, ‘Thns, g(x) can be thought of as Further we also know the reletion between arbitary sequ J (x) and a; is given by (0) = aq xn! For example, let 6; = 1 if i= an odd number else it is 0. To compute, the a; we will use the following trick.