Averaged Pointwise Bounds for Deformations of Schrödinger Eigenfunctions

Let (M,g) be an n-dimensional, compact Riemannian manifold and ${P_0(\hbar) = -\hbar{^2} \Delta_g + V(x)}$ be a semiclassical Schrödinger operator with ${\hbar \in (0,\hbar_0]}$ . Let ${E(\hbar) \in [E-o(1),E+o(1)]}$ and ${(\phi_{\hbar})_{\hbar \in (0,\hbar_0]}}$ be a family of L ²-normalized eigenfunctions of ${P_0(\hbar)}$ with ${P_0(\hbar) \phi_{\hbar} = E(\hbar) \phi_{\hbar}}$ . We consider magnetic deformations of ${P_0(\hbar)}$ of the form ${P_u(\hbar) = - \Delta_{\omega_u}(\hbar) + V(x)}$ , where ${\Delta_{\omega_u}(\hbar) = (\hbar d + i \omega_u(x))^*({\hbar}d + i \omega_u(x))}$ . Here, u is a k-dimensional parameter running over ${B^k(\epsilon)}$ (the ball of radius ${\epsilon}$ ), and the family of the magnetic potentials ${(w_u)_{u\in B^k(\epsilon)}}$ satisfies the admissibility condition given in Definition 1.1. This condition implies that k ≥ n and is generic under this assumption. Consider the corresponding family of deformations of ${(\phi_{\hbar})_{\hbar \in (0, \hbar_0]}}$ , given by ${(\phi^u_{\hbar})_{\hbar \in(0, \hbar_0]}}$ , where $$\phi_{\hbar}^{(u)}:= {\rm e}^{-it_0 P_u(\hbar)/\hbar}\phi_{\hbar}$$ for ${|t_0|\in (0,\epsilon)}$ ; the latter functions are themselves eigenfunctions of the ${\hbar}$ -elliptic operators ${Q_u(\hbar): ={\rm e}^{-it_0P_u(\hbar)/\hbar} P_0(\hbar) {\rm e}^{it_0 P_u(\hbar)/\hbar}}$ with eigenvalue ${E(\hbar)}$ and ${Q_0(\hbar) = P_{0}(\hbar)}$ . Our main result, Theorem1.2, states that for ${\epsilon >0 }$ small, there are constants ${C_j=C_j(M,V,\omega,\epsilon) > 0}$ with j = 1,2 such that $$C_{1}\leq \int\limits_{\mathcal{B}^k(\epsilon)} |\phi_{\hbar}^{(u)}(x)|^2 \, {\rm d}u \leq C_{2}$$ , uniformly for ${x \in M}$ and ${\hbar \in (0,h_0]}$ . We also give an application to eigenfunction restriction bounds in Theorem 1.3.     

A unified approach for minimizing composite norms

We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem $$\begin{aligned} \begin{array}{ll} \min \limits _{X\in \mathbb{R }^{m\times n}}&\mu _1\Vert \sigma (\mathcal{F }(X)-G)\Vert _\alpha +\mu _2\Vert \mathcal{C }(X)-d\Vert _\beta ,\\ \text{ subject} \text{ to}&\mathcal{A }(X)-b\in \mathcal{Q }, \end{array} \end{aligned}$$ where $\sigma (X)$ denotes the vector of singular values of $X \in \mathbb{R }^{m\times n}$ , the matrix norm $\Vert \sigma (X)\Vert _{\alpha }$ denotes either the Frobenius, the nuclear, or the $\ell _2$ -operator norm of $X$ , the vector norm $\Vert .\Vert _{\beta }$ denotes either the $\ell _1$ -norm, $\ell _2$ -norm or the $\ell _{\infty }$ -norm; $\mathcal{Q }$ is a closed convex set and $\mathcal{A }(.)$ , $\mathcal{C }(.)$ , $\mathcal{F }(.)$ are linear operators from $\mathbb{R }^{m\times n}$ to vector spaces of appropriate dimensions. Basis pursuit, matrix completion, robust principal component pursuit (PCP), and stable PCP problems are all special cases of the composite norm minimization problem. Thus, FALC is able to solve all these problems in a unified manner. We show that any limit point of FALC iterate sequence is an optimal solution of the composite norm minimization problem. We also show that for all $\epsilon >0$ , the FALC iterates are $\epsilon $ -feasible and $\epsilon $ -optimal after $\mathcal{O }(\log (\epsilon ^{-1}))$ iterations, which require $\mathcal{O }(\epsilon ^{-1})$ constrained shrinkage operations and Euclidean projection onto the set $\mathcal{Q }$ . Surprisingly, on the problem sets we tested, FALC required only $\mathcal{O }(\log (\epsilon ^{-1}))$ constrained shrinkage, instead of the $\mathcal{O }(\epsilon ^{-1})$ worst case bound, to compute an $\epsilon $ -feasible and $\epsilon $ -optimal solution. To best of our knowledge, FALC is the first algorithm with a known complexity bound that solves the stable PCP problem.     

Restrictions of generalized Verma modules to symmetric pairs

We initiate a new line of investigation on branching problems for generalized Verma modules with respect to reductive symmetric pairs $ \left( {\mathfrak{g},\mathfrak{g}'} \right) $ . In general, Verma modules may not contain any simple module when restricted to a reductive subalgebra. In this article we give a necessary and sufficient condition on the triple $ \left( {\mathfrak{g},\mathfrak{g}',\mathfrak{p}} \right) $ such that the restriction $ {\left. X \right|_{\mathfrak{g}'}} $ always contains simple $ \mathfrak{g}' $ -modules for any $ \mathfrak{g} $ -module X lying in the parabolic BGG category $ {\mathcal{O}^\mathfrak{p}} $ attached to a parabolic subalgebra $ \mathfrak{p} $ of $ \mathfrak{g} $ . Formulas are derived for the Gelfand?CKirillov dimension of any simple module occurring in a simple generalized Verma module. We then prove that the restriction $ {\left. X \right|_{\mathfrak{g}'}} $ is generically multiplicity-free for any $ \mathfrak{p} $ and any $ X \in {\mathcal{O}^\mathfrak{p}} $ if and only if $ \left( {\mathfrak{g},\mathfrak{g}'} \right) $ is isomorphic to (A _n , A _n-1), (B _n , D _n ), or (D _n+1, B _n ). Explicit branching laws are also presented.     

Some relations on the ordering of trees by minimal energies between subclasses of trees

The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. A tree is said to be non-starlike if it has at least two vertices with degree more than 2. A caterpillar is a tree in which a removal of all pendent vertices makes a path. Let $\mathcal{T}_{n,d}$ , $\mathbb{T}_{n,p}$ be the set of all trees of order n with diameter d, p pendent vertices respectively. In this paper, we investigate the relations on the ordering of trees and non-starlike trees by minimal energies between $\mathcal{T}_{n,d}$ and $\mathbb{T}_{n,n-d+1}$ . We first show that the first two trees (non-starlike trees, resp.) with minimal energies in $\mathcal{T}_{n,d}$ and $\mathbb{T}_{n,n-d+1}$ are the same for 3≤d≤n?2 (3≤d≤n?3, resp.). Then we obtain that the trees with third-minimal energy in $\mathcal{T}_{n,d}$ and $\mathbb{T}_{n,n-d+1}$ are the same when n≥11, 3≤d≤n?2 and d≠8; and the tree with third-minimal energy in $\mathcal{T}_{n,8}$ is the caterpillar with third-minimal energy in $\mathbb{T}_{n,n-7}$ for n≥11.     

Collapsible Graphs and Hamiltonicity of Line Graphs

Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai (Combinatorics and Graph Theory, vol 95, World Scientific, Singapore, pp 53–69; Conjecture 8.6 of 1995) conjectured that every 3-edge connected and essentially 6-edge connected graph is collapsible. Denote D ₃(G) the set of vertices of degree 3 of graph G. For ${e = uv \in E(G)}$ , define d(e) = d(u) + d(v) ? 2 the edge degree of e, and ${\xi(G) = \min\{d(e) : e \in E(G)\}}$ . Denote by λ ^m (G) the m-restricted edge-connectivity of G. In this paper, we prove that a 3-edge-connected graph with ${\xi(G)\geq7}$ , and ${\lambda^3(G)\geq7}$ is collapsible; a 3-edge-connected simple graph with ${\xi(G)\geq7}$ , and ${\lambda^3(G)\geq6}$ is collapsible; a 3-edge-connected graph with ${\xi(G)\geq6}$ , ${\lambda^2(G)\geq4}$ , and ${\lambda^3(G)\geq6}$ with at most 24 vertices of degree 3 is collapsible; a 3-edge-connected simple graph with ${\xi(G)\geq6}$ , and ${\lambda^3(G)\geq5}$ with at most 24 vertices of degree 3 is collapsible; a 3-edge-connected graph with ${\xi(G)\geq5}$ , and ${\lambda^2(G)\geq4}$ with at most 9 vertices of degree 3 is collapsible. As a corollary, we show that a 4-connected line graph L(G) with minimum degree at least 5 and ${|D_3(G)|\leq9}$ is Hamiltonian.     

Congruence Properties of Binary Partition Functions

Let ${\mathcal{A}}$ be a finite subset of ${\mathbb{N}}$ containing 0, and let f (n) denote the number of ways to write n in the form ${\sum \varepsilon _{j}2^{j}}$ , where ${\varepsilon _{j} \epsilon \mathcal{A}}$ . We show that there exists a computable ${T = T (\mathcal{A})}$ so that the sequence (f (n) mod 2) is periodic with period T. Variations and generalizations of this problem are also discussed.     

An abstract setting for hamiltonian actions

In this paper we develop an abstract setup for hamiltonian group actions as follows: Starting with a continuous 2-cochain ω on a Lie algebra ${\mathfrak h}$ with values in an ${\mathfrak h}$ -module V, we associate subalgebras ${\mathfrak {sp}(\mathfrak h,\omega) \supseteq \mathfrak {ham}(\mathfrak h,\omega)}$ of symplectic, resp., hamiltonian elements. Then ${\mathfrak {ham}(\mathfrak h,\omega)}$ has a natural central extension which in turn is contained in a larger abelian extension of ${\mathfrak {sp}(\mathfrak h,\omega)}$ . In this setting, we study linear actions of a Lie group G on V which are compatible with a homomorphism ${\mathfrak g \to \mathfrak {ham}(\mathfrak h,\omega)}$ , i.e., abstract hamiltonian actions, corresponding central and abelian extensions of G and momentum maps ${J : \mathfrak g \to V}$ .     

Note on Group Distance Magic Graphs G[C 4]

A group distance magic labeling or a ${\mathcal{G}}$ -distance magic labeling of a graph G =  (V, E) with ${|V | = n}$ is a bijection f from V to an Abelian group ${\mathcal{G}}$ of order n such that the weight ${w(x) = \sum_{y\in N_G(x)}f(y)}$ of every vertex ${x \in V}$ is equal to the same element ${\mu \in \mathcal{G}}$ , called the magic constant. In this paper we will show that if G is a graph of order n =  2 ^p (2k + 1) for some natural numbers p, k such that ${\deg(v)\equiv c \mod {2^{p+1}}}$ for some constant c for any ${v \in V(G)}$ , then there exists a ${\mathcal{G}}$ -distance magic labeling for any Abelian group ${\mathcal{G}}$ of order 4n for the composition G[C ₄]. Moreover we prove that if ${\mathcal{G}}$ is an arbitrary Abelian group of order 4n such that ${\mathcal{G} \cong \mathbb{Z}_2 \times\mathbb{Z}_2 \times \mathcal{A}}$ for some Abelian group ${\mathcal{A}}$ of order n, then there exists a ${\mathcal{G}}$ -distance magic labeling for any graph G[C ₄], where G is a graph of order n and n is an arbitrary natural number.     

Scaling relationship between the copositive cone and Parrilo’s first level approximation

We investigate the relation between the cone ${\mathcal{C}^{n}}$ of n × n copositive matrices and the approximating cone ${\mathcal{K}_{n}^{1}}$ introduced by Parrilo. While these cones are known to be equal for n ≤ 4, we show that for n ≥ 5 they are not equal. This result is based on the fact that ${\mathcal{K}_{n}^{1}}$ is not invariant under diagonal scaling. We show that for any copositive matrix which is not the sum of a nonnegative and a positive semidefinite matrix we can find a scaling which is not in ${\mathcal{K}_{n}^{1}}$ . In fact, we show that if all scaled versions of a matrix are contained in ${\mathcal{K}_{n}^{r}}$ for some fixed r, then the matrix must be in ${\mathcal{K}_{n}^{0}}$ . For the 5 × 5 case, we show the more surprising result that we can scale any copositive matrix X into ${\mathcal{K}_{5}^{1}}$ and in fact that any scaling D such that ${(DXD)_{ii} \in \{0,1\}}$ for all i yields ${DXD \in \mathcal{K}_{5}^{1}}$ . From this we are able to use the cone ${\mathcal{K}_{5}^{1}}$ to check if any order 5 matrix is copositive. Another consequence of this is a complete characterisation of ${\mathcal{C}^{5}}$ in terms of ${\mathcal{K}_{5}^{1}}$ . We end the paper by formulating several conjectures.     

Graphs, partitions and classes of groups

If ${\mathfrak X}$ is a class of groups, Delizia et?al. (Bull Austral Math Soc 75:313–320, 2007) call a group G ${\mathfrak X}$ -transitive (or an ${\mathfrak XT}$ -group) if whenever ${\langle a,b\rangle}$ and ${\langle b,c\rangle}$ are in ${\mathfrak X} \langle a,c\rangle$ is also in ${\mathfrak X}$ ( ${a,b,c\in G}$ ). The structure of ${\mathfrak XT}$ -groups has been investigated for a number of classes of groups, by Delizia, Moravec and Nicotera and others. A graph can be associated with a group in many ways. Delizia, Moravec and Nicotera introduce a graph which is a generalisation of the commuting graph of a group, but do not make use of the graph. We will use the properties of the graph to investigate further classes of groups and to obtain more detailed structural information.     

Some results on metric n-Lie algebras

We study the structure of a metric n-Lie algebra G over the complex field C. Let G = SR be the Levi decomposition, where R is the radical of G and S is a strong semisimple subalgebra of G. Denote by m(G) the number of all minimal ideals of an indecomposable metric n-Lie algebra and R ⊥ the orthogonal complement of R. We obtain the following results. As S-modules, R ⊥ is isomorphic to the dual module of G/R. The dimension of the vector space spanned by all nondegenerate invariant symmetric bilinear forms on G is equal to that of the vector space of certain linear transformations on G; this dimension is greater than or equal to m(G) + 1. The centralizer of R in G is equal to the sum of all minimal ideals; it is the direct sum of R ⊥ and the center of G. Finally, G has no strong semisimple ideals if and only if R⊥■R.     

The Moduli Space of Riemann Surfaces of Large Genus

Let ${\mathcal{M}_{g,\epsilon}}$ be the ${\epsilon}$ -thick part of the moduli space ${\mathcal{M}_g}$ of closed genus g surfaces. In this article, we show that the number of balls of radius r needed to cover ${\mathcal{M}_{g,\epsilon}}$ is bounded below by ${(c_1g)^{2g}}$ and bounded above by ${(c_2g)^{2g}}$ , where the constants c ₁, c ₂depend only on ${\epsilon}$ and r, and in particular not on g. Using this counting result we prove that there are Riemann surfaces of arbitrarily large injectivity radius that are not close (in the Teichmüller metric) to a finite cover of a fixed closed Riemann surface. This result illustrates the sharpness of the Ehrenpreis conjecture.     

On the unique representation of very strong algebraic geometry codes

This paper addresses the question of retrieving the triple ${(\mathcal X,\mathcal P, E)}$ from the algebraic geometry code ${\mathcal C = \mathcal C_L(\mathcal X, \mathcal P, E)}$ , where ${\mathcal X}$ is an algebraic curve over the finite field ${\mathbb F_q, \,\mathcal P}$ is an n-tuple of ${\mathbb F_q}$ -rational points on ${\mathcal X}$ and E is a divisor on ${\mathcal X}$ . If ${\deg(E)\geq 2g+1}$ where g is the genus of ${\mathcal X}$ , then there is an embedding of ${\mathcal X}$ onto ${\mathcal Y}$ in the projective space of the linear series of the divisor E. Moreover, if ${\deg(E)\geq 2g+2}$ , then ${I(\mathcal Y)}$ , the vanishing ideal of ${\mathcal Y}$ , is generated by ${I_2(\mathcal Y)}$ , the homogeneous elements of degree two in ${I(\mathcal Y)}$ . If ${n >2 \deg(E)}$ , then ${I_2(\mathcal Y)=I_2(\mathcal Q)}$ , where ${\mathcal Q}$ is the image of ${\mathcal P}$ under the map from ${\mathcal X}$ to ${\mathcal Y}$ . These three results imply that, if ${2g+2\leq m < \frac{1}{2}n}$ , an AG representation ${(\mathcal Y, \mathcal Q, F)}$ of the code ${\mathcal C}$ can be obtained just using a generator matrix of ${\mathcal C}$ where ${\mathcal Y}$ is a normal curve in ${\mathbb{P}^{m-g}}$ which is the intersection of quadrics. This fact gives us some clues for breaking McEliece cryptosystem based on AG codes provided that we have an efficient procedure for computing and decoding the representation obtained.     

Nielsen coincidence,fixed point and root theories of n-valued maps

Let ${(\phi, \psi)}$ be an (m, n)-valued pair of maps ${\phi, \psi : X \multimap Y}$ , where ${\phi}$ is an m-valued map and ${\psi}$ is n-valued, on connected finite polyhedra. A point ${x \in X}$ is a coincidence point of ${\phi}$ and ${\psi}$ if ${\phi(x) \cap \psi(x) \neq \emptyset}$ . We define a Nielsen coincidence number ${N(\phi : \psi)}$ which is a lower bound for the number of coincidence points of all (m, n)-valued pairs of maps homotopic to ${(\phi, \psi)}$ . We calculate ${N(\phi : \psi)}$ for all (m, n)-valued pairs of maps of the circle and show that ${N(\phi : \psi)}$ is a sharp lower bound in that setting. Specifically, if ${\phi}$ is of degree a and ${\psi}$ of degree b, then ${N(\phi : \psi) = \frac{|an - bm|}{\langle m, n \rangle}}$ , where ${\langle m, n \rangle}$ is the greatest common divisor of m and n. In order to carry out the calculation, we obtain results, of independent interest, for n-valued maps of compact connected Lie groups that relate the Nielsen fixed point number of Helga Schirmer to the Nielsen root number of Michael Brown.     

Biased tug-of-war, the biased infinity Laplacian, and comparison with exponential cones

We prove that if ${U\subset \mathbb {R}^n}$ is an open domain whose closure ${\overline U}$ is compact in the path metric, and F is a Lipschitz function on ?U, then for each ${\beta \in \mathbb {R}}$ there exists a unique viscosity solution to the β-biased infinity Laplacian equation $$\beta |\nabla u| + \Delta_\infty u=0$$ on U that extends F, where ${\Delta_\infty u= |\nabla u|^{-2} \sum_{i,j} u_{x_i}u_{x_ix_j} u_{x_j}}$ . In the proof, we extend the tug-of-war ideas of Peres, Schramm, Sheffield and Wilson, and define the β-biased ${\epsilon}$ -game as follows. The starting position is ${x_0 \in U}$ . At the kth step the two players toss a suitably biased coin (in our key example, player I wins with odds of ${\exp(\beta\epsilon)}$ to 1), and the winner chooses x _k with ${d(x_k,x_{k-1}) < \epsilon}$ . The game ends when ${x_k \in \partial U}$ , and player II pays the amount F(x _k ) to player I. We prove that the value ${u^{\epsilon}(x_0)}$ of this game exists, and that ${\|u^\epsilon - u\|_\infty \to 0}$ as ${\epsilon \to 0}$ , where u is the unique extension of F to ${\overline{U}}$ that satisfies comparison with β-exponential cones. Comparison with exponential cones is a notion that we introduce here, and generalizing a theorem of Crandall, Evans and Gariepy regarding comparison with linear cones, we show that a continuous function satisfies comparison with β-exponential cones if and only if it is a viscosity solution to the β-biased infinity Laplacian equation.     

Diagram Groupoids and von Neumann Algebras

The main purpose of this paper is to study certain algebraic structures induced by directed graphs. We have studied graph groupoids, which are algebraic structures induced by given graphs. By defining a certain groupoid-homomorphism ?? on the graph groupoid ${\mathbb{G}}$ of a given graph G, we define the diagram of G by the image ${\delta(\mathbb{G})}$ of ??, equipped with the inherited binary operation on ${\mathbb{G}}$ . We study the fundamental properties of the diagram ${\delta(\mathbb{G})}$ , and compare them with those of ${\mathbb{G}}$ . Similar to Cho (Acta Appl Math 95:95?C134, 2007), we construct the groupoid von Neumann algebra ${\mathcal{M}_{G}=vN(\delta(\mathbb{G}))}$ , generated by ${\delta(\mathbb{G})}$ , and consider the operator algebraic properties of ${\mathcal{M}_{G}}$ . In particular, we show ${\mathcal{M}_{G}}$ is *-isomorphic to a von Neumann algebra generated by a family of idempotent operators and nilpotent operators, under suitable representations.     

Creature forcing and large continuum: the joy of halving

For ${f,g\in\omega^\omega}$ let ${c^\forall_{f,g}}$ be the minimal number of uniform g-splitting trees needed to cover the uniform f-splitting tree, i.e., for every branch ν of the f-tree, one of the g-trees contains ν. Let ${c^\exists_{f,g}}$ be the dual notion: For every branch ν, one of the g-trees guesses ν(m) infinitely often. We show that it is consistent that ${c^\exists_{f_\epsilon,g_\epsilon}{=}c^\forall_{f_\epsilon,g_\epsilon}{=}\kappa_\epsilon}$ for continuum many pairwise different cardinals ${\kappa_\epsilon}$ and suitable pairs ${(f_\epsilon,g_\epsilon)}$ . For the proof we introduce a new mixed-limit creature forcing construction.     

The Linear t-Colorings of Sierpiński-Like Graphs

A proper t-coloring of a graph G is a mapping ${\varphi: V(G) \rightarrow [1, t]}$ such that ${\varphi(u) \neq \varphi(v)}$ if u and v are adjacent vertices, where t is a positive integer. The chromatic number of a graph G, denoted by ${\chi(G)}$ , is the minimum number of colors required in any proper coloring of G. A linear t-coloring of a graph is a proper t-coloring such that the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number of a graph G, denoted by ${lc(G)}$ , is the minimum t such that G has a linear t-coloring. In this paper, the linear t-colorings of Sierpiński-like graphs S(n, k), ${S^+(n, k)}$ and ${S^{++}(n, k)}$ are studied. It is obtained that ${lc(S(n, k))= \chi (S(n, k)) = k}$ for any positive integers n and k, ${lc(S^+(n, k)) = \chi(S^+(n, k)) = k}$ and ${lc(S^{++}(n, k)) = \chi(S^{++}(n, k)) = k}$ for any positive integers ${n \geq 2}$ and ${k \geq 3}$ . Furthermore, we have determined the number of paths and the length of each path in the subgraph induced by the union of any two color classes completely.     

Circular Coloring of Planar Digraphs

Let D be a digraph. The circular chromatic number ${\chi_c(D)}$ and chromatic number ${\chi(D)}$ of D were proposed recently by Bokal et?al. Let ${\vec{\chi_c}(G)={\rm max}\{\chi_c(D)| D\, {\rm is\, an\, orientation\, of} G\}}$ . Let G be a planar graph and n?≥ 2. We prove that if the girth of G is at least ${\frac{10n-5}{3},}$ then ${\vec{\chi_c}(G)\leq \frac{n}{n-1}}$ . We also study the circular chromatic number of some special planar digraphs.     

Chromatic Gallai identities operating on Lovász number

If $G$ is a triangle-free graph, then two Gallai identities can be written as $\alpha (G)+\overline{\chi }(L(G))=|V(G)|=\alpha (L(G))+\overline{\chi }(G)$ , where $\alpha $ and $\overline{\chi }$ denote the stability number and the clique-partition number, and $L(G)$ is the line graph of  $G$ . We show that, surprisingly, both equalities can be preserved for any graph $G$ by deleting the edges of the line graph corresponding to simplicial pairs of adjacent arcs, according to any acyclic orientation of  $G$ . As a consequence, one obtains an operator $\Phi $ which associates to any graph parameter $\beta $ such that $\alpha (G) \le \beta (G) \le \overline{\chi }(G)$ for all graph $G$ , a graph parameter $\Phi _\beta $ such that $\alpha (G) \le \Phi _\beta (G) \le \overline{\chi }(G)$ for all graph $G$ . We prove that $\vartheta (G) \le \Phi _\vartheta (G)$ and that $\Phi _{\overline{\chi }_f}(G)\le \overline{\chi }_f(G)$ for all graph  $G$ , where $\vartheta $ is Lovász theta function and $\overline{\chi }_f$ is the fractional clique-partition number. Moreover, $\overline{\chi }_f(G) \le \Phi _\vartheta (G)$ for triangle-free $G$ . Comparing to the previous strengthenings $\Psi _\vartheta $ and $\vartheta ^{+ \triangle }$ of $\vartheta $ , numerical experiments show that $\Phi _\vartheta $ is a significant better lower bound for $\overline{\chi }$ than $\vartheta $ .