Results 31 to 40 of about 1,566,979 (286)
Communications in Mathematical Physics, 1978 The authors describe their method for counting planar Feynman diagrams of quantum field theory. Mathematicians who are not familiar with the current jargon of quantum field theory are likely to find this paper rather difficult to follow. In order to demonstrate the usefulness of their method, the authors calculate the ground state energy of a system of
Brézin, E. +3 more
openaire +3 more sources
Planar Earthmover is not in L_1 [PDF]
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006 We show that any $L_1$ embedding of the transportation cost (a.k.a. Earthmover) metric on probability measures supported on the grid $\{0,1,...,n\}^2\subseteq \R^2$ incurs distortion $Ω(\sqrt{\log n})$. We also use Fourier analytic techniques to construct a simple $L_1$ embedding of this space which has distortion $O(\log n)$.
Assaf Naor, Gideon Schechtman
openaire +2 more sources
, 2018 We study excitations of LLM geometries. These geometries arise from the backreaction of a condensate of giant gravitons. Excitations of the condensed branes are open strings, which give rise to an emergent Yang-Mills theory at low energy.
Huang, Jia-Hui +2 more
core +1 more source
Efficient enhancements in spectral domain method to speed up open planar circuit analysis [PDF]
, 1998 The spectral domain method is a very fast and powerful technique to analyse planar microwave circuits. Available techniques for simulating the excitation of open planar microwave circuits are not very effective at relatively low frequencies.
Balik, HH, Railton, CJ
core +2 more sources
Nature Communications, 2018 Even though the mesoporous-type perovskite solar cell (PSC) is known for high efficiency, its planar-type counterpart exhibits lower efficiency and hysteretic response.
Dong Yang +9 more
semanticscholar +1 more source
, 2017 We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with nice convex drawings: outer $k$-planar graphs, where each edge is crossed by at
AWM Dress +23 more
core +1 more source
Morphing Planar Graph Drawings Optimally [PDF]
, 2014 We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound.
C. Erten +10 more
core +1 more source
Theoretical Computer Science, 2018 We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is motivated by applications in edge casing, as a $k$-gap-planar graph can be drawn crossing-free after introducing ...
Sang Won Bae 0001 +10 more
openaire +5 more sources
On flips in planar matchings [PDF]
Discrete Applied Mathematics, 2020 In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in the plane. Specifically, consider all non-crossing straight-line perfect matchings on a set of $2n$ points that are placed equidistantly on the unit circle. A flip operation on such a matching replaces two matching edges that span an empty quadrilateral with ...
Marcel Milich +2 more
openaire +3 more sources
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source