On the exact calculation of the reflectance of glass, coated with an arbitrary number of non-absorbing layers

Physica ◽  
1947 ◽  
Vol 13 (6-7) ◽  
pp. 413-416 ◽  
Author(s):  
B.S Blaisse ◽  
J.J Van Der Sande
2021 ◽  
Vol 2021 (11) ◽  
Author(s):  
Johannes Hamre Isaksen ◽  
Konrad Tywoniuk

Abstract We study hard 1 → 2 final-state parton splittings in the medium, and put special emphasis on calculating the Wilson line correlators that appear in these calculations. As partons go through the medium their color continuously rotates, an effect that is encapsulated in a Wilson line along their trajectory. When calculating observables, one typically has to calculate traces of two or more medium-averaged Wilson lines. These are usually dealt with in the literature by invoking the large-Nc limit, but exact calculations have been lacking in many cases. In our work, we show how correlators of multiple Wilson lines appear, and develop a method to calculate them numerically to all orders in Nc. Initially, we focus on the trace of four Wilson lines, which we develop a differential equation for. We will then generalize this calculation to a product of an arbitrary number of Wilson lines, and show how to do the exact calculation numerically, and even analytically in the large-Nc limit. Color sub-leading corrections, that are suppressed with a factor $$ {N}_c^{-2} $$ N c − 2 relative to the leading scaling, are calculated explicitly for the four-point correlator and we discuss how to extend this method to the general case. These results are relevant for high-pT jet processes and initial stage physics at the LHC.


Author(s):  
Nurlan Temirgaliyev ◽  
◽  
Sabit Sarypbekovich Kudaibergenov ◽  
Nurlan Zhumabaevich Nauryzbayev ◽  
◽  
...  
Keyword(s):  

2020 ◽  
pp. 15-19
Author(s):  
M.N. Kirsanov

Formulae are obtained for calculating the deformations of a statically determinate lattice under the action of two types of loads in its plane, depending on the number of panels located along one side of the lattice. Two options for fixing the lattice are analyzed. Cases of kinematic variability of the structure are found. The distribution of forces in the rods of the lattice is shown. The dependences of the force loading of some rods on the design parameters are obtained. Keywords: truss, lattice, deformation, exact solution, deflection, induction, Maple system. [email protected]


2020 ◽  
Vol 28 (5) ◽  
pp. 727-738
Author(s):  
Victor Sadovnichii ◽  
Yaudat Talgatovich Sultanaev ◽  
Azamat Akhtyamov

AbstractWe consider a new class of inverse problems on the recovery of the coefficients of differential equations from a finite set of eigenvalues of a boundary value problem with unseparated boundary conditions. A finite number of eigenvalues is possible only for problems in which the roots of the characteristic equation are multiple. The article describes solutions to such a problem for equations of the second, third, and fourth orders on a graph with three, four, and five edges. The inverse problem with an arbitrary number of edges is solved similarly.


2021 ◽  
Vol 2021 (2) ◽  
Author(s):  
Marius de Leeuw ◽  
Chiara Paletta ◽  
Anton Pribytok ◽  
Ana L. Retore ◽  
Alessandro Torrielli

Abstract In this paper we first demonstrate explicitly that the new models of integrable nearest-neighbour Hamiltonians recently introduced in PRL 125 (2020) 031604 [36] satisfy the so-called free fermion condition. This both implies that all these models are amenable to reformulations as free fermion theories, and establishes the universality of this condition. We explicitly recast the transfer matrix in free fermion form for arbitrary number of sites in the 6-vertex sector, and on two sites in the 8-vertex sector, using a Bogoliubov transformation. We then put this observation to use in lower-dimensional instances of AdS/CFT integrable R-matrices, specifically pure Ramond-Ramond massless and massive AdS3, mixed-flux relativistic AdS3 and massless AdS2. We also attack the class of models akin to AdS5 with our free fermion machinery. In all cases we use the free fermion realisation to greatly simplify and reinterpret a wealth of known results, and to provide a very suggestive reformulation of the spectral problem in all these situations.


Author(s):  
Juan de Lara ◽  
Esther Guerra

AbstractModelling is an essential activity in software engineering. It typically involves two meta-levels: one includes meta-models that describe modelling languages, and the other contains models built by instantiating those meta-models. Multi-level modelling generalizes this approach by allowing models to span an arbitrary number of meta-levels. A scenario that profits from multi-level modelling is the definition of language families that can be specialized (e.g., for different domains) by successive refinements at subsequent meta-levels, hence promoting language reuse. This enables an open set of variability options given by all possible specializations of the language family. However, multi-level modelling lacks the ability to express closed variability regarding the availability of language primitives or the possibility to opt between alternative primitive realizations. This limits the reuse opportunities of a language family. To improve this situation, we propose a novel combination of product lines with multi-level modelling to cover both open and closed variability. Our proposal is backed by a formal theory that guarantees correctness, enables top-down and bottom-up language variability design, and is implemented atop the MetaDepth multi-level modelling tool.


1986 ◽  
Vol 9 (3) ◽  
pp. 323-342
Author(s):  
Joseph Y.-T. Leung ◽  
Burkhard Monien

We consider the computational complexity of finding an optimal deadlock recovery. It is known that for an arbitrary number of resource types the problem is NP-hard even when the total cost of deadlocked jobs and the total number of resource units are “small” relative to the number of deadlocked jobs. It is also known that for one resource type the problem is NP-hard when the total cost of deadlocked jobs and the total number of resource units are “large” relative to the number of deadlocked jobs. In this paper we show that for one resource type the problem is solvable in polynomial time when the total cost of deadlocked jobs or the total number of resource units is “small” relative to the number of deadlocked jobs. For fixed m ⩾ 2 resource types, we show that the problem is solvable in polynomial time when the total number of resource units is “small” relative to the number of deadlocked jobs. On the other hand, when the total number of resource units is “large”, the problem becomes NP-hard even when the total cost of deadlocked jobs is “small” relative to the number of deadlocked jobs. The results in the paper, together with previous known ones, give a complete delineation of the complexity of this problem under various assumptions of the input parameters.


Author(s):  
Jan Stevens

AbstractWe discuss a problem of Arnold, whether every function is stably equivalent to one which is non-degenerate for its Newton diagram. We argue that the answer is negative. We describe a method to make functions non-degenerate after stabilisation and give examples of singularities where this method does not work. We conjecture that they are in fact stably degenerate, that is not stably equivalent to non-degenerate functions.We review the various non-degeneracy concepts in the literature. For finite characteristic, we conjecture that there are no wild vanishing cycles for non-degenerate singularities. This implies that the simplest example of singularities with finite Milnor number, $$x^p+x^q$$ x p + x q in characteristic p, is not stably equivalent to a non-degenerate function. We argue that irreducible plane curves with an arbitrary number of Puiseux pairs (in characteristic zero) are stably non-degenerate. As the stabilisation involves many variables, it becomes very difficult to determine the Newton diagram in general, but the form of the equations indicates that the defining functions are non-degenerate.


Sign in / Sign up

Export Citation Format

Share Document