Point interactions described by formal shaped potentials were used in quantum mechanics from the early thirties. It lasted several decades, however, until a proper way to handle the corresponding Schrdinger operators was found. Following the observation of Berezin and Faddeev [4], the problem was studied systematically in the eighties. The results are summarized in the monograph [1], references to some recent work are given, eg, in [2, 8]. In its present form the pointinteraction method represents a versatile tool for constructing solvable models whose power has not been yet, to our opinion, appreciated fully in the physical community. Within the standard quantum mechanical formalism point interactions can be constructed as long as the configuration space dimension does not exceed three, and they can be interpreted as limits of suitable families of squeezed potentials. In the onedimensional case the limiting argument admits a straightforward interpretation, because the pointinteraction coupling constant is just the integral of the approximating potential: a slow particle on the line with a wellspread wavefunction sees only the average value of a localized potential. In distinction to that the approximation by scaled potentials in dimension two and three requires existence of a zeroenergy resonance and a particular couplingconstant renormalization; a detailed discussion of the related mathematical problems can be found in [1, 9]. This gives these point interactions a flavour of something exceptional, for instance, one is led to believe that they cannot be used to model welllocalized repulsive potentials. That would have consequences

Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). We use the symbol $Z_4$ to denote $K_4-P_2.$ A sequence $S$ is potentially $K_{m}-H$-graphical if it has a realization containing a $K_{m}-H$ as a subgraph. Let $\sigma(K_{m}-H, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_{m}-H, n)$ is potentially $K_{m}-H$-graphical. In this paper, we determine the values of $\sigma (K_{r+1}-Z, n)$ for $n\geq 5r+19, r+1 \geq k \geq 5,$ $j \geq 5$ where $Z$ is a graph on $k$ vertices and $j$ edges which contains a graph $Z_4$ but not contains a cycle on $4$ vertices. We also determine the values of $\sigma (K_{r+1}-Z_4, n)$, $\sigma (K_{r+1}-(K_4-e), n)$, $\sigma (K_{r+1}-K_4, n)$ for $n\geq 5r+16, r\geq 4$.

abstract

Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). We use the symbol $Z_4$ to denote $K_4-P_2.$ A sequence $S$ is potentially $K_{m}-H$-graphical if it has a realization containing a $K_{m}-H$ as a subgraph. Let $\sigma(K_{m}-H, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_{m}-H, n)$ is potentially $K_{m}-H$-graphical. In this paper, we determine the values of $\sigma (K_{r+1}-U, n)$ for $n\geq 5r+18, r+1 \geq k \geq 7,$ $j \geq 6$ where $U$ is a graph on $k$ vertices and $j$ edges which contains a graph $K_3 \bigcup P_3$ but not contains a cycle on $4$ vertices and not contains $Z_4$.

Let $K_k$, $C_k$, $T_k$, and $P_{k}$ denote a complete graph on $k$ vertices, a cycle on $k$ vertices, a tree on $k+1$ vertices, and a path on $k+1$ vertices, respectively. Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). A sequence $S$ is potentially $K_{m}-H$-graphical if it has a realization containing a $K_{m}-H$ as a subgraph. Let $\sigma(K_{m}-H, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_{m}-H, n)$ is potentially $K_{m}-H$-graphical. In this paper, we determine the values of $\sigma (K_{r+1}-H, n)$ for $n\geq 4r+10, r\geq 3, r+1 \geq k \geq 4$ where $H$ is a graph on $k$ vertices which contains a tree on $4$ vertices but not contains a cycle on $3$ vertices. We also determine the values of $\sigma (K_{r+1}-P_2, n)$ for $n\geq 4r+8, r\geq 3$.

