Related papers: The Spectral Edges Conjecture via Corners

The edge-degeneracy model is an exponential random graph model that uses the graph degeneracy, a measure of the graph's connection density, and number of edges in a graph as its sufficient statistics. We show this model is relatively…

We introduce the periodic Airy-Schr\"odinger operator and we study its band spectrum. This is an example of an explicitly solvable model with a periodic potential which is not differentiable at its minima and maxima. We define a…

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…

Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint…

Sidorenko's conjecture states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge density. While still open for graphs, the…

In this paper, a simple proof of the divergence theorem is given by using the Dirac operator and noncommutative residues. Then we extend the divergence theorem to compact manifolds with boundary by the noncommutative residue of the…

We study the spectra of operators on periodic graphs using methods from combinatorial algebraic geometry. Our main result is a bound on the number of complex critical points of the Bloch variety, together with an effective criterion for…

Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…

The Petersen colouring conjecture states that every bridgeless cubic graph admits an edge-colouring with $5$ colours such that for every edge $e$, the set of colours assigned to the edges adjacent to $e$ has cardinality either $2$ or $4$,…

The well known Mantel's Theorem states that a graph on $n$ vertices and $m$ edges contains a triangle if $m>\frac{n^2}{4}$. Nosal proved that every graph on $m$ edges contains a triangle if the spectral radius $\lambda_1>\sqrt{m}$, which is…

We demonstrate that a periodic waveguide comprising of uniform lossless segments together with discrete gain and radiating elements supports exceptional points of degeneracy (EPDs). We provide analytical expressions for all possible…

A vertex in a directed graph is said to have a large second neighborhood if it has at least as many second out-neighbors as out-neighbors. The Second Neighborhood Conjecture, first stated by Seymour, asserts that there is a vertex having a…

In the 1960s, Erd\H{o}s and his cooperators initiated the research of the maximum numbers of edges in a graph or a planar graph on $n$ vertices without $k$ edge-disjoint cycles. This problem had been solved for $k\leq4$. As pointed out by…

We show that 2D periodic operators with local and perpendicular defects form an algebra. We provide an algorithm of finding spectrum for such operators. While the continuous spectral components can be computed by simple algebraic operations…

Let $D$ be a digraph. A subset $S$ of $V(D)$ is a stable set if every pair of vertices in $S$ is non-adjacent in $D$. A collection of disjoint paths $\mathcal{P}$ of $D$ is a path partition of $V(D)$, if every vertex in $V(D)$ is on a path…

We consider a magnetic Schr\"odinger operator in two dimensions. The magnetic field is given as the sum of a large and constant magnetic field and a random magnetic field. Moreover, we allow for an additional deterministic potential as well…

We provide an exhaustive spectral analysis of the two-dimensional periodic square graph lattice with a magnetic field. We show that the spectrum consists of the Dirichlet eigenvalues of the edges and of the preimage of the spectrum of a…

Let $ D $ be a finite digraph, and let $ V_0,\dots,V_{k-1} $ be nonempty subsets of $ V(D) $. The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-disjoint spanning branchings $ \mathcal{B}_0,\dots,…

In the theory of ergodic one-dimensional Schrodinger operators, ac spectrum has been traditionally expected to be very rigid. Two key conjectures in this direction state, on one hand, that ac spectrum demands almost periodicity of the…

In the present work we consider off-diagonal Jacobi matrices with uncertainty in the position of sparse perturbations. We prove (Theorem 3.2) that the sequence of Pr\"ufer angles (\theta_{k}^{\omega})_{k\geq 1} is u.d mod \pi for all \phi…