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

Let ${\rm EX}(n,H)$ and ${\rm SPEX}(n,H)$ denote the families of $n$-vertex $H$-free graphs with the maximum size and the maximum spectral radius, respectively. A graph $H$ is said to be spectral-consistent if ${\rm SPEX}(n,H)\subseteq {\rm…

The fundamental theorem of Tur\'{a}n from Extremal Graph Theory determines the exact bound on the number of edges $t_r(n)$ in an $n$-vertex graph that does not contain a clique of size $r+1$. We establish an interesting link between…

A classical object in hypergraph Tur\'{a}n theory is the Fano plane $\mathbb{F}$, the unique linear $3$-graph on seven vertices with seven edges. The Tur\'{a}n density and exact Tur\'{a}n number of $\mathbb{F}$, first proposed as a problem…

We show that a simple geometric result suffices to derive the form of the optimal solution in a large class of finite and infinite-dimensional maximum entropy problems concerning probability distributions, spectral densities and covariance…

We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain…

For any vector bundle, we define an inverse system of spectra. In the case of a trivial bundle over a point, the homotopy groups of the filtration quotients give rise to the stable EHP spectral sequence, as was shown by Mahowald. The limit…

We prove that if the spectral radius of a graph G of order n is larger than the spectral radius of the r-partite Turan graph of the same order, then G contains various supergraphs of the complete graph of order r+1. In particular G contains…

We introduce a new set of generalized Fokker-Planck equations that conserve energy and mass and increase a generalized entropy until a maximum entropy state is reached. The concept of generalized entropies is rigorously justified for…

We prove a generalization of Tur\'{a}n's theorem proposed by Balogh and Lidick\'{y}.

We introduce a generalized Lagrangian density - involving a non-Hermitian kinetic term - for a quantum particle with the generalized momentum operator. Upon variation of the Lagrangian, we obtain the corresponding Schrodinger equation. The…

The generalized Tur\'an problem $ext(n,T,F)$ is to determine the maximal number of copies of a graph $T$ that can exist in an $F$-free graph on $n$ vertices. Recently, Gerbner and Palmer noted that the solution to the generalized Tur\'an…

In this work we generalize the results for the entropy spectra typically derived for black holes in general relativity to a generic horizon within the spherically symmetric (asymptotically flat and non-flat) space-times of more general…

We combine two generalizations of ordinary Tur\'an problems. Given graphs $H$ and $F$ and a positive integer $n$, we study $rex(n, H, F )$, which is the largest number of copies of $H$ in $F$-free regular $n$-vertex graphs.

We establish that temporal averaging over multiple observations is the degenerate case of algebraic group action with the trivial group $G=\{e\}$. A General Replacement Theorem proves that a group-averaged estimator from one snapshot…

We consider the Tarski--Bang problem about covering of convex bodies by planks. The results of this kind give a lower bound on the sum of widths of planks (regions between a pair of parallel hyperplanes) covering a given convex body.…

A set of different conformal solutions corresponding to a constant flux of squared vorticity is considered. Requiring constant fluxes of all inviscid vorticity invariants (higher powers of the vorticity), we come to the conclusion that the…

We study the generalized Ramsey--Tur\'an function $\mathrm{RT}(n,K_s,K_t,o(n))$, which is the maximum possible number of copies of $K_s$ in an $n$-vertex $K_t$-free graph with independence number $o(n)$. The case when $s=2$ was settled by…

In this paper we investigate generalizations of Kazhdan's property $(T)$ to the setting of uniformly convex Banach spaces. We explain the interplay between the existence of spectral gaps and that of Kazhdan projections. Our methods employ…

In the so-called generalized Tur\'an problems we study the largest number of copies of $H$ in an $n$-vertex $F$-free graph $G$. Here we introduce a variant, where $F$ is not forbidden, but we restrict how copies of $H$ and $F$ can be placed…

The classical Erd\H{o}s-Tur\'an inequality on the distribution of roots for complex polynomials can be equivalently stated in a potential theoretic formulation, that is, if the logarithmic potential generated by a probability measure on the…