ترغب بنشر مسار تعليمي؟ اضغط هنا

Asymptotics of multivariate sequences in the presence of a lacuna

43   0   0.0 ( 0 )
 نشر من قبل Robin Pemantle
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

We explain a discontinuous drop in the exponential growth rate for certain multivariate generating functions at a critical parameter value, in even dimensions $d geq 4$. This result depends on computations in the homology of the algebraic variety where the generating function has a pole. These computations are similar to, and inspired by, a thread of research in applications of complex algebraic geometry to hyperbolic PDEs, going back to Leray, Petrowski, Atiyah, Bott and Garding. As a consequence, we give a topological explanation for certain asymptotic phenomenon appearing in the combinatorics and number theory literature. Furthermore, we show how to combine topological methods with symbolic algebraic computation to determine explicitly the dominant asymptotics for such multivariate generating functions. This in turn enables the rigorous determination of integer coefficients in the Morse-Smale complex, which are difficult to determine using direct geometric methods.



قيم البحث

اقرأ أيضاً

We explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far an object is from being symmetric. We define this notion for composit ions, words, matchings, binary trees and permutations, we find generating functions enumerating these objects with respect to their degree of asymmetry, and we describe the limiting distribution of this statistic in each case.
Answering a question of Clark and Ehrenborg (2010), we determine asymptotics for the number of permutations of size n that admit the most common excedance set. In fact, we provide a more general bivariate asymptotic using the multivariate asymptotic methods of R. Pemantle and M. C. Wilson. We also consider two applications of our main result. First, we determine asymptotics on the number of permutations of size n which simultaneously avoid the generalized patterns 21-34 and 34-21. Second, we determine asymptotics on the number of n-cycles that admit no stretching pairs.
This paper develops asymptotics and approximations for ruin probabilities in a multivariate risk setting. We consider a model in which the individual reserve processes are driven by a common Markovian environmental process. We subsequently consider a regime in which the claim arrival intensity and transition rates of the environmental process are jointly sped up, and one in which there is (with overwhelming probability) maximally one transition of the environmental process in the time interval considered. The approximations are extensively tested in a series of numerical experiments.
In recent joint work (2021), we introduced a novel multivariate polynomial attached to every metric space - in particular, to every finite simple connected graph $G$ - and showed it has several attractive properties. First, it is multi-affine and rea l-stable (leading to a hitherto unstudied delta-matroid for each graph $G$). Second, the polynomial specializes to (a transform of) the characteristic polynomial $chi_{D_G}$ of the distance matrix $D_G$; as well as recovers the entire graph, where $chi_{D_G}$ cannot do so. Third, the polynomial encodes the determinants of a family of graphs formed from $G$, called the blowups of $G$. In this short note, we exhibit the applicability of these tools and techniques to other graph-matrices and their characteristic polynomials. As a particular case, we will see that the adjacency characteristic polynomial $chi_{A_G}$ is in fact the shadow of a richer multivariate blowup-polynomial, which is similarly multi-affine and real-stable. Moreover, this polynomial encodes not only the aforementioned three properties, but also yields additional information for specific families of graphs.
117 - David Callan 2016
We show that sequences A026737 and A111279 in The On-Line Encyclopedia of Integer Sequences are the same by giving a bijection between two classes of Grand Schroder paths.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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