Search results for "VERTEX"
showing 5 items of 225 documents
About Vertex Mappings
2019
Summary In [6] partial graph mappings were formalized in the Mizar system [3]. Such mappings map some vertices and edges of a graph to another while preserving adjacency. While this general approach is appropriate for the general form of (multidi)graphs as introduced in [7], a more specialized version for graphs without parallel edges seems convenient. As such, partial vertex mappings preserving adjacency between the mapped verticed are formalized here.
High-energy resummation effects in the production of Mueller-Navelet dijet at the LHC
2016
We study the production of two forward jets with a large interval of rapidity at hadron colliders, which was proposed by Mueller and Navelet as a possible test of the high energy dynamics of QCD, within a complete next-to-leading logarithm framework. We show that using the Brodsky-Lepage-Mackenzie procedure to fix the renormalization scale leads to a very good description of the recent CMS data at the LHC for the azimuthal correlations of the jets. We show that the inclusion of next-to-leading order corrections to the jet vertex significantly reduces the importance of energy-momentum non-conservation which is inherent to the BFKL approach, for an asymmetric jet configuration. Finally, we ar…
Parametrizētu algoritmu paātrinājumi kvantu datoram
2021
Darbā tiek aplūkots, kā uz kvantu datora iespējams paātrināt zināmus parametrizētus algoritmus problēmām “Closest string”, “Cluster vertex deletion”, “Cluster editing”, “Vertex cover” un “Longest path” problēmu risinājumiem, ka arī to uzlabošana kvantu datoram, izmantojot kvantu algoritmus meklēšanas koka apstaigāšanai un dinamiskai programmēšanai. Ir parādīts, kā izveidot kvantu algoritmus “Cluster vertex deletion” problēmas risinājumam ar laika sarežģītību 𝑂(1.7321^𝑘 * √𝑘 * 𝑛^3) un “Vertex cover” problēmai ar laiku 𝑂(1.175^𝑘 * 𝑘^𝑂(1) + 𝑛√𝑚), kas ir labāk, nekā labākajiem zināmajiem algoritmiem ar laiku 𝑂(1.9102^𝑘 * (𝑛 + 𝑚)) un 𝑂(1.2738^𝑘 + 𝑘𝑛), attiecīgi. Ka arī ir parād…
<p><strong>A new genus of Phaneropterinae (Orthoptera: Ensifera: Tettigoniidae) </strong><strong>from Central Africa</stro…
2014
The new genus Pseudoplangia is described for Plangia laminifera Karsch, 1896. Its general aspect is similar to that of the genus Plangia Stal, 1873, but it differs remarkably in the vertex width, in the shape of eyes, that are oval and elongate, in the length of mid femora, that are shorter than pronotum length, in the shape of fore and mid legs that are very much laterally compressed, and in the presence of broad-based spines on the hind tibiae.
Vertex corrections for positive-definite spectral functions of simple metals
2016
We present a systematic study of vertex corrections in the homogeneous electron gas at metallic densities. The vertex diagrams are built using a recently proposed positive-definite diagrammatic expansion for the spectral function. The vertex function not only provides corrections to the well known plasmon and particle-hole scatterings, but also gives rise to new physical processes such as generation of two plasmon excitations or the decay of the one-particle state into a two-particles-one-hole state. By an efficient Monte Carlo momentum integration we are able to show that the additional scattering channels are responsible for the bandwidth reduction observed in photoemission experiments on…