Related papers: Pythagorean triangles within Pythagorean triangles

Much of the past work on asynchronous approximate Byzantine consensus has assumed scalar inputs at the nodes [4, 8]. Recent work has yielded approximate Byzantine consensus algorithms for the case when the input at each node is a…

Within the perturbative QCD (PQCD) framework, we present a systematic investigation of charmless $B_s \to SP$ decays, where $S$ and $P$ denote scalar and pseudoscalar mesons, respectively. By employing two distinct structural scenarios for…

For a polyhedron $P$ in $\mathbb{R}^d$, denote by $|P|$ its combinatorial complexity, i.e., the number of faces of all dimensions of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so…

We investigate allowed regions in observable space of B --> pi K, B_d --> pi^+pi^- and B_s --> K^+K^- decays, characterizing these modes in the Standard Model. After a discussion of a new kind of contour plots for the $B\to\pi K$ system, we…

Recently, the LHCb and CDF collaborations reported a surprisingly large difference between the direct CP asymmetries, Delta A_CP, in the D0 -> K+ K- and D0 -> pi+ pi- decay modes. An interesting question is whether this measurement can be…

In this paper we characterise cone points of arbitrary subsets of Euclidean space. Given $E \subset \mathbb{R}^n$, $x \in E$ is a cone point of $E$ if and only if \begin{align*} \int_{0}^1 \beta_{E}^{d,2}(B(x,r))^2 \frac{dr}{r} < \infty,…

Let $Q$ be a finite set of points in the plane. For any set $P$ of points in the plane, $S_{Q}(P)$ denotes the number of similar copies of $Q$ contained in $P$. For a fixed $n$, Erd\H{o}s and Purdy asked to determine the maximum possible…

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal cases) we present a detailed proof of the following results [12]: (i) $D$ contains…

We show that the angle $\alpha_{ds}$ of the ``flattest'' unitarity triange can be directly measured using the decays $\overline{B}_{d}\to \phi \overline{K}^{(*)0}$ and $\overline{B}_{s}\to \phi{K}^{(*)0}$. Using both $\overline{B}_{d}$ and…

A Pythagorean n-tuple is an integer solution of x_1^2+...+x_{n-1}^2=x_n^2. For n=4 and n=6, the Pythagorean n-tuples admit a parametrization by a single n-tuple of polynomials with integer coefficients (which is impossible for n=3). For…

Using a sample of $(225.2\pm 2.8)\times 10^6$ $J/\psi$ events collected with the Beijing Spectrometer (BESIII) at the Beijing Electron-Positron Collider, CP and $P$ violating decays of $\eta$, $\eta'$ and $\etac$ into $\pi^+\pi^-$ and…

Let $S\subset \mathbb{R}^d$ $(d\geq 2)$. A set $S$ is said to be $m$-point convex, if for every $m$ distinct points in $S$, at least one of the line-segments determined by them lies in $S$. We also say that $S$ has property $P_m$. Let…

We study triangles $ABC$ and points $P$ for which the generalized orthocenter $H$ corresponding to $P$ coincides with a vertex $A,B$, or $C$. The set of all such points $P$ is a union of three ellipses minus $6$ points. In addition, if…

A metric polygon is a metric space comprised of a finite number of closed intervals joined cyclically. The second-named author and Ntalampekos recently found a method to bi-Lipschitz embed an arbitrary metric triangle in the Euclidean plane…

We have searched for CP violation in the decays $D^0\rightarrow K^0_S P^0$ where $P^0$ denotes a neutral pseudo-scalar meson which is either a $\pi^0$, $\eta$, or $\eta'$ using KEKB asymmetric-energy $e^+e^-$ collision data corresponding to…

Let $D$ be a digraph. A stable set $S$ of $D$ and a path partition $\mathcal{P}$ of $D$ are orthogonal if every path $P \in \mathcal{P}$ contains exactly one vertex of $S$. In 1982, Berge defined the class of $\alpha$-diperfect digraphs. A…

Ptolemy's inequality is a classic relationship between the distances among four points in Euclidean space. Another relationship between six distances is the 4-point condition, an inequality satisfied by the lengths of the six paths that…

Let $G$ be a connected graph. The eccentricity of a path $P$, denoted by ecc$_G(P)$, is the maximum distance from $P$ to any vertex in $G$. In the \textsc{Central path} (CP) problem our aim is to find a path of minimum eccentricity. This…

Triple product asymmetries have been used to probe CP violation in $K$, $D$, and B decays. Here we review the interpretation of those asymmetries, and note that it is possible to construct twelve measurable triple product asymmetries for…

A geometric figure is a reptile if it can be dissected into at least two similar copies congruent to each other. We prove that if a trapezoid is a reptile and not a parallelogram, then the length of each base is a linear combination of the…