English
Related papers

Related papers: Conjectured Bounds for 2-Local Hamiltonians via To…

200 papers

In this paper we propose a Hamiltonian approach to gapped topological phases on an open surface with boundary. Our setting is an extension of the Levin-Wen model to a 2d graph on the open surface, whose boundary is part of the graph. We…

Strongly Correlated Electrons · Physics 2018-01-31 Yuting Hu , Zhu-Xi Luo , Ren Pankovich , Yidun Wan , Yong-Shi Wu

We discuss some open problems concerning the maximal spread of coherent distributions. We prove a sharp bound on $\mathbb{E}|X-Y|^{\alpha}$ for $(X,Y)$ coherent and $\alpha \le 2$, and establish a novel connection between coherent…

Probability · Mathematics 2020-07-17 Stanisław Cichomski

Let $\mathcal{A}(H)$ and $\mathcal{Q}(H)$ be the adjacency tensor and signless Laplacian tensor of an $r$-uniform hypergraph $H$. Denote by $\rho(H)$ and $\rho(\mathcal{Q}(H))$ the spectral radii of $\mathcal{A}(H)$ and $\mathcal{Q}(H)$,…

Spectral Theory · Mathematics 2016-11-23 Lele Liu , Liying Kang , Erfang Shan

Let $H$ be an $n$-vertex 3-uniform hypergraph such that every pair of vertices is in at least $n/3+o(n)$ edges. We show that $H$ contains two vertex-disjoint tight paths whose union covers the vertex set of $H$. The quantity two here is…

Combinatorics · Mathematics 2022-05-05 Jie Han

Confirming a conjecture of Elphick and Edwards and strengthening a spectral theorem of Wilf, Nikiforov proved that for any $K_{r+1}$-free graph $G$, $\lambda(G)^2 \leq 2 (1 - 1/r) m$, where $\lambda(G)$ is the spectral radius of $G$, and…

Combinatorics · Mathematics 2025-12-16 Lele Liu , Bo Ning

Let $G$ be a graph on $n$ vertices with $r := \lfloor n/2 \rfloor$ and let $\lambda_1 \geq...\geq \lambda_{n} $ be adjacency eigenvalues of $G$. Then the H\"uckel energy of $G$, HE($G$), is defined as $$\he(G) = {ll} 2\sum_{i=1}^{r}…

Combinatorics · Mathematics 2009-09-04 Ebrahim Ghorbani , Jack H. Koolen , Jae Young Yang

In this paper, we give the relationship between spectral radius and local structures of graphs and hypergraphs. Our work shows that certain local subgraphs (subhypergraphs) must occur when the spectral radius ratio is large. We also give…

Combinatorics · Mathematics 2025-12-02 Jiang Zhou , Changjiang Bu

Let $G$ be a simple graph of order $n$ with eigenvalues $\lambda_1(G)\geq \cdots \geq \lambda_n(G)$. Define \[s^+(G)=\sum_{\lambda_i >0} \lambda_i^2(G), \quad s^-(G)=\sum_{\lambda_i<0} \lambda_i^2(G).\] It was conjectured by Elphick,…

Combinatorics · Mathematics 2025-06-10 Saieed Akbari , Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada , Shengtong Zhang

In this paper we prove that maximal H-monotone operators $T:H^n\rightrightarrows V_1$ whose domain is all the Heisenberg group $H^n$ are locally bounded. This implies that they are upper semicontinuous. As a consequence, maximal…

Functional Analysis · Mathematics 2016-05-10 Z. M. Balogh , A. Calogero , R. Pini

We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…

Mathematical Physics · Physics 2025-03-14 Pavel Exner , Jonathan Rohleder

We consider an isolated plane curve singularity and its associated Eisenbud an Neumann diagram. We give an algorithm to compute the maximal spectral value on the diagram and we show that the singularity is topologically equivalent to…

Algebraic Geometry · Mathematics 2007-05-23 Thomas Brélivet

Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…

Disordered Systems and Neural Networks · Physics 2010-02-25 Lenka Zdeborová , Stefan Boettcher

Goemans and Williamson designed a 0.878-approximation algorithm for Max-Cut in undirected graphs [JACM'95]. Khot, Kindler, Mosel, and O'Donnel showed that the approximation ratio of the Goemans-Williamson algorithm is optimal assuming…

Data Structures and Algorithms · Computer Science 2024-09-16 Tamio-Vesa Nakajima , Stanislav Živný

Given a planar graph family $\mathcal{F}$, let ${\rm ex}_{\mathcal{P}}(n,\mathcal{F})$ and ${\rm spex}_{\mathcal{P}}(n,\mathcal{F})$ be the maximum size and maximum spectral radius over all $n$-vertex $\mathcal{F}$-free planar graphs,…

Combinatorics · Mathematics 2023-12-19 Longfei Fang , Huiqiu Lin , Yongtang Shi

We develop a general theoretical framework based on $Z$-classification to count the number of topological bound states at a junction of chiral-symmetric one-dimensional systems. The formulation applies to general multiway junctions composed…

Mesoscale and Nanoscale Physics · Physics 2020-06-24 Gen Tamaki , Takuto Kawakami , Mikito Koshino

We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…

Social and Information Networks · Computer Science 2013-02-04 Raj Rao Nadakuditi , M. E. J. Newman

Let $spex(n,H_{minor})$ denote the maximum spectral radius of $n$-vertex $H$-minor free graphs. The problem on determining this extremal value can be dated back to the early 1990s. Up to now, it has been solved for $n$ sufficiently large…

Combinatorics · Mathematics 2026-03-23 Mingqing Zhai , Longfei Fang , Huiqiu Lin

The energy spectra and wavefunctions of bound excitons in important two-dimensional (2D) graphene derivatives, i.e., graphyne and graphane, are found to be strongly modified by quantum confinement, making them qualitatively different from…

Mesoscale and Nanoscale Physics · Physics 2015-06-16 Shouting Huang , Yufeng Liang , Li Yang

Call the sum of the singular values of a matrix A the energy of A. We investigate graphs and matrices of energy close to the maximal one. We prove a conjecture of Koolen and Moulten and give a stability theorem characterizing all square…

Combinatorics · Mathematics 2007-05-23 Vladimir Nikiforov

Let $G$ be a graph with $n$ non-isolated vertices and $m$ edges. The positive / negative square energies of $G$, denoted $s^+(G)$ / $s^-(G)$, are defined as the sum of squares of the positive / negative eigenvalues of the adjacency matrix…

Combinatorics · Mathematics 2024-09-27 Shengtong Zhang
‹ Prev 1 8 9 10 Next ›