Do you want to publish a course? Click here

Patterns of primes and composites on divisibility graph

89   0   0.0 ( 0 )
 Added by G Ambika
 Publication date 2020
  fields Physics
and research's language is English




Ask ChatGPT about the research

We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and centrality in terms of the floor functions and the divisor functions. We discuss how these measures depend on the vertex labels and the size of graph N. We also present the specific case of prime vertices separately as corollaries. We could explain the patterns in the local measures for a finite size graph as well as the trends in global measures as the size of the graph increases.



rate research

Read More

340 - Abiya Rajans , G. Ambika 2020
We present the pattern underlying some of the properties of natural numbers, using the framework of complex networks. The network used is a divisibility network in which each node has a fixed identity as one of the natural numbers and the connections among the nodes are made based on the divisibility pattern among the numbers. We derive analytical expressions for the centrality measures of this network in terms of the floor function and the divisor functions. We validate these measures with the help of standard methods which make use of the adjacency matrix of the network. Thus how the measures of the network relate to patterns in the behaviour of primes and composite numbers becomes apparent from our study.
81 - Ji-Cai Liu 2021
We establish a congruence on sums of central $q$-binomial coefficients. From this $q$-congruence, we derive the divisibility of the $q$-trinomial coefficients introduced by Andrews and Baxter.
The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations are unimodal via a five-term recurrence relation. We also found a quadratic recursion for the alternating major index $q$-analog of the alternating descent polynomials. As an interesting application of this quadratic recursion, we show that $(1+q)^{lfloor n/2rfloor}$ divides $sum_{piinmathfrak{S}_n}q^{rm{altmaj}(pi)}$, where $mathfrak{S}_n$ is the set of all permutations of ${1,2,ldots,n}$ and $rm{altmaj}(pi)$ is the alternating major index of $pi$. This leads us to discover a $q$-analog of $n!=2^{ell}m$, $m$ odd, using the statistic of alternating major index. Moreover, we study the $gamma$-vectors of the alternating descent polynomials by using these two recursions and the ${textbf{cd}}$-index. Further intriguing conjectures are formulated, which indicate that the alternating descent statistic deserves more work.
302 - J. Bouttier , E. Guitter 2013
We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the natural approach via substitution where these maps are obtained from general maps by a replacement of all d-cycles by elementary faces, and a bijective approach via slice decomposition which consists in cutting the maps along shortest paths. Both lead to explicit expressions for the generating functions of d-irreducible maps with controlled face degrees, summarized in some elegant pointing formula. We provide an equivalent description of d-irreducible slices in terms of so-called d-oriented trees. We finally show that irreducible maps give rise to a hierarchy of discrete integrable equations which include equations encountered previously in the context of naturally embedded trees.
305 - Omid Amini 2016
Correlation functions in quantum field theory are calculated using Feynman amplitudes, which are finite dimensional integrals associated to graphs. The integrand is the exponential of the ratio of the first and second Symanzik polynomials associated to the Feynman graph, which are described in terms of the spanning trees and spanning 2-forests of the graph, respectively. In a previous paper with Bloch, Burgos and Fresan, we related this ratio to the asymptotic of the Archimedean height pairing between degree zero divisors on degenerating families of Riemann surfaces. Motivated by this, we consider in this paper the variation of the ratio of the two Symanzik polynomials under bounded perturbations of the geometry of the graph. This is a natural problem in connection with the theory of nilpotent and SL2 orbits in Hodge theory. Our main result is the boundedness of variation of the ratio. For this we define the exchange graph of a given graph which encodes the exchange properties between spanning trees and spanning 2-forests in the graph. We provide a description of the connected components of this graph, and use this to prove our result on boundedness of the variations.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا