相关论文: Dispersion on certain Cartesian products of graphs
Consider the one-dimensional discrete Schr\"odinger operator $H_{\theta}$: $$(H_{\theta} q)_n=-(q_{n+1}+q_{n-1})+ V(\theta+n\omega) q_n \ , \quad n\in Z \ ,$$ with $\omega\in R^d$ Diophantine, and $V$ a real-analytic function on $ T^d=(…
Schultz \cite{S98} proved dispersive estimates for the wave equation on lattice graphs $\mathbb{Z}^d$ for $d=2,3,$ which was extended to $d=4$ in \cite{BCH23}. By Newton polyhedra and the algorithm introduced by Karpushkin \cite{K83}, we…
We show that the flat chaotic analytic zero points (i.e. zeroes of a random entire function whose Taylor coefficients are independent complex-valued Gaussian random variables, and the variance of the k-th coefficient is 1/k!) can be…
A straightforward analytical scheme is proposed for computing the long-time, asymptotic mean velocity and dispersivity (effective diffusivity) of a particle undergoing a discrete biased random walk on a periodic lattice amongst an array of…
We study the $L^1-L^\infty$ dispersive estimate of the inhomogeneous fourth-order Schr\"{o}dinger operator $H=\Delta^{2}-\Delta+V(x)$ with zero energy obstructions in $\mathbf{R}^{3}$. For the related propagator $e^{-itH}$, we prove that…
We prove an effective slope gap distribution result first for the square torus and then for general lattice translation surfaces. As a corollary, we obtain a dynamical proof for an effective gap distribution result for the Farey fractions.…
We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
We establish sharp time decay estimates for the the Klein-Gordon equation on the cubic lattice in dimensions $d=2,3,4$. The $\ell^1\to\ell^{\infty}$ dispersive decay rate is $|t|^{-3/4}$ for $d=2$, $|t|^{-7/6}$ for $d=3$ and…
We prove that the set of visible points of any lattice of dimension at least 2 has pure point diffraction spectrum, and we determine the diffraction spectrum explicitly. This settles previous speculation on the exact nature of the…
Let $G$ be a finite connected graph on two or more vertices and $G^{[N,k]}$ the distance $k$-graph of the $N$-fold Cartesian power of $G$. For a fixed $k\ge1$, we obtain explicitly the large $N$ limit of the spectral distribution (the…
The k-fold Cartesian product of a graph G is defined as a graph on k-tuples of vertices, where two tuples are connected if they form an edge in one of the positions and are equal in the rest. Starting with G as a single edge gives G^k as a…
This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local…
Effective estimates for the lattice point discrepancy of certain planar and three-dimensional domains. This paper provides estimates, with explicit constants, for the lattice point discrepancy of o-symmetric ellipse discs and ellipsoids in…
We show that the matching book thickness of the Cartesian product of two odd-length cycle-graphs is five if at least one of the cycles has length 3 or 5.
We establish the sharp \( l^1 \to l^{\infty} \) decay estimate for the discrete Schr\"odinger equation (DS) on the Layered King's Grid (LKG), with a dispersive decay rate of \( \langle t \rangle^{-13/12} \), which is faster than that for…
Based on the weighted and shifted Gr\"{u}nwald difference (WSGD) operators [24], we further construct the compact finite difference discretizations for the fractional operators. Then the discretization schemes are used to approximate the…
Let $k$ be an integer. We prove a rough structure theorem for separations of order at most $k$ in finite and infinite vertex transitive graphs. Let $G = (V,E)$ be a vertex transitive graph, let $A \subseteq V$ be a finite vertex-set with…
The dispersion of a point set in the unit square is defined to be the area of the largest empty axis-parallel box. In this paper we are interested in the dispersion of lattices in the plane, that is, the supremum of the area of the empty…
The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing the Hasse diagram is given, and the rank generating function…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…