Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “vertex”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Matter couplings and equivalence principles for soft scalars

Scalar effective field theories with enhanced soft limits behave in many ways like gauge theories and gravity. In particular, symmetries fix the structure of interactions and the tree-level S-matrix in both types of theories. We explore how this analogy persists in the presence of matter by considering theories with additional fields coupled to the Dirac-Born-Infeld (DBI) scalar or the special galileon in a way that is consistent with their symmetries. Using purely on-shell arguments, we show that these theories obey analogues of the S-matrix equivalence principle whereby all matter fields must couple to the DBI scalar or the special galileon through a particular quartic vertex with a universal coupling. These equivalence principles imply the universality of the leading double soft theorems in these theories, which are scalar analogues of Weinberg’s gravitational soft theorem, and can be used to rule out interactions with massless higher-spin fields when combined with analogues of the generalized Weinberg-Witten theorem. We verify in several examples that amplitudes with external matter fields nontrivially exhibit enhanced single soft limits and we show that such amplitudes can be constructed using soft recursion relations when they have sufficiently many external DBI or special galileon legs, including amplitudes with massive higher-spin fields. As part of our analysis we construct a recently conjectured special galileon-vector effective field theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A duality in string theory on AdS 3

We consider bosonic string theory on AdS 3 supported by Kalb-Ramond flux. It is well known that the α' exact worldsheet theory is described by the SL(2,R) WZW model. In this note we perform checks of an α' exact dual description proposed in [arXiv:2104.07233] involving a winding condensate on a free theory background. We give the explicit map of vertex operators for normalizable states on both sides of the duality and demonstrate the equivalence of their two and three point functions by direct computation. The duality is of strong-weak nature in α' .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Search for the pair production of long-lived supersymmetric partners of the tau lepton in proton-proton collisions at $\sqrt{s}=13$ TeV

Gauge-mediated supersymmetry-breaking models provide a strong motivation to search for a supersymmetric partner of the tau lepton (stau) with a macroscopic lifetime. Long-lived stau decays produce tau leptons that are displaced from the primary proton-proton interaction vertex, leading to an unconventional signature. This paper presents a search for the direct production of long-lived staus decaying within the CMS tracker volume in proton-proton collisions at $\sqrt{s}=13$ TeV, performed for the first time with an identification algorithm based on a graph neural network dedicated to displaced tau leptons. The data sample, corresponding to an integrated luminosity of 138 fb −1 , was recorded with the CMS experiment at the CERN LHC between 2016 and 2018. This search excludes, at 95% confidence level, stau masses, m~ τ , in the 126–260 (90–425) GeV range for a proper decay length of 50 mm in the maximally mixed (mass-degenerate) scenario, while for m~ τ = 200 GeV, stau proper decay lengths are excluded in the range 21–94 (6–333) mm. These results improve the exclusion limits compared to previous searches, and extend the parameter space explored in the context of supersymmetry.

Hadron-Hadron Scattering↗
DOE OSTI2022

Solvable time-like cosets and holography beyond AdS

We build a novel time-like coset sigma-model describing type-II superstring theory in a charged rotating black-brane background that interpolates between a local AdS 3 in the IR and a linear-dilaton geometry in the UV. This allows one to peform a systematic study of holography in non-AdS backgrounds which are smoothly connected to AdS 3 . We construct massless closed string states vertex operators in the NS-NS sector, calculate the corresponding two-point correlation functions, and discuss holographic interpretation of our results from 4+1 dimensional boundary field theory point of view. Compactifying the theory on T 4 , we show that the spectrum of a single long string with unit winding agrees with the spectrum of a CFT 2 deformed by TT¯. We also calculate correlation functions of operators of the dual 1+1 dimensional non-conformal boundary field theory using worldsheet techniques.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Orientation reversal and the Chern-Simons natural boundary

