Discovery potential of Higgs boson pair production through 4ℓ\ell+E ⁣ ⁣/E\!\!/ final states at a 100 TeV collider

We explore the discovery potential of Higgs pair production at a 100 TeV collider via full leptonic mode. The same mode can be explored at the LHC when Higgs pair production is enhanced by new physics. We examine two types of fully leptonic final states and propose a partial reconstruction method. The reconstruction method can reconstruct some kinematic observables. It is found that the $m_{T2}$ variable determined by this reconstruction method and the reconstructed visible Higgs mass are important and crucial to discriminate the signal and background events. It is also noticed that a new variable, denoted as $\Delta m$ which is defined as the mass difference of two possible combinations, is very useful as a discriminant. We also investigate the interplay between the direct measurements of $t\bar{t} h$ couplings and other related couplings and trilinear Higgs coupling at hadron colliders and electron-positron colliders

Stability Analysis of Integral Delay Systems with Multiple Delays

This note is concerned with stability analysis of integral delay systems with multiple delays. To study this problem, the well-known Jensen inequality is generalized to the case of multiple terms by introducing an individual slack weighting matrix for each term, which can be optimized to reduce the conservatism. With the help of the multiple Jensen inequalities and by developing a novel linearizing technique, two novel Lyapunov functional based approaches are established to obtain sufficient stability conditions expressed by linear matrix inequalities (LMIs). It is shown that these new conditions are always less conservative than the existing ones. Moreover, by the positive operator theory, a single LMI based condition and a spectral radius based condition are obtained based on an existing sufficient stability condition expressed by coupled LMIs. A numerical example illustrates the effectiveness of the proposed approaches.Comment: 14 page

Note on minimally kk-rainbow connected graphs

An edge-colored graph $G$, where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct colors. A graph $G$ is {\it $k$-rainbow connected} if one can use $k$ colors to make $G$ rainbow connected. For integers $n$ and $d$ let $t(n,d)$ denote the minimum size (number of edges) in $k$-rainbow connected graphs of order $n$. Schiermeyer got some exact values and upper bounds for $t(n,d)$. However, he did not get a lower bound of $t(n,d)$ for $3\leq d<\lceil\frac{n}{2}\rceil$. In this paper, we improve his lower bound of $t(n,2)$, and get a lower bound of $t(n,d)$ for $3\leq d<\lceil\frac{n}{2}\rceil$.Comment: 8 page

Graphs with 3-rainbow index n−1n-1 and n−2n-2

Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\rightarrow \{1,2,\ldots,q\},$ $q\in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color. For a vertex set $S\subseteq V(G)$, the tree connecting $S$ in $G$ is called an $S$-tree. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for each $k$-set $S$ of $V(G)$ is called the $k$-rainbow index of $G$, denoted by $rx_k(G)$. In \cite{Zhang}, they got that the $k$-rainbow index of a tree is $n-1$ and the $k$-rainbow index of a unicyclic graph is $n-1$ or $n-2$. So there is an intriguing problem: Characterize graphs with the $k$-rainbow index $n-1$ and $n-2$. In this paper, we focus on $k=3$, and characterize the graphs whose 3-rainbow index is $n-1$ and $n-2$, respectively.Comment: 14 page

Note on the upper bound of the rainbow index of a graph

A path in an edge-colored graph $G$, where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the minimum number of colors that are needed to color the edges of $G$ such that there exists a rainbow path connecting every two vertices of $G$. Similarly, a tree in $G$ is a rainbow~tree if no two edges of it receive the same color. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow tree connecting $S$ for each $k$-subset $S$ of $V(G)$ is called the $k$-rainbow index of $G$, denoted by $rx_k(G)$, where $k$ is an integer such that $2\leq k\leq n$. Chakraborty et al. got the following result: For every $\epsilon> 0$, a connected graph with minimum degree at least $\epsilon n$ has bounded rainbow connection, where the bound depends only on $\epsilon$. Krivelevich and Yuster proved that if $G$ has $n$ vertices and the minimum degree $\delta(G)$ then $rc(G)<20n/\delta(G)$. This bound was later improved to $3n/(\delta(G)+1)+3$ by Chandran et al. Since $rc(G)=rx_2(G)$, a natural problem arises: for a general $k$ determining the true behavior of $rx_k(G)$ as a function of the minimum degree $\delta(G)$. In this paper, we give upper bounds of $rx_k(G)$ in terms of the minimum degree $\delta(G)$ in different ways, namely, via Szemer\'{e}di's Regularity Lemma, connected $2$-step dominating sets, connected $(k-1)$-dominating sets and $k$-dominating sets of $G$.Comment: 12 pages. arXiv admin note: text overlap with arXiv:0902.1255 by other author