Related papers: Drawing butterflies from the almost Mathieu operat…
We present a multiple scattering analysis of robust interface states for flexural waves in thin elastic plates. We show that finite clusters of linear arrays of scatterers built on a quasi-periodic arrangement support bounded modes in the…
The Laplace-Beltrami operator in the curved M\"obius strip is investigated in the limit when the width of the strip tends to zero. By establishing a norm-resolvent convergence, it is shown that spectral properties of the operator are…
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…
In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…
We estimate the size of the spectral gap at zero for some Hermitian block matrices. Included are quasi-definite matrices, quasi-semidefinite matrices (the closure of the set of the quasi-definite matrices) and some related block matrices…
We complete a certain diagram (the operadic butterfly) of categories of algebras involving Com, As, and Lie by constructing a type of algebras which have 4 generating operations and 16 relations. The associated operad is self-dual for…
We introduce the $k$-Plane Insertion into Plane drawing ($k$-PIP) problem: given a plane drawing of a planar graph $G$ and a set $F$ of edges, insert the edges in $F$ into the drawing such that the resulting drawing is $k$-plane. In this…
The complex dynamics of baker's map and its variants in an infinite-precision mathematical domain have been extensively analyzed in the past five decades. However, their real structure implemented in a finite-precision computer remains…
We show that spectral data of transfer operators given by holomorphic data can be approximated using an effective numerical scheme based on Lagrange interpolation. In particular, we show that for one-dimensional systems satisfying certain…
Interference phenomena are the source of some of the spectacular colors of animals and plants in nature. In some of these systems, the physical structure consists of an ordered array of layers with alternating high and low refractive…
We study the topological characterization of the energy gaps in general two-dimensional quasiperiodic systems consisting of multiple periodicities, represented by twisted two-dimensional materials. We show that every single gap is uniquely…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…
We present here a Hofstadter's butterfly spectrum for the magic angle twisted bilayer graphene obtained using an ab initio based multi-million atom tight-binding model. We incorporate a hexagonal boron nitride substrate and out-of-plane…
We describe a systematic method to construct models of Chern insulators whose Berry curvature and the quantum volume form coincide and are flat over the Brillouin zone; such models are known to be suitable for hosting fractional Chern…
We rely on a recent method for determining edge spectra and we use it to compute the Chern numbers for Hofstadter models on the honeycomb lattice having rational magnetic flux per unit cell. Based on the bulk-edge correspondence, the Chern…
Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…
We propose a way of characterizing the algorithms computing a Walsh-Hadamard transform that consist of a sequence of arrays of butterflies ($I_{2^{n-1}}\otimes \text{DFT}_2$) interleaved by linear permutations. Linear permutations are those…
Arclength continuation and branch switching are enormously successful algorithms for the computation of bifurcation diagrams. Nevertheless, their combination suffers from three significant disadvantages. The first is that they attempt to…
The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. in the context of biological networks. The problem is to decide if a vertex-colored graph has a connected subgraph whose colors equal a…
Narrow band electron systems are particularly likely to exhibit correlated many-body phases driven by interaction effects. Examples include magnetic materials, heavy fermion systems, and topological phases such as fractional quantum Hall…