We show that the fundamental property of preservation of relations, underlying resurgent analysis, provides a new perspective on crossing a natural boundary, an important general problem in theoretical and mathematical physics. This reveals a deeper rigidity aspect of resurgence in a quantum field theory path integral. The physical context here is the non-perturbative completion of complex Chern-Simons theory that associates to a 3-manifold a collection of q-series invariants labeled by Spinc structures, for which crossing the natural boundary corresponds to orientation reversal of the 3-manifold. Our new resurgent perspective leads to a practical numerical algorithm that generates q-series which are dual to unary q-series composed of false theta functions. Until recently, these duals were only known in a limited number of cases, essentially based on Ramanujan’s mock theta functions, and the common belief was that the duals might not even exist in the general case. Resurgence analysis identifies as primary objects Mordell integrals: up to changes of variables, they are Laplace transforms of resurgent functions. Their unique Borel summed transseries decomposition on either side of the Stokes line is simply the unique decomposition into real and imaginary parts. In turn, the latter are combinations of unary q-series in terms of q and its modular counterpart $\overset{\sim }{q}$ , and are resurgent by construction. The Mordell integral is analytic across the natural boundary of the q and $\overset{\sim }{q}$ series, and uniqueness of a similar decomposition which preserves algebraic relations on the other side of the boundary defines the unique boundary crossing of the q series. We demonstrate that this continuation can be efficiently implemented numerically. In the cases where unique mock modular identities are known, they are found by this numerical procedure, but the procedure can go well beyond the known list of identities. A particularly interesting feature of the resurgent approach is that it reveals new aspects, and is very different from other known approaches based on indefinite theta series, Appell-Lerch sums, and representation theory of logarithmic vertex operator algebras.

Chern-Simons theories↗
DOE OSTI2026

Measurement of the Zγ production cross section and search for anomalous neutral triple gauge couplings in pp collisions at $ \sqrt{s}=13 $ TeV

A measurement of the fiducial cross section of the associated production of a Z boson and a high-p$_{T}$ photon, where the Z decays to two neutrinos, and a search for anomalous triple gauge couplings are reported. The results are based on data collected by the CMS experiment at the LHC in proton-proton collisions at $ \sqrt{s}=13 $ TeV during 2016-2018, corresponding to an integrated luminosity of 138 fb$^{−1}$. The fiducial Zγ cross section, where a photon with a p$_{T}$ greater than 225 GeV is produced in association with a Z, and the Z decays to a $ \upnu \overline{\upnu} $ pair $ \left(\mathrm{Z}\left(\upnu \overline{\upnu}\right)\upgamma \right) $, is measured to be $ {23.3}_{-1.3}^{+1.4} $ fb, in agreement, within uncertainties, with the standard model prediction. The differential cross section as a function of the photon p$_{T}$ has been measured and compared with standard model predictions computed at next-to-leading and at next-to-next-to-leading order in perturbative quantum chromodynamics. Constraints have been placed on the presence of anomalous couplings that affect the ZZγ and Zγγ vertex using the p$_{T}$ spectrum of the photons. The observed 95% confidence level intervals for CP-conserving $ {h}_3^{\upgamma} $ and $ {h}_4^{\upgamma} $ are determined to be (−3.4, 3.5)×10$^{−4}$ and (−6.8, 6.8)×10$^{−7}$, and for $ {h}_3^{\mathrm{Z}} $ and $ {h}_4^{\mathrm{Z}} $ they are (−2.2, 2.2)×10$^{−4}$ and (−4.1, 4.2)×10$^{−7}$, respectively. These are the strictest limits to date on $ {h}_3^{\upgamma} $, $ {h}_3^{\mathrm{Z}} $ and $ {h}_4^{\mathrm{Z}} $.[graphic not available: see fulltext]

Hayrapetyan, Aram [Yerevan Phys. Inst.]↗
DOE OSTI2021

Intersecting defects in gauge theory, quantum spin chains, and Knizhnik-Zamolodchikov equations

