اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCombinatorial Models of Creation-Annihilation
121
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial structures and the reduction to normal form of operator polynomials in such an algebra. The connection is achieved through suitable labelled graphs, or diagrams, that are composed of elementary gates. In this way, many normal form evaluations can be systematically obtained, thanks to models that involve set partitions, permutations, increasing trees, as well as weighted lattice paths. Extensions to q-analogues, multivariate frameworks, and urn models are also briefly discussed.
قيم البحث
اقرأ أيضاً
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function methodology of
modern enumerative combinatorics and their applications to computational problems.
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication laws, the
reby providing a generic scheme furnishing combinatorial classes with an algebraic structure. The paper is meant as a gentle introduction to the concepts of composition and decomposition with the emphasis on combinatorial origin of the ensuing algebraic constructions.
We count the numbers of primitive periodic orbits on families of 4-regular directed circulant graphs with $n$ vertices. The relevant counting techniques are then extended to count the numbers of primitive pseudo orbits (sets of distinct primitive per
iodic orbits) up to length $n$ that lack self-intersections, or that never intersect at more than a single vertex at a time repeated exactly twice for each self-intersection (2-encounters of length zero), for two particular families of graphs. We then regard these two families of graphs as families of quantum graphs and use the counting results to compute the variance of the coefficients of the quantum graphs characteristic polynomial.
We biject two combinatorial models for tensor products of (single-column) Kirillov-Reshetikhin crystals of any classical type $A-D$: the quantum alcove model and the tableau model. This allows us to translate calculations in the former model (of the
energy function, the combinatorial $R$-matrix, etc.) to the latter, which is simpler.
The Sachdev-Ye-Kitaev (SYK) model is a model of $q$ interacting fermions whose large N limit is dominated by melonic graphs. In this review we first present a diagrammatic proof of that result by direct, combinatorial analysis of its Feynman graphs.
Gross and Rosenhaus have then proposed a generalization of the SYK model which involves fermions with different flavors. In terms of Feynman graphs, these flavors can be seen as reminiscent of the colors used in random tensor theory. Applying modern tools from random tensors to such a colored SYK model, all leading and next-to-leading orders diagrams of the 2-point and 4-point functions in the large $N$ expansion can be identified. We then study the effect of non-Gaussian average over the random couplings in a complex, colored version of the SYK model. Using a Polchinski-like equation and random tensor Gaussian universality, we show that the effect of this non-Gaussian averaging leads to a modification of the variance of the Gaussian distribution of couplings at leading order in $N$. We then derive the form of the effective action to all orders.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
