60,486 research outputs found
Discovery potential of Higgs boson pair production through 4+ 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 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 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 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 -rainbow connected graphs
An edge-colored graph , where adjacent edges may have the same color, is
{\it rainbow connected} if every two vertices of are connected by a path
whose edge has distinct colors. A graph is {\it -rainbow connected} if
one can use colors to make rainbow connected. For integers and
let denote the minimum size (number of edges) in -rainbow connected
graphs of order . Schiermeyer got some exact values and upper bounds for
. However, he did not get a lower bound of for . In this paper, we improve his lower bound of
, and get a lower bound of for .Comment: 8 page
Graphs with 3-rainbow index and
Let be a nontrivial connected graph with an edge-coloring
, where adjacent edges
may be colored the same. A tree in is a if no two edges
of receive the same color. For a vertex set , the tree
connecting in is called an -tree. The minimum number of colors that
are needed in an edge-coloring of such that there is a rainbow -tree for
each -set of is called the -rainbow index of , denoted by
. In \cite{Zhang}, they got that the -rainbow index of a tree is
and the -rainbow index of a unicyclic graph is or . So
there is an intriguing problem: Characterize graphs with the -rainbow index
and . In this paper, we focus on , and characterize the graphs
whose 3-rainbow index is and , respectively.Comment: 14 page
Note on the upper bound of the rainbow index of a graph
A path in an edge-colored graph , 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 , denoted by , is the
minimum number of colors that are needed to color the edges of such that
there exists a rainbow path connecting every two vertices of . Similarly, a
tree in 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 such that
there is a rainbow tree connecting for each -subset of is
called the -rainbow index of , denoted by , where is an
integer such that . Chakraborty et al. got the following result:
For every , a connected graph with minimum degree at least
has bounded rainbow connection, where the bound depends only on
. Krivelevich and Yuster proved that if has vertices and the
minimum degree then . This bound was later
improved to by Chandran et al. Since , a
natural problem arises: for a general determining the true behavior of
as a function of the minimum degree . In this paper, we
give upper bounds of in terms of the minimum degree in
different ways, namely, via Szemer\'{e}di's Regularity Lemma, connected
-step dominating sets, connected -dominating sets and -dominating
sets of .Comment: 12 pages. arXiv admin note: text overlap with arXiv:0902.1255 by
other author
- …