We propose an interesting BPS/CFT correspondence playground: the correlation function of two intersecting half-BPS surface defects in four-dimensional N = 2 supersymmetric SU(N) gauge theory with 2N fundamental hypermultiplets. We show it satisfies a difference equation, the fractional quantum T-Q relation. Its Fourier transform is the 5-point conformal block of the sl N current algebra with one of the vertex operators corresponding to the N-dimensional sl N representation, which we demonstrate with the help of the Knizhnik-Zamolodchikov equation. We also identify the correlator with a state of the XXX sl 2 spin chain of N Heisenberg-Weyl modules over Y (sl 2 ). We discuss the associated quantum Lax operators, and connections to isomonodromic deformations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Non-invertible defects from the Conway SCFT to K3 sigma models. Part I. General results

We initiate the study of supersymmetry-preserving topological defect lines (TDLs) in the Conway moonshine module V f♮ . We show that the tensor category of such defects, under suitable assumptions, admits a surjective but non-injective ring homomorphism into the ring of $\mathbb{Z}$-linear maps of the Leech lattice into itself. This puts strong constraints on possible defects and their quantum dimensions. We describe a simple construction of non-invertible TDLs from orbifolds of holomorphic (super)vertex operator algebras, which yields non-trivial examples of TDLs satisfying our main theorem. We conjecture a correspondence between four-plane-preserving TDLs in V f♮ and supersymmetry-preserving TDLs in K3 non-linear sigma models, which extends the correspondence between symmetry groups to the level of tensor category symmetry. We establish evidence for this conjecture by constructing non-invertible TDLs in special K3 non-linear sigma models.

Conformal Field Models in String Theory↗
DOE OSTI2020

Exploring color-octet scalar parameter space in minimal R-symmetric models

In this work we study the collider phenomenology of color-octet scalars (sgluons) in minimal supersymmetric models endowed with a global continuous R symmetry. We systematically catalog the significant decay channels of scalar and pseudoscalar sgluons and identify novel features that are natural in these models. These include decays in nonstandard diboson channels, such as to a gluon and a photon; three-body decays with considerable branching fractions; and long-lived particles with displaced vertex signatures. We also discuss the single and pair production of these particles and show that they can evade existing constraints from the Large Hadron Collider, to varying extents, in large regions of reasonable parameter space. We find, for instance, that a 725 GeV scalar and a 350 GeV or lighter pseudoscalar can still be accommodated in realistic scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Landau diagrams in AdS and S-matrices from conformal correlators

Quantum field theories in AdS generate conformal correlation functions on the boundary, and in the limit where AdS is nearly flat one should be able to extract an S-matrix from such correlators. We discuss a particularly simple position-space procedure to do so. It features a direct map from boundary positions to (on-shell) momenta and thereby relates cross ratios to Mandelstam invariants. This recipe succeeds in several examples, includes the momentum-conserving delta functions, and can be shown to imply the two proposals in based on Mellin space and on the OPE data. Interestingly the procedure does not always work: the Landau singularities of a Feynman diagram are shown to be part of larger regions, to be called ‘bad regions’, where the flat-space limit of the Witten diagram diverges. To capture these divergences we introduce the notion of Landau diagrams in AdS. As in flat space, these describe on-shell particles propagating over large distances in a complexified space, with a form of momentum conservation holding at each bulk vertex. As an application we recover the anomalous threshold of the four-point triangle diagram at the boundary of a bad region.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Heptagon functions and seven-gluon amplitudes in multi-Regge kinematics

We compute all 2 → 5 gluon scattering amplitudes in planar $ \mathcal{N} $ N = 4 super-Yang-Mills theory in the multi-Regge limit that is sensitive to the non-trivial (“long”) Regge cut. We provide the amplitudes through four loops and to all logarithmic accuracy at leading power, in terms of single-valued multiple polylogarithms of two variables. To obtain these results, we leverage the function-level results for the amplitudes in the Steinmann cluster bootstrap. To high powers in the series expansion in the two variables, our results agree with the recently conjectured all-order central emission vertex used in the Fourier-Mellin representation of amplitudes in multi-Regge kinematics. Our results therefore provide a resummation of the Fourier-Mellin residues into single-valued polylogarithms, and constitute an important cross-check between the bootstrap approach and the all-orders multi-Regge proposal.

