2,172 research outputs found
LHC 750 GeV diphoton excess and muon
We consider implications of the diphoton excess recently observed at the LHC
on the anomalous magnetic dipole moment of the muon ,
hypothesizing that the possible 750 GeV resonance is a (pseudo)scalar particle.
The (pseudo)scalar-- interaction implied by the diphoton events
might generically contribute to via 2-loop Barr-Zee type diagrams in a
broad class of models. If the scalar is an singlet, the new
contribution to is much smaller than the current anomaly, ,
since the scalar can complete the Barr-Zee diagrams only through its mixing
with the Standard Model Higgs boson. If the (pseudo)scalar belongs to an
doublet in an extended Higgs sector, then by contrast,
can be easily accommodated with the aid of an enhanced Yukawa coupling of the
(pseudo)scalar to the muon such as in the Type-II or -X two Higgs doublet
model.Comment: 16 pages, added discussions about UV completions with vector-like
fermions as well as consequences for heavy Higgs searches and B-physics,
journal versio
Reconfiguring Graph Homomorphisms on the Sphere
Given a loop-free graph , the reconfiguration problem for homomorphisms to
(also called -colourings) asks: given two -colourings of of a
graph , is it possible to transform into by a sequence of
single-vertex colour changes such that every intermediate mapping is an
-colouring? This problem is known to be polynomial-time solvable for a wide
variety of graphs (e.g. all -free graphs) but only a handful of hard
cases are known. We prove that this problem is PSPACE-complete whenever is
a -free quadrangulation of the -sphere (equivalently, the plane)
which is not a -cycle. From this result, we deduce an analogous statement
for non-bipartite -free quadrangulations of the projective plane. This
include several interesting classes of graphs, such as odd wheels, for which
the complexity was known, and -chromatic generalized Mycielski graphs, for
which it was not.
If we instead consider graphs and with loops on every vertex (i.e.
reflexive graphs), then the reconfiguration problem is defined in a similar way
except that a vertex can only change its colour to a neighbour of its current
colour. In this setting, we use similar ideas to show that the reconfiguration
problem for -colourings is PSPACE-complete whenever is a reflexive
-free triangulation of the -sphere which is not a reflexive triangle.
This proof applies more generally to reflexive graphs which, roughly speaking,
resemble a triangulation locally around a particular vertex. This provides the
first graphs for which -Recolouring is known to be PSPACE-complete for
reflexive instances.Comment: 22 pages, 9 figure
Business Groups and Tunneling: Evidence from Private Securities Offerings by Korean Chaebols
Using a comprehensive sample of equity-linked private securities offerings by Korean firms from 1989 to 2000, we examine whether such offerings can be used as a mechanism for wealth transfer between issuers and acquirers. For deals involving issuers and acquirers in the same business group (chaebol), the announcement returns for chaebol-affiliated issuers with good past performance are lower than those for other types of issuers if the price discount is larger. In contrast, this deal leads to more value creation for chaebol-affiliated acquirers than other types of acquirers. Furthermore, well-performing chaebol-affiliated acquirers experience a larger wealth loss than other types of acquirers if they buy securities from poorly performing issuers in the same chaebol. We also find that chaebol firms with good past performance tend to sell private securities at a low price to their member firms. This evidence is consistent with tunneling within business groups.
Disconnected Common Graphs via Supersaturation
A graph is said to be common if the number of monochromatic labelled
copies of in a -colouring of the edges of a large complete graph is
asymptotically minimized by a random colouring. It is well known that the
disjoint union of two common graphs may be uncommon; e.g., and are
common, but their disjoint union is not. We investigate the commonality of
disjoint unions of multiple copies of and . As a consequence of our
results, we obtain an example of a pair of uncommon graphs whose disjoint union
is common. Our approach is to reduce the problem of showing that certain
disconnected graphs are common to a constrained optimization problem in which
the constraints are derived from supersaturation bounds related to Razborov's
Triangle Density Theorem. We also improve bounds on the Ramsey multiplicity
constant of a triangle with a pendant edge and the disjoint union of and
.Comment: 31 page
Preservice Teachers’ Algebraic Reasoning and Symbol Use on a Multistep Fraction Word Problem
Previous research on preservice teachers’ understanding of fractions and algebra has focused on one or the other. To extend this research, we examined 85 undergraduate elementary education majors and middle school mathematics education majors’ solutions and solution paths (i.e., the ways or methods in which preservice teachers solve word problems) when combining fractions with algebra on a multistep word problem. In this article, we identify and describe common strategy clusters and approaches present in the preservice teachers’ written work. Our results indicate that preservice teachers’ understanding of algebra include arithmetic methods, proportions, and is related to their understanding of a whole
- …