Related papers: Non-Weyl Resonance Asymptotics for Quantum Graphs

If G is a non-nilpotent group and nil(G) = {g \in G : <g, h> is nilpotent for all h\in G}, the nilpotent graph of G is the graph with set of vertices G-nil(G) in which two distinct vertices are related if they generate a nilpotent subgroup…

We construct models of many-particle quantum graphs with singular two-particle contact interactions, which can be either hardcore- or delta-interactions. Self-adjoint realisations of the two-particle Laplacian including such interactions…

We define space-times which are asymptotic to radiation dominant Friedman-Robertson-Walker space-times at timelike infinity and study the asymptotic structure. We discuss the local asymptotic symmetry and give a definition of the total…

We construct a top-down holographic model of Weyl semimetal states using $(3+1)$-dimensional $\mathcal{N}=4$ supersymmetric $SU(N_c)$ Yang-Mills theory, at large $N_c$ and strong coupling, coupled to a number $N_f \ll N_c$ of…

Let $\Gamma$ be an arbitrary $\mathbb{Z}^n$-periodic metric graph, which does not coincide with a line. We consider the Hamiltonian $\mathcal{H}_\varepsilon$ on $\Gamma$ with the action $-\varepsilon^{-1}{\mathrm{d}^2/\mathrm{d} x^2}$ on…

This paper studies the asymptotic behavior of the integral kernel of the Dunkl transform, the so-called Dunkl kernel, when one of its arguments is fixed and the other tends to infinity either within a Weyl chamber of the associated…

The number A(q) shows the asymptotic behaviour of the quotient of the number of rational points over the genus of non-singular absolutely irreducible curves over a finite field Fq. Research on bounds for A(q) is closely connected with the…

This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…

The Weyl geometry promises potential applications in gravity and quantum mechanics. We study the relationships between the Weyl geometry, quantum entropy and quantum entanglement based on the Weyl geometry endowing the Euclidean metric. We…

The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…

Our topological setting is a smooth compact manifold of dimension two or higher with smooth boundary. Although this underlying topological structure is smooth, the Riemannian metric tensor is only assumed to be bounded and measurable. This…

The non-solvable graph of a finite group G is a simple graph whose vertices are the elements of G and there is an edge between x and y if and only if the subgroup generated by x and y is not solvable. The isolated vertices in the…

In this paper, we study the semiclassical behavior of Bloch electrons in the presence of Weyl nodes, which are singular points in the band structure of certain materials. We carry out asymptotic analysis and present a rigorous derivation of…

Computing the gravitational effective action provides a direct route to charting the landscape of admissible black hole spacetimes and their alternatives, which we will collectively call "gravitationally localized objects" (GLOBs). In this…

We say that a graph with $n$ vertices is $c$-Ramsey if it does not contain either a clique or an independent set of size $c \log n$. We define a CNF formula which expresses this property for a graph $G$. We show a superpolynomial lower…

We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$ every vertex has one of two types, the…

A non-commuting graph of a finite group $G$ is a graph whose vertices are non-central elements of $G$ and two vertices are adjacent if they don't commute in $G$. In this paper, we study the non-commuting graph of the group $U_{6n}$ and…

We study the asymptotics of certain measures on partitions (the so-called z-measures and their relatives) in two different regimes: near the diagonal of the corresponding Young diagram and in the intermediate zone between the diagonal and…