1/N expansion↗
DOE OSTI2023

The sequence of prime gaps is graphic

Let us call a simple graph on $n$ ≥ 2 vertices a prime gap graph if its vertex degrees are 1 and the first $n$ - 1 prime gaps. We show that such a graph exists for every large n, and in fact for every $n$ ≥ 2 if we assume the Riemann hypothesis. Moreover, an infinite sequence of prime gap graphs can be generated by the so-called degree preserving growth process. This is the first time a naturally occurring infinite sequence of positive integers is identified as graphic. That is, we show the existence of an interesting, and so far unique, infinite combinatorial object.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Electronic structure and thermoelectric properties of CoAsSb with post-DFT approaches

Here, we study the electronic structure and thermoelectric properties of recently synthesized CoAsSb. The calculated bandgap becomes more accurate for increasingly-complex electronic structure methods: generalized gradient approximation, hybrid functionals, selfconsistent linearized quasiparticle GW method (LQSGW), and LQSGW with simplified vertex corrections. By equating the bandgaps of each method from a rigid shift of the bands, we evaluate the contributions made to thermoelectric properties beyond the bandgap. In doing so, we evaluate the efficacy of a commonpractice: a rigid shift applied to less-costly electronic structure methods in order to gain some accuracy of the more-costly methods. We find that while the shift made the Seebeck coefficients much closer to one another than from the original electronic structures, there remain differences in the Goldsmid-Sharp (thermoelectric) bandgap between the methods and from the intended electronic bandgap. Additionally, some lasting differences in temperature dependence remain between the methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

GraphTango: A Hybrid Representation Format for Efficient Streaming Graph Updates and Analysis

Abstract Streaming graph processing performs batched updates and analytics on a time-evolving graph. The underlying representation format of the graph largely determines the throughputs of these updates and analytics phases. Existing representation formats usually employ variations of hash tables or adjacency lists. However, a recent study showed that the adjacency-list-based approaches perform poorly on heavy-tailed graphs, and the hash table-based approaches suffer on short-tailed graphs. We propose GraphTango, a hybrid representation format that provides excellent update and analytics throughput regardless of the graph’s degree distribution. GraphTango dynamically switches among three different formats based on a vertex’s degree: (i) Low-degree vertices store the edges directly with the neighborhood metadata, confining accesses to a single cache line, (2) Medium-degree vertices use adjacency lists, and (3) High-degree vertices use hash tables as well as adjacency lists. In this case, the adjacency list provides fast traversal during the analytics phase, while the hash table provides constant-time lookups during the update phase. We further optimized the performance by designing an open-addressing-based hash table that fully utilizes every fetched cache line. In addition, we developed a thread-local lock-free memory pool that allows fast growing/shrinking of the adjacency lists and hash tables in a multi-threaded environment. We evaluated GraphTango with the help of the SAGA-Bench framework and compared it with four other representation formats: Stinger, Degree-aware Robin Hood Hashing, and two adjacency list-based formats with different workload balancing scheme. On average, GraphTango provides 4.5x higher insertion throughput, 3.2x higher deletion throughput, and 1.1x higher analytics throughput over the next best format. Furthermore, we integrated GraphTango with the state-of-the-art graph processing frameworks DZiG and RisGraph. Compared to the vanilla DZiG and vanilla RisGraph , [ GraphTango + DZiG ] and [ GraphTango + RisGraph ] reduces the average batch processing time by 2.3x and 1.5x, respectively.

Ahmed, Alif↗
DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Clustering and Cliques in Preferential Attachment Random Graphs with Edge Insertion

In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step t, either a new vertex is added with probability f(t), or an edge is added between two existing vertices with probability 1 – f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t) is a regularly varying function at infinity with index of regular variation –$\gamma$, where $\gamma$ $\in$ [0, 1). Finally, we also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