Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCombinatorial problems of (quasi-)crystallography
52
0
0.0
(
0
)
Authors
Michael Baake
Ask ChatGPT about the research
No Arabic abstract
Several combinatorial problems of (quasi-)crystallography are reviewed with special emphasis on a unified approach, valid for both crystals and quasicrystals. In particular, we consider planar sublattices, similarity sublattices, coincidence sublattices, their module counterparts, and central and averaged shelling. The corresponding counting functions are encapsulated in Dirichlet series generating functions, with explicit results for the triangular lattice and the twelvefold symmetric shield tiling. Other combinatorial properties are briefly summarised.
rate research
Read More
We consider properties of the operators D(r,M)=a^r(a^dag a)^M (which we call generalized Laguerre-type derivatives), with r=1,2,..., M=0,1,..., where a and a^dag are boson annihilation and creation operators respectively, satisfying [a,a^dag]=1. We obtain explicit formulas for the normally ordered form of arbitrary Taylor-expandable functions of D(r,M) with the help of an operator relation which generalizes the Dobinski formula. Coherent state expectation values of certain operator functions of D(r,M) turn out to be generating functions of combinatorial numbers. In many cases the corresponding combinatorial structures can be explicitly identified.
The speed of growth for a particular stochastic growth model introduced by Borodin and Ferrari in [Comm. Math. Phys. 325 (2014), 603-684], which belongs to the KPZ anisotropic universality class, was computed using multi-time correlations. The model was recently generalized by Toninelli in [arXiv:1503.05339] and for this generalization the stationary measure is known but the time correlations are unknown. In this note, we obtain algebraic and combinatorial proofs for the expression of the speed of growth from the prescribed dynamics.
Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, transport moments reduce to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders higher than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.
To study electronic transport through chaotic quantum dots, there are two main theoretical approachs. One involves substituting the quantum system with a random scattering matrix and performing appropriate ensemble averaging. The other treats the transport in the semiclassical approximation and studies correlations among sets of classical trajectories. There are established evaluation procedures within the semiclassical evaluation that, for several linear and non-linear transport moments to which they were applied, have always resulted in the agreement with random matrix predictions. We prove that this agreement is universal: any semiclassical evaluation within the accepted procedures is equivalent to the evaluation within random matrix theory. The equivalence is shown by developing a combinatorial interpretation of the trajectory sets as ribbon graphs (maps) with certain properties and exhibiting systematic cancellations among their contributions. Remaining trajectory sets can be identified with primitive (palindromic) factorisations whose number gives the coefficients in the corresponding expansion of the moments of random matrices. The equivalence is proved for systems with and without time reversal symmetry.
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specifically Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. In this note we concentrate on the combinatorial graph approach, showing how some important classical results of graph theory lead to transparent representations of the combinatorial numbers associated with the boson normal ordering problem.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
