Related papers: Spectral generalized Tur\'{a}n problems

In this paper, we prove that the spectral curve $\Gamma_{\mathbf{n}}$ of the generalized Lam\'{e} equation with the Treibich-Verdier potential \begin{equation*} y^{\prime \prime }(z)=\bigg[ \sum_{k=0}^{3}n_{k}(n_{k}+1)\wp(z+\tfrac{%…

Let $G$ be an $n$-vertex graph, and let $\lambda(G)$ and $\lambda_n(G)$ denote the largest and smallest eigenvalues of its adjacency matrix. Write $e(G)$ for the number of edges of $G$, $d(G)=2e(G)/n$ for its average degree, and $T_r(n)$…

We consider the Klein-Gordon equation on a star-shaped network composed of n half-axes connected at their origins. We add a potential which is constant but different on each branch. The corresponding spatial operator is self-adjoint and we…

In this note, we adapt the Keevash-Sudakov proof of the (Tur\'{a}n) Stability Theorem for the Fano plane to find an explicit dependency between the parameters $\varepsilon$ and $\delta$. This is useful in the solution of a multicolored…

We asymptotically resolve the the uniform Tur\'an density problem for the large stars. In particular, we show that the uniform Tur\'an density of the $k$-star $S_k$ is $\frac{k^2-5k+7}{(k-1)^2}$ for $k\ge 48$, matching a lower construction…

We study the generalized Tur\'an function $ex(n,H,F)$, when $H$ or $F$ is a double star $S_{a,b}$, which is a tree with a central edge $uv$, $a$ leaves connected to $u$ and $b$ leaves connected to $v$. We determine $ex(n,K_k,S_{a,b})$ and…

In this paper, we formulate and prove several variants of the Erd\H{o}s-Tur\'{a}n additive bases conjecture.

The edge-spectral-Tur\'an type problem is also called the Brualdi-Hoffman-Tur\'an type problem, which is a central topic in spectral graph theory, seeking to determine the maximum spectral radius $\lambda(G)$ of an $F$-free graph $G$ with…

For graphs $H$ and $F$, the generalized Tur\'an number $ex(n,H,F)$ is the largest number of copies of $H$ in an $F$-free graph on $n$ vertices. We consider this problem when both $H$ and $F$ have at most four vertices. We give sharp results…

We prove a generalization of a result of Peres and Schlag on the dimensions of certain exceptional sets of projections and then apply it to a geometric problem.

We present a spectral-theoretic approach to time-average statistical mechanics for general, non-equilibrium initial conditions. We consider the statistics of bounded, local additive functionals of reversible as well as irreversible ergodic…

By employing polynomial-reduced KP integrability, combined with the string equation, this work establishes explicit relationships between the generalized Kontsevich model, the topological recursion of the spectral curve, and the geometry of…

We prove entropic and total variation versions of the Erd\H{o}s-Kac limit theorem for the maximum of the partial sums of i.i.d. random variables with densities.

We propose a generalization of the Witten conjecture, which connects a descendent enumerative theory with a specific reduction of KP integrable hierarchy. Our conjecture is realized by two parts: Part I (Geometry) establishes a…

This paper discusses a general method for spectral type theorems using metric spaces instead of vector spaces. Advantages of this approach are that it applies to genuinely non-linear situations and also to random versions. Metric analogs of…

Let $C_{2k_1, 2k_2, \ldots, 2k_t}$ denote the graph obtained by intersecting $t$ distinct even cycles $C_{2k_1}, C_{2k_2}, \ldots, C_{2k_t}$ at a unique vertex. In this paper, we determine the unique graphs with maximum adjacency spectral…

We propose a strengthening of the conclusion in Tur\'an's (3,4)-conjecture in terms of algebraic shifting, and show that its analogue for graphs does hold. In another direction, we generalize the Mantel-Tur\'an theorem by weakening its…

This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…

In this paper we generalize the spectral concentration problem as formulated by Slepian, Pollak and Landau in the 1960s. We show that a generalized version with arbitrary space and Fourier masks is well-posed, and we prove some new results…

The spectral Tur\'an theorem states that the $k$-partite Tur\'an graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order $n$ containing no the complete graph $K_{k+1}$ as a subgraph. This result…