Combinatorial Integers

In this paper "Some new identities in combinatoric", the binomial numbers m n are very important in several applications and satisfy several number of identities. The purpose of this paper is to introduce a new combinatorial integer m,n j and obtain some algebraic identities by means of double combinatorial argument.

14p runordie3 27-06-2022 15 3   Download

We prove analogues for hypergraphs of Szemer´di’s regularity lemma and e the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer´di theorem of Furstenberg e and Katznelson, and the first proof that provides an explicit bound. Similar results with the same consequences have been obtained independently by Nagle, R¨dl, Schacht and Skokan. o 1.

51p noel_noel 17-01-2013 70 8   Download

Let b ≥ 2 be an integer. We prove that the b-ary expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms. In particular, irrational automatic numbers are transcendental. Our main tool is a new, combinatorial transcendence criterion. 1. Introduction Let b ≥ 2 be an integer. The b-ary expansion of every rational number is eventually periodic, but what can be said about the b-ary expansion of an irrational algebraic number? ...

20p noel_noel 17-01-2013 50 7   Download