Related papers: Light Spanners with Small Hop-Diameter
A complete analysis of the electroweak precision observables is performed within a recently proposed minimal composite Higgs model, realized as a 5-dimensional warped compactification. In particular, we compute Z->bb and the one-loop…
In this paper, we develop a rigorous mathematical framework for the optimization of hip roof house geometry, with the primary goal of minimizing the external surface of the building envelope for a given set of design constraints. Five…
The wear-free sliding of layers or flakes of graphene-like 2D materials, important in many experimental systems, may occur either smoothly or through stick-slip, depending on driving conditions, corrugation, twist angles, as well as edges…
We observe a narrow peaking structure in the $pK^{-}$ invariant-mass spectrum near the $\Lambda\eta$ threshold. The peak is clearly seen in 1.5 million events of $\Lambda_{c}^{+} \rightarrow p K^{-} \pi^{+}$ decay using the $980~{\rm…
Let $G$ be an unweighted, undirected graph. An additive $k$-spanner of $G$ is a subgraph $H$ that approximates all distances between pairs of nodes up to an additive error of $+k$, that is, it satisfies $d_H(u,v) \le d_G(u,v)+k$ for all…
Light stops are a hallmark of the most natural realizations of weak-scale supersymmetry. While stops have been extensively searched for, there remain open gaps around and below the top mass, due to similarities of stop and top signals with…
We optimized micro-holes in a thin slab for fast Si photodetectors at wavelength 800-950nm. Lateral modes are shown to be responsible for the effective light trapping. Small disorder and cone hole shapes helped achieve uniform quantum…
We consider the problem of designing sublinear time algorithms for estimating the cost of a minimum metric traveling salesman (TSP) tour. Specifically, given access to a $n \times n$ distance matrix $D$ that specifies pairwise distances…
We study graph spanners for point-set in the high-dimensional Euclidean space. On the one hand, we prove that spanners with stretch <\sqrt{2} and subquadratic size are not possible, even if we add Steiner points. On the other hand, if we…
We show an algorithm that, given an $n$-vertex graph $G$ and a parameter $k$, in time $2^{O(k \log k)} n^{O(1)}$ finds a tree decomposition of $G$ with the following properties: * every adhesion of the tree decomposition is of size at most…
We construct a minimal model within the general class of Pyramid Schemes, which is consistent with both supersymmetry breaking and electroweak symmetry breaking. In order to do computations, we make unjustified approximations to the low…
Compressive sensing aims to recover a high-dimensional sparse signal from a relatively small number of measurements. In this paper, a novel design of the measurement matrix is proposed. The design is inspired by the construction of…
Given a weighted undirected graph $G=(V,E,w)$, a hopset $H$ of hopbound $\beta$ and stretch $(1+\epsilon)$ is a set of edges such that for any pair of nodes $u, v \in V$, there is a path in $G \cup H$ of at most $\beta$ hops, whose length…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$. We say that $G$ is an $f$-fault-tolerant $t$-spanner for $H$, if the following is true for any subset $F$ of at most $f$ edges of $G$: For any two vertices $p$ and $q$,…
Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…
We describe a family of locally conformal Kaehler metrics on class 1 Hopf surfaces H containing some recent metrics constructed by P. Gauduchon and L. ornea. We study some canonical foliations associated to these metrics, in particular a…
The sparse Johnson-Lindenstrauss transform is one of the central techniques in dimensionality reduction. It supports embedding a set of $n$ points in $\mathbb{R}^d$ into $m=O(\varepsilon^{-2} \lg n)$ dimensions while preserving all pairwise…
The weighted star discrepancy of point sets appears in the weighted Koksma-Hlawka inequality and thus is a measure for the quality of point sets with respect to their performance in quasi-Monte Carlo algorithms. A special choice of point…
The optical conductivity $\sigma(\omega )$ of a doped two-leg t--J ladder is calculated for an electric field polarized parallel to the legs of the ladder. The conductivity has a Drude weight proportional to the hole doping and an apparent…