Related papers: The Spectral Edges Conjecture via Corners
Effect algebras were introduced as an abstract algebraic model for Hilbert space effects representing quantum mechanical measurements. We study additional structures on an effect algebra $E$ that enable us to define spectrality and spectral…
Stable commutator length scl_G(g) of an element g in a group G is an invariant for group elements sensitive to the geometry and dynamics of G. For any group G acting on a tree, we prove a sharp bound scl_G(g)>=1/2 for any g acting without…
Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs…
All available experimental data for the $\Delta I=2$ transition energies in superdeformed bands are analyzed by using a new one-point formula. The existence of deviations from the smooth behavior is confirmed in many bands. However, we…
Based on the recent work \cite{KKK} for compact potentials, we develop the spectral theory for the one-dimensional discrete Schr\"odinger operator $$ H \phi = (-\De + V)\phi=-(\phi_{n+1} + \phi_{n-1} - 2 \phi_n) + V_n \phi_n. $$ We show…
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…
A continuum of excitations in interacting one-dimensional systems is bounded from below by a spectral edge that marks the lowest possible excitation energy for a given momentum. We analyse short-range interactions between Fermi particles…
The Schr\"odinger equation is considered on the half line with a selfadjoint boundary condition when the potential is real valued, integrable, and has a finite first moment. It is proved that the potential and the two boundary conditions…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
Spectral analysis is performed on the Born equation, a strongly singular integral equation modeling the interactions between electromagnetic waves and arbitrarily shaped dielectric scatterers. Compact and Hilbert--Schmidt operator…
In this paper spectral theorems for not necessarily continuous normal and self-adjoint random operators on a complex separable Hilbert space are proved.
A well-known conjecture of Erd\H{o}s and S\'os states that every graph with average degree exceeding $m-1$ contains every tree with $m$ edges as a subgraph. We propose a variant of this conjecture, which states that every graph of maximum…
The Ferrers bound conjecture is a natural graph-theoretic extension of the enumeration of spanning trees for Ferrers graphs. We document the current status of the conjecture and provide a further conjecture which implies it.
We develop a spectral approach to Sidorenko-type inequalities and apply it to establish sharp edge-spectral supersaturation results. Let $H$ be a bipartite graph with $v$ vertices and $e$ edges, where $v\le e$, and write $M(G)=2e(G)$. We…
Edge connectivity and vertex connectivity are two fundamental concepts in graph theory. Although by now there is a good understanding of the structure of graphs based on their edge connectivity, our knowledge in the case of vertex…
We study the edge deletion process of random graphs near a k-core percolation point. We find that the time-dependent number of edges in the process exhibits critically divergent fluctuations. We first show theoretically that the k-core…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…
The classical Berge-Fulkerson conjecture states that any bridgeless cubic graph $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to two of the perfect matchings from the list. In this short note, we discuss two…
Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829] showed that the spectral radius of $G^\sigma$ is the same…
The $(k,r)$-fan is the graph consisting of $k$ copies of the complete graph $K_r$ which intersect in a single vertex, and is denoted by $F_{k,r}$. Erd\H{o}s, F\"uredi, Gould and Gunderson [J. Combin. Theory Ser. B 64 (1995) 89--100]…