We generate a class of string backgrounds by a sequence of TsT transformations of the NS1-NS5 system that we argue are holographically dual to states in a single-trace TT¯+JT¯+TJ¯-deformed CFT2. The new string backgrounds include general rotating black hole solutions with two U(1) charges as well as a smooth solution without a horizon that is interpreted as the ground state. As evidence for the correspondence we (i) derive the long string spectrum and relate it to the spectrum of the dual field theory; (ii) show that the black hole thermodynamics can be reproduced from single-trace TT¯+JT¯+TJ¯-deformed CFTs; and (iii) show that the energy of the ground state matches the energy of the vacuum in the dual theory. We also study geometric properties of these new spacetimes and find that for some choices of the parameters the three-dimensional Ricci scalar in the Einstein frame can become positive in a region outside the horizon before reaching closed timelike curves and singularities.

We study the relationship between TsT transformations, marginal deformations of string theory on AdS3 backgrounds, and irrelevant deformations of 2d CFTs. We show that TsT transformations of NS-NS backgrounds correspond to instantaneous deformations of the worldsheet action by the antisymmetric product of two Noether currents, holographically mirroring the definition of the TT¯, JT¯, TJ¯, and JJ¯ deformations of 2d CFTs. Applying a TsT transformation to string theory on BTZ ×S^3×M^4 we obtain a general class of rotating black string solutions, including the Horne-Horowitz and the Giveon-Itzhaki-Kutasov ones as special cases, which we show are holographically dual to thermal states in single-trace TT¯-deformed CFTs. We also find a smooth solution interpolating between global AdS3 in the IR and a linear dilaton background in the UV that is interpreted as the NS-NS ground state in the dual TT¯-deformed CFT. This background suggests the existence of an upper bound on the deformation parameter above which the solution becomes complex. We find that the worldsheet spectrum, the thermodynamics of the black strings (in particular their Bekenstein-Hawking entropy), and the critical value of the deformation parameter match the corresponding quantities obtained from single-trace TT¯ deformations.

"In this paper we consider a variation of the classical Turán-type extremal problems. Let $S$ be an $n$ -term graphical sequence, and $\sigma(S)$ be the sum of the terms in $S$ . Let $H$ be a graph. The problem is to determine the smallest even $l$ such that any $n$ -term graphical sequence $S$ having $\sigma(S)\geq l$ has a realization containing $H$ as a subgraph. Denote this value $l$ by $\sigma(H,n)$ . We show $\sigma(C_{2m+1},n)=m(2n-m-1)+2$ , for $m\geq 3$ , $n\geq 3m$ ; $\sigma(C_{2m+2},n)=m(2n-m-1)+4$ , for $m\geq 3$ , $n\geq 5m-2$ .''

Open quantum walks (also known as open quantum random walks) are quantum analogs of classical Markov chains in probability theory, and have potential application in quan- tum information and quantum computation. Quantum Bernoulli noises are annihilation and creation operators acting on Bernoulli functionals, and can be used as the environ- ment of an open quantum system. In this paper, by using quantum Bernoulli noises as the environment, we introduce an open quantum walk on a general higher-dimensional integer lattice. We obtain a quantum channel representation of the walk, which shows that the walk is indeed an open quantum walk. We prove that all the states of the walk are separable provided its initial state is separable. We also prove that, for some initial states, the walk has a limit probability distribution of higher-dimensional Gauss type. Finally we show links between the walk and a unitary quantum walk recently introduced in terms of quantum Bernoulli noises.

"A sequence $S$ is potentially $K_4-e$ graphical if it has a realization containing a $K_4-e$ as a subgraph. Let $\sigma(K_4-e,n)$ denote the smallest degree sum such that every $n$ -term graphical sequence $S$ with $\sigma(S)\geq\sigma(K_4-e,n)$ is potentially $K_4-e$ graphical. Gould, Jacobson, Lehel raised the problem of determining the value of $\sigma(K_4-e,n)$ . In this paper, we prove that $\sigma(K_4-e,n)=2[(3n-1)/2]$ for $n\geq7$ and $n=4,5$ , and $\sigma(K_4-e,6)=20$ .''