Search

This paper introduces a spin-free formulation of the supporting subspace factorization [C. Song and T. J. Martínez, J. Chem. Phys. 149, 044108 (2018)], enabling a reduction in the computational scaling of the extended multi-state complete active space second-order perturbation (XMS-CASPT2) method for arbitrary spins. Compared to the original formulation that is defined in the spin orbitals and is limited to singlet states, the spin-free formulation in this work treats different spin states equivalently, thus naturally generalizing the idea beyond singlet states. In addition, we will present a new way of deriving the supporting subspace factorization with the purpose of understanding its physical interpretation. In this new derivation, we separate the sources that make CASPT2 difficult into the "same-site interactions" and "inter-site interactions." We will first show how the Kronecker sum can be used to remove the same-site interactions in the absence of inter-site interactions, leading to MP2 energy in dressed orbitals. We will then show how the inter-site interactions can be exactly recovered using Löwdin partition, where the supporting subspace concept will naturally arise. The new spin-free formulation maintains the main advantage of the supporting subspace factorization, i.e., allowing XMS-CASPT2 energies to be computed using highly optimized MP2 energy codes and Fock build codes, thus reducing the scaling of XMS-CASPT2 to the same scaling as MP2. We will present and discuss results that benchmark the accuracy and performance of the new method. To demonstrate how the new method can be useful in studying real photochemical systems, the supporting subspace XMS-CASPT2 is applied to a photoreaction sensitive to magnetic field effects. The new spin-free formulation makes it possible to calculate the doublet and quartet states required in this particular photoreaction mechanism. [ABSTRACT FROM AUTHOR]

The Unitary Group Adaptation (UGA) offers a very compact and efficient spin adaptation strategy for any spin-free Hamiltonian in a many body framework. Our use of UGA in the context of state-specific (SS) Jeziorski–Monkhorst Ansatz based multireference coupled cluster (MRCC) theory obviates the non-commutativity between the spin-free cluster operators via a normal ordered exponential parametrization in the wave operator. A previous formulation of UGA-SSMRCC by us [R. Maitra, D. Sinha, and D. Mukherjee, J. Chem. Phys. 137, 024105 (2012)], using the same ansatz, employed certain sufficiency conditions to reach the final working equations, which cannot be improved systematically. In this article, we will present a more rigorous formulation that follows from an exact factorization of the unlinked terms of the Bloch equation, resulting in equations on which a hierarchy of approximations can be systematically performed on the emergent additional terms. This derivation was shown in our recent article [D. Chakravarti, S. Sen, and D. Mukherjee, Mol. Phys. 119, e1979676 (2021)] in the context of a single open shell CC formalism and was applied to spectroscopic energy differences where the contribution of the new terms was found to be of the order of ∼0.001 eV for ionization potential, electron affinity, and excitation energy. In the current work, we will present a comparison between the earlier and current formulations via both a theoretical analysis and a numerical demonstration of the dramatic effect of the additional terms brought in by the factorization on potential energy curves. The contribution of such terms was found to gain importance with an increase in the number of singly occupied active orbitals in the model space functions. [ABSTRACT FROM AUTHOR]

The coupled-trajectory mixed quantum–classical method (CTMQC), derived from the exact factorization approach, has successfully predicted photo-chemical dynamics in a number of interesting molecules, capturing population transfer and decoherence from first principles. However, due to the approximations made, CTMQC does not guarantee energy conservation. We propose a modified algorithm, CTMQC-E, which redefines the integrated force in the coupled-trajectory term so to restore energy conservation, and demonstrate its accuracy on scattering in Tully's extended coupling region model and photoisomerization in a retinal chromophore model. [ABSTRACT FROM AUTHOR]

Under the fundamental theorem of arithmetic, any integer n > 1 can be uniquely written as a product of prime powers pa; factoring each exponent a as a product of prime powers qb, and so on, one will obtain what is called the tower factorization of n. Here, given an integer n > 1, we study its height h(n), that is, the number of "floors" in its tower factorization. In particular, given a fixed integer k ≥ 1 , we provide a formula for the density of the set of integers n with h(n) = k. This allows us to estimate the number of floors that a positive integer will have on average. We also show that there exist arbitrarily long sequences of consecutive integers with arbitrarily large heights. [ABSTRACT FROM AUTHOR]

Two new boundary correction techniques are proposed in order to mitigate the order reduction phenomenon associated with the numerical solution of initial boundary value problems for parabolic partial differential equations in arbitrary spatial dimensions with time-dependent Dirichlet boundary conditions. The new techniques are based on the idea of discretizing the PDE problem at the boundary points as similar as possible to that of the interior points of the domain. These new techniques are considered for the time integration with W-methods based on approximate matrix factorization. By suitably modifying the internal stages of the methods on the boundary points, it is illustrated by numerical testing with time-dependent boundary conditions that the new boundary correction techniques are able to keep the same accuracy and order of convergence that the method reaches in the case of homogeneous boundary conditions. [ABSTRACT FROM AUTHOR]

Varimax factor rotations, while popular among practitioners in psychology and statistics since being introduced by Kaiser (1958) , have historically been viewed with skepticism and suspicion by some theoreticians and mathematical statisticians. Now, work by Rohe & Zeng (2023) provides new, fundamental insight: varimax rotations provably perform statistical estimation in certain classes of latent variable models when paired with spectral-based matrix truncations for dimensionality reduction. We build on this new-found understanding of varimax rotations by developing further connections to network analysis and spectral methods rooted in entrywise matrix perturbation analysis. Concretely, this paper establishes the asymptotic multivariate normality of vectors in varimax-transformed Euclidean point clouds that represent low-dimensional node embeddings in certain latent space random graph models. We address related concepts including network sparsity, data denoising and the role of matrix rank in latent variable parameterizations. Collectively, these findings, at the confluence of classical and contemporary multivariate analysis, reinforce methodology and inference procedures grounded in matrix factorization-based techniques. Numerical examples illustrate our findings and supplement our discussion. [ABSTRACT FROM AUTHOR]

Suppose that B is a separable stable C^*-algebra with real rank zero, stable rank one and (\mathrm {K}_0(B), \mathrm {K}_0^+(B)) is weakly unperforated in the sense of Elliott [Internat. J. Math. 1 (1990), no. 4, pp. 361–380]. Let A be a unital simple separable nuclear \mathrm {C}^*-algebra. We show that B has the corona factorization property and any unital extension of A by B is absorbing. [ABSTRACT FROM AUTHOR]

For a prime p, we show that uniqueness of factorization into irreducible Σ p 2 -invariant representations of Z / p ≀ Z / p holds if and only if p = 2 . We also show nonuniqueness of factorization for Σ 8 -invariant representations of D 8 ≀ Z / 2 . The representation ring of Σ p 2 -invariant representations of Z / p ≀ Z / p is determined completely when p equals two or three. [ABSTRACT FROM AUTHOR]

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing some sufficiency conditions on their coefficients along with some conditions on the prime factorization of the constant term or the leading coefficient of the underlying polynomials in conjunction with the information about their root location. [ABSTRACT FROM AUTHOR]

The development of the GPS (Global Positioning System) and related advances have made it possible to conceive of an outdoor positioning system with great accuracy; however, for indoor positioning, more efficient, reliable, and cost-effective technology is required. There are a variety of techniques utilized for indoor positioning, such as those that are Wi-Fi, Bluetooth, infrared, ultrasound, magnetic, and visual-marker-based. This work aims to design an accurate position estimation algorithm by combining raw distance data from ultrasonic sensors (Marvelmind Beacon) and acceleration data from an inertial measurement unit (IMU), utilizing the extended Kalman filter (EKF) with UDU factorization (expressed as the product of a triangular, a diagonal, and the transpose of the triangular matrix) approach. Initially, a position estimate is calculated through the use of a recursive least squares (RLS) method with a trilateration algorithm, utilizing raw distance data. This solution is then combined with acceleration data collected from the Marvelmind sensor, resulting in a position solution akin to that of the GPS. The data were initially collected via the ROS (Robot Operating System) platform and then via the Pixhawk development card, with tests conducted using a combination of four fixed and one moving Marvelmind sensors, as well as three fixed and one moving sensors. The designed algorithm is found to produce accurate results for position estimation, and is subsequently implemented on an embedded development card (Pixhawk). The tests showed that the designed algorithm gives accurate results with centimeter precision. Furthermore, test results have shown that the UDU-EKF structure integrated into the embedded system is faster than the classical EKF. [ABSTRACT FROM AUTHOR]

Large number factorization is not only the most critical entry point for Rivest–Shamir–Adleman (RSA) security analysis, but also the most direct means of attacking the asymmetric encryption algorithm RSA. In this paper, the factorization methods of large numbers are summarized and analysed: classical integer factoring algorithms, Shor's circuit model algorithm, quantum adiabatic methods (integer factorization based on a quantum nuclear magnetic resonance (NMR) platform and D-Wave quantum annealing), and hybrid quantum-classical computing. Finally, the feasibility of integer factorization based on quantum adiabatics is discussed. In this paper, quantum annealing is regarded as a quantum attack method that is completely different from the famous Shor algorithm, and the potential of D-Wave factorization of large numbers to crack RSA cryptography is verified, which provides a new idea for a quantum attack on RSA public key cryptography. [ABSTRACT FROM AUTHOR]

The sparse triangular solver (SpTRSV) is mostly used for scientific and engineering applications. The structured-grid triangular solver of regular dependencies (STRSV) is a special kind of SpTRSV. Some general SpTRSVs that disregards the regularity of the matrix are unsuitable for solving this problem. This paper proposes an efficient parallel algorithm for STRSV on the SW26010 (a kind of China independently designed many-core processors), namely swStructTRSV. The algorithm makes full use of the fine-grained and low latency communication characteristics of the SW26010 to reduce the waiting time for synchronization, maximizes the regularity of access to improve memory access bandwidth, and achieves overlap between memory access and computation simultaneously. Moreover, the idea of the algorithm can be extended to incomplete LU factorization (ILU factorization) because of consistent dependencies. The experimental results on a core group(8 * 8 network composed of 64 cores) of SW26010 show that swStructTRSV can achieve an average speedup of over 30 in the sequential version. swStructTRSV on SW26010 achieves solving speedups of 2.2 and 6.3 over the fast STRSV (fSpTRSV) previously implemented on SW26010 and MKL on Intel Xeon Gold 6132, respectively. swStructTRSV significantly outperforms cuSparse on NVIDIA TITAN RTX in terms of overall execution time. [ABSTRACT FROM AUTHOR]

This paper addresses the following problem: given m potential observations to determine n parameters, m > n , what is the best choice of n observations. The problem can be formulated as finding the n × n submatrix of the complete m × n observation matrix that has maximum determinant. An algorithm by Gu and Eisenstat for a determining a strongly rank-revealing QR factorisation of a matrix can be adapted to address this latter formulation. The algorithm starts with an initial selection of n rows of the observation matrix and then performs a sequence of row interchanges, with the determinant of the current submatrix strictly increasing at each step until no further improvement can be made. The algorithm implements rank-one updating strategies, which leads to a compact and efficient algorithm. The algorithm does not necessarily determine the global optimum but provides a practical approach to designing an effective measurement strategy. In this paper, we describe how the Gu–Eisenstat algorithm can be adapted to address the problem of optimal experimental design and used with the QR algorithm with column pivoting to provide effective designs. We also describe implementations of sequential algorithms to add further measurements that optimise the information gain at each step. We illustrate performance on several metrology examples. [ABSTRACT FROM AUTHOR]

The integration of graph embedding technology and collaborative filtering algorithms has shown promise in enhancing the performance of recommendation systems. However, existing integrated recommendation algorithms often suffer from feature bias and lack effectiveness in personalized user recommendation. For instance, users' historical interactions with a certain class of items may inaccurately lead to recommendations of all items within that class, resulting in feature bias. Moreover, accommodating changes in user interests over time poses a significant challenge. This study introduces a novel recommendation model, RCKFM, which addresses these shortcomings by leveraging the CoFM model, TransR graph embedding model, backdoor tuning of causal inference, KL divergence, and the factorization machine model. RCKFM focuses on improving graph embedding technology, adjusting feature bias in embedding models, and achieving personalized recommendations. Specifically, it employs the TransR graph embedding model to handle various relationship types effectively, mitigates feature bias using causal inference techniques, and predicts changes in user interests through KL divergence, thereby enhancing the accuracy of personalized recommendations. Experimental evaluations conducted on publicly available datasets, including "MovieLens-1M" and "Douban dataset" from Kaggle, demonstrate the superior performance of the RCKFM model. The results indicate a significant improvement of between 3.17% and 6.81% in key indicators such as precision, recall, normalized discount cumulative gain, and hit rate in the top-10 recommendation tasks. These findings underscore the efficacy and potential impact of the proposed RCKFM model in advancing recommendation systems. [ABSTRACT FROM AUTHOR]

Direction-splitting implicit solvers employ the regular structure of the computational domain augmented with the splitting of the partial differential operator to deliver linear computational cost solvers for time-dependent simulations. The finite difference community originally employed this method to deliver fast solvers for PDE-based formulations. Later, this method was generalized into so-called variational splitting. The tensor product structure of basis functions over regular computational meshes allows us to employ the Kronecker product structure of the matrix and obtain linear computational cost factorization for finite element method simulations. These solvers are traditionally used for fast simulations over the structures preserving the tensor product regularity. Their applications are limited to regular problems and regular model parameters. This paper presents a generalization of the method to deal with non-regular material data in the variational splitting method. Namely, we can vary the material data with test functions to obtain a linear computational cost solver over a tensor product grid with non-regular material data. Furthermore, as described by the Maxwell equations, we show how to incorporate this method into finite element method simulations of non-stationary electromagnetic wave propagation over the human head with material data based on the three-dimensional MRI scan. [ABSTRACT FROM AUTHOR]

Muscle synergy has been widely acknowledged as a possible strategy of neuromotor control, but current research has ignored the potential inhibitory components in muscle synergies. Our study aims to identify and characterize the inhibitory components within motor modules derived from electromyography (EMG), investigate the impact of aging and motor expertise on these components, and better understand the nervous system's adaptions to varying task demands. We utilized a rectified latent variable model (RLVM) to factorize motor modules with inhibitory components from EMG signals recorded from ten expert pianists when they played scales and pieces at different tempo–force combinations. We found that older participants showed a higher proportion of inhibitory components compared with the younger group. Senior experts had a higher proportion of inhibitory components on the left hand, and most inhibitory components became less negative with increased tempo or decreased force. Our results demonstrated that the inhibitory components in muscle synergies could be shaped by aging and expertise, and also took part in motor control for adapting to different conditions in complex tasks. [ABSTRACT FROM AUTHOR]

Our main purpose in this paper is to construct a predual of Morrey–Lorentz space via the block spaces, defined in [Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4), 1999, 28(1): 31–40]. As a direct application of duality, we obtain the Morrey–Lorentz boundedness of linear Calderón–Zygmund operators. Moreover, we study a weak Hardy factorization in terms of linear Calderón–Zygmund operators in Morrey–Lorentz spaces. As a consequence of this result, we obtain a characterization of functions in BMO(ℝn) through the boundedness of commutator [b, T], where T is a homogeneous Calderón–Zygmund operator. Finally, we prove a Morrey–Lorentz compactness characterization of [b, T]. Precisely, [b, T] is a compact operator on Morrey–Lorentz spaces if and only if b ∈ CMO(ℝn). [ABSTRACT FROM AUTHOR]

One of the features of Baxter's Q-operators for many closed spin chain models is that all transfer matrices arise as products of two Q-operators with shifts in the spectral parameter. In the representation-theoretical approach to Q-operators, underlying this is a factorization formula for L-operators (solutions of the Yang–Baxter equation associated to particular infinite-dimensional representations). To extend such a formalism to open spin chains, one needs a factorization identity for solutions of the reflection equation (boundary Yang–Baxter equation) associated to these representations. In the case of quantum affine sl 2 and diagonal K-matrices, we derive such an identity using the recently formulated theory of universal K-matrices for quantum affine algebras. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI) technology has brought new reconstruction opportunities for the intelligence of the advertisement industry through the help of AI technologies such as machine learning and deep learning. First, the relationship between AI and the attractiveness of green advertisements is investigated, and the influence of different AI technologies in green advertisements on consumers' perception of the attractiveness of green advertisements is summarized. Second, based on the green advertisement dissemination rate data set, the data visualization exploration is carried out, and the data deletion and coding processing are carried out aiming at different characteristic variables. Finally, according to the problems existing in the current green advertisement communication and the high‐dimensional and sparse characteristics of the communication rate data set. In this paper, based on Deep FM (Factorization Machine), Gradient Boost Decision Tree (GBDT) is added to assist the experiment, and the prediction performance of green advertising communication is tested. The results are as follows. (1) Different AI expressions in green advertisements will affect consumers' perception of the attractiveness of green advertisements. (2) The prediction ability of Deep FM model after feature engineering is better than that of data cleaning only. The prediction effect of the model is obviously improved. The purpose of this paper is to integrate green advertising media communication into the ecological concept of harmonious coexistence between man and nature, strengthen the political belief of ecological civilization construction, and conform to the communication trend of today's severe ecological situation. [ABSTRACT FROM AUTHOR]

Tensor ring (TR) decomposition has been widely applied as an effective approach in a variety of applications to discover the hidden low‐rank patterns in multidimensional and higher‐order data. A well‐known method for TR decomposition is the alternating least squares (ALS). However, solving the ALS subproblems often suffers from high cost issue, especially for large‐scale tensors. In this paper, we provide two strategies to tackle this issue and design three ALS‐based algorithms. Specifically, the first strategy is used to simplify the calculation of the coefficient matrices of the normal equations for the ALS subproblems, which takes full advantage of the structure of the coefficient matrices of the subproblems and hence makes the corresponding algorithm perform much better than the regular ALS method in terms of computing time. The second strategy is to stabilize the ALS subproblems by QR factorizations on TR‐cores, and hence the corresponding algorithms are more numerically stable compared with our first algorithm. Extensive numerical experiments on synthetic and real data are given to illustrate and confirm the above results. In addition, we also present the complexity analyses of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we generalize the Pascal matrices presented in [9] as a functional for several variables. The entries of these matrices are defined on the set R ⊆ Z ≥ 0 n with multidimensional binomial coefficients along with several variables. In the following, we will investigate the algebraic properties of these matrices in terms of products, powers, and inverses of the matrices and also some factorization formulas using this method. [ABSTRACT FROM AUTHOR]

Grothendieck's inequalities for operators and bilinear forms imply some factorization results for complex m × n matrices. The theory of operator spaces provides a set up which describes 4 norm optimal factorizations of Grothendieck's sort. It is shown that 3 of the optimal factorizations are uniquely determined and the remaining one is unique in some cases. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group G is said to admit a uniform group factorization if there exist subgroups H 1 , H 2 , ... , H k such that G = H 1 H 2 ⋯ H k and the number of ways to represent any element g ∈ G as g = h 1 h 2 ⋯ h k ( h i ∈ H i ) does not depend on the choice of g. Moreover, a uniform group factorization consisting of cyclic subgroups is called a uniform cyclic group factorization. First, we show that any finite solvable group admits a uniform cyclic group factorization. Second, we show that whether all finite groups admit uniform cyclic group factorizations or not is equivalent to whether all finite simple groups admit uniform group factorizations or not. Lastly, we give some concrete examples of such factorizations. [ABSTRACT FROM AUTHOR]

Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of the so-called descent 1-cocycles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid whose one factor is a subgroup of the monoid is obtained. The relationship between monoid factorizations and non-abelian cohomology of monoids is analyzed. Some applications of semi-direct product of monoids are given. [ABSTRACT FROM AUTHOR]

A power series being given as the solution of a linear differential equation with appropriate initial conditions, minimization consists in finding a non-trivial linear differential equation of minimal order having this power series as a solution. This problem exists in both homogeneous and inhomogeneous variants; it is distinct from, but related to, the classical problem of factorization of differential operators. Recently, minimization has found applications in Transcendental Number Theory, more specifically in the computation of non-zero algebraic points where Siegel's E-functions take algebraic values. We present algorithms and implementations for these questions, and discuss examples and experiments. [ABSTRACT FROM AUTHOR]

The first observation of the B c + → J / ψ π + π 0 decay is reported with high significance using proton-proton collision data, corresponding to an integrated luminosity of 9 fb−1, collected with the LHCb detector at centre-of-mass energies of 7, 8, and 13 TeV. The ratio of its branching fraction relative to the B c + → J / ψ π + channel is measured to be B B c + → J / ψ π + π 0 B B c + → J / ψ π + = 2.80 ± 0.15 ± 0.11 ± 0.16 , where the first uncertainty is statistical, the second systematic and the third related to imprecise knowledge of the branching fractions for B+ → J/ψK*+ and B c + → J / ψ π + decays, which are used to determine the π0 detection efficiency. The π+π0 mass spectrum is found to be consistent with the dominance of an intermediate ρ+ contribution in accordance with a model based on QCD factorisation. [ABSTRACT FROM AUTHOR]

The running of the top quark mass (mt) is probed at the next-to-next-to-leading order in quantum chromodynamics for the first time. The result is obtained by comparing calculations in the modified minimal subtraction () renormalisation scheme to the CMS result on differential measurement of the top quark-antiquark () production cross section at = 13 TeV. The scale dependence of mt is extracted as a function of the invariant mass of the system, up to an energy scale of about 0.5 TeV. The observed running is found to be in good agreement with the three-loop solution of the renormalisation group equations on quantum chromodynamics. [ABSTRACT FROM AUTHOR]

The general structure of infrared divergences in the scattering of massive particles is captured by the soft anomalous dimension matrix. The latter can be computed from a correlation function of multiple Wilson lines. The state-of-the-art two-loop result has a tantalizingly simple structure that is not manifest in the calculations. We argue that the complexity in intermediate steps of the known calculations comes from spurious, regulator-dependent terms. Based on this insight we propose a different infrared regulator that is associated to only one of the Wilson lines. We demonstrate that this streamlines obtaining the two-loop result: computing the required Feynman integrals via the differential equations method, only multiple polylogarithmic functions appear (to all orders in the dimensional regulator), as opposed to elliptic polylogarithms. We show that the new method is promising for higher-loop applications by computing a three-loop diagram of genuine complexity, and provide the answer in terms of multiple polylogarithms. The relatively simple symbol alphabet we obtain may be of interest for bootstrap approaches. [ABSTRACT FROM AUTHOR]

We present an analytic calculation of the one-loop correction to the double-real emission contribution to the zero-jettiness soft function at N3LO in QCD, accounting for both gluon-gluon and quark-antiquark soft final-state partons. We explain all the relevant steps of the computation including the reduction of phase-space integrals to master integrals in the presence of Heaviside functions, and the methods we employed to compute them. [ABSTRACT FROM AUTHOR]

Lattice QCD offers the possibility of computing parton distributions from first principles, although not in the usual MS ¯ factorization scheme. Calculations are therefore matched to MS ¯ using a perturbative procedure which is the source of significant uncertainty within the currently accessible kinematics. We present the possibility of computing the z2 evolution of non-singlet pseudo-parton distribution functions within the short factorization scheme in a numerically improvable way. The goal is to have tools to evolve a calculation to a scale where perturbative uncertainties are less pronounced. We compare a numerical extraction of the evolution operator from lattice data to the computation of z2 dependence in perturbation theory. Finally, we discuss how this numerical work may be extended to address the two-scale problem that arises when the Ioffe time range must be made large to extend the reach of the calculation of the pseudo-PDF to smaller values of the momentum fraction. [ABSTRACT FROM AUTHOR]

We study the light quark effect on the Higgs boson production in association with a jet at the LHC in the intermediate transverse momentum region between the quark and the Higgs boson mass scales. Though the effect is suppressed by the small Yukawa coupling, it is enhanced by large logarithms of the quark mass ratio to the Higgs boson mass or transverse momentum. Following a remarkable success of the logarithmic expansion [40] for the prediction of the next-to-next-to-leading bottom quark contribution to the total cross section of the Higgs boson production we extend the analysis to its kinematical distributions. A new factorization formula is derived for the light quark mediated gg → Hg amplitudes and the differential cross section of the process is computed in the logarithmic approximation, which is used for an estimate of the bottom quark effect at the next-to-next-to-leading order. [ABSTRACT FROM AUTHOR]

In this paper, we present an algorithm to construct the qT distribution at NLO accuracy to arbitrary power precision, including the assembly of suitable zero-bin subtrahends, in a mathematically well-defined way for a generic choice of rapidity-divergence regularisation prescription. In its derivation, we divide the phase space into two sectors, the interior of the integration domain as well as the integration boundary, which we include here for the first time. To demonstrate the applicability and usefulness of our algorithm, we calculate the N2LP corrections for Higgs hadroproduction for the first time. We observe that our approximate N2LP-accurate qT spectra replicate the asymptotic behaviour of the full QCD calculation to a much better degree than the previously available results, both within the qT → 0 limit and in the large-qT domain for all the involved partonic processes. While playing a minor role at larger transverse momenta, we show that the newly incorporated boundary contribution plays a vital role in the qT → 0 limit, where any subleading power accuracy would be lost without them. In particular, our N2LP-accurate qT expansion can approximate the exact qT distribution up to qT ≈ 30 GeV at the percent level for rapidities |YH| ≲ 3. [ABSTRACT FROM AUTHOR]

We study the inclusive production of hadrons with bottom flavor at the LHC and its luminosity upgrade. We describe the collinear fragmentation of singly b-flavored hadrons, B mesons and Λ b baryons, via the KKSS07 determination of fragmentation functions, while for charmed B mesons, B c (1 S 0) and B c (3 S 1) particles, we employ the novel ZCFW22 set, built on the basis of state-of-the-art nonrelativistic QCD inputs. We use the Jethad multimodular working environment to analyze rapidity and transverse-momentum distributions for observables sensitive to the associated emission of two hadrons or a hadron-plus-jet system. Our reference formalism is the NLL / NLO + hybrid collinear and high-energy factorization, where the standard collinear description is improved by the inclusions of energy logarithms resummed up to the next-to-leading approximation and beyond. We provide corroborating evidence that b-flavor emissions act as fair stabilizers of the high-energy resummation, thus serving as valuable tools for precision studies of high-energy QCD. As a bonus, we highlight that the predicted production-rate hierarchy between noncharmed b-hadrons and charmed B c (1 S 0) mesons is in line with recent LHCb estimates. This serves as simultaneous benchmark both for the hybrid factorization and for the single-parton fragmentation mechanism based on initial-scale inputs calculated via the nonrelativistic QCD effective theory. [ABSTRACT FROM AUTHOR]

We cure the perturbative instability of the total-inclusive-photoproduction cross sections of vector S-wave quarkonia observed at high photon-proton-collision energies ( s γ p ) in Next-to-Leading Order (NLO) Collinear-Factorisation (CF) computations. This is achieved using High-Energy Factorisation (HEF) in the Doubly-Logarithmic Approximation (DLA), which is a subset of the Leading-Logarithmic Approximation (LLA) of HEF which resums higher-order QCD corrections proportional to α s n ln n - 1 (s ^ / M 2) in the Regge limit s ^ ≫ M 2 with M 2 being the quarkonium mass and s ^ is the squared partonic-center-of-mass energy. Such a DLA is strictly consistent with the NLO and NNLO DGLAP evolutions of the parton distribution functions. By improving the treatment of the large- s ^ asymptotics of the CF coefficient function, the resummation cures the unphysical results of the NLO CF calculation. The matching is directly performed in s ^ space using the Inverse-Error Weighting matching procedure which avoids any possible double counting. The obtained cross sections are in good agreement with data. In addition, the scale-variation uncertainty of the matched result is significantly reduced compared to the LO results. Our calculations also yield closed-form analytic limits for s ^ ≫ M 2 of the NLO partonic CF and numerical limits for contributions to those at NNLO scaling like α s 2 ln (s ^ / M 2) . [ABSTRACT FROM AUTHOR]

We review recent progress in the computation of structure-dependent QED corrections to exclusive B decays in the factorization approach. [ABSTRACT FROM AUTHOR]

The approach to solving linear systems with structured matrices by means of the bidiagonal factorization of the inverse of the coefficient matrix is first considered in this review article, the starting point being the classical Björck–Pereyra algorithms for Vandermonde systems, published in 1970 and carefully analyzed by Higham in 1987. The work of Higham briefly considered the role of total positivity in obtaining accurate results, which led to the generalization of this approach to totally positive Cauchy, Cauchy–Vandermonde and generalized Vandermonde matrices. Then, the solution of other linear algebra problems (eigenvalue and singular value computation, least squares problems) is addressed, a fundamental tool being the bidiagonal decomposition of the corresponding matrices. This bidiagonal decomposition is related to the theory of Neville elimination, although for achieving high relative accuracy the algorithm of Neville elimination is not used. Numerical experiments showing the good behavior of these algorithms when compared with algorithms that ignore the matrix structure are also included. [ABSTRACT FROM AUTHOR]

Extensions of Filbert and Lilbert matrices are addressed in this work. They are reciprocal Hankel matrices based on Fibonacci and Lucas numbers, respectively, and both are related to Hilbert matrices. The Neville elimination is applied to provide explicit expressions for their bidiagonal factorization. As a byproduct, formulae for the determinants of these matrices are obtained. Finally, numerical experiments show that several algebraic problems involving these matrices can be solved with outstanding accuracy, in contrast with traditional approaches. [ABSTRACT FROM AUTHOR]

Elementary irreducibility criteria are established for f (x p) where f (x) ∈ ℤ [ x ] is irreducible over ℚ and p is a prime. For instance, our main criterion implies that if f (x p) is reducible over ℚ , then f (x) divides f (x p) modulo p 2 . Among several applications, it is shown that if f (x) has coefficients in { − 1 , 1 } , then f (x 2) is irreducible over ℚ excluding a couple of obvious exceptions. As another application, it is proved that if n > 4 and a 1 , a 2 , ... , a n are distinct integers, then for ∈ { − 1 , 1 } , the polynomial (x 2 − a 1) (x 2 − a 2) ⋯ (x 2 − a n) + is irreducible over ℚ unless n is odd and = − 1. Some emphasis is given to the non-cyclotomic monic polynomials f (x) with f (0) ∈ { − 1 , 1 }. In these cases, among other things, it is shown that if p ≫ (deg f) log max { 2 , H (f) } , where H (f) denotes the height of f (x) , then f (x p) is irreducible over ℚ. Proofs of the irreducibility criteria rest upon a general result of Capelli concerning the factorization of f (x m). [ABSTRACT FROM AUTHOR]

We show that the cobordism maps on Khovanov homology can distinguish smooth surfaces in the 4-ball that are exotically knotted (i.e., isotopic through ambient homeomorphisms but not ambient diffeomorphisms). We develop new techniques for distinguishing cobordism maps on Khovanov homology, drawing on knot symmetries and braid factorizations. We also show that Plamenevskaya's transverse invariant in Khovanov homology is preserved by maps induced by positive ascending cobordisms. [ABSTRACT FROM AUTHOR]

The factorization method of Schrödinger shows us how to determine the energy eigenstates without needing to determine the wavefunctions in position or momentum space. A strategy to convert the energy eigenstates to wavefunctions is well known for the one-dimensional simple harmonic oscillator by employing the Rodrigues formula for the Hermite polynomials in position or momentum space. In this work, we illustrate how to generalize this approach in a representation-independent fashion to find the wavefunctions of other problems in quantum mechanics that can be solved by the factorization method. We examine three problems in detail: (i) the one-dimensional simple harmonic oscillator; (ii) the three-dimensional isotropic harmonic oscillator; and (iii) the three-dimensional Coulomb problem. This approach can be used in either undergraduate or graduate classes in quantum mechanics. Editor's Note: Quantum-mechanical problems are usually solved by either a direct differential-equations approach or operator methods. In 1940, Schrödinger himself developed an extension of the operator approach known as the factorization method wherein energy eigenstates for all exactly solvable problems can be found without needing to determine the wavefunction. This paper generalizes a strategy for converting the eigenstates to wavefunctions and shows how the method applies to three classic problems: the one-dimensional harmonic oscillator, the three-dimensional isotropic oscillator, and the Coulomb potential. Appropriate for advanced quantum mechanics students. [ABSTRACT FROM AUTHOR]

The main goal of this paper is to calculate the index of any number field K generated by a root of an irreducible trinomial x 4 + a x + b ∈ Z [ x ] . Our approach is based on Engstrom's results and the factorization of 2 Z K and 3 Z K . In particular, we reformulate the Davis and Spearman's results. Namely, for every prime integer p, we evaluate ν p (i (K)) . The existence of a common index divisor of K guaranties the non monogenity of K. [ABSTRACT FROM AUTHOR]

We show that every finite poset is isomorphic to a saturated subset of the spectrum of a Noetherian unique factorization domain. In addition, we show that every finite poset is isomorphic to a saturated subset of the spectrum of a quasi-excellent domain. [ABSTRACT FROM AUTHOR]

Efficient representations of the Hamiltonian, such as double factorization, drastically reduce the circuit depth or the number of repetitions in error corrected and noisy intermediate-scale quantum (NISQ) algorithms for chemistry. We report a Lagrangian-based approach for evaluating relaxed one- and two-particle reduced density matrices from double factorized Hamiltonians, unlocking efficiency improvements in computing the nuclear gradient and related derivative properties. We demonstrate the accuracy and feasibility of our Lagrangian-based approach to recover all off-diagonal density matrix elements in classically simulated examples with up to 327 quantum and 18 470 total atoms in QM/MM simulations with modest-sized quantum active spaces. We show this in the context of the variational quantum eigensolver in case studies, such as transition state optimization, ab initio molecular dynamics simulation, and energy minimization of large molecular systems. [ABSTRACT FROM AUTHOR]

A reformulation of the Ornstein–Zernike equation for a homogeneous isotropic fluid composed of m species, with spherical symmetry, is formally derived. Based on a factorization of matrices of composed functions, this reformulation provides an interesting new set of functions. As a test to this reformulation, the resulting equations are solved for a binary mixture of hard spheres and compared to those obtained from the standard solution of the Ornstein–Zernike equation and with molecular dynamics simulations. [ABSTRACT FROM AUTHOR]

In this article, we show that Mori domains, pseudo-valuation domains, and n-absorbing ideals, the three seemingly unrelated notions in commutative ring theory, are interconnected. In particular, we prove that an integral domain R is a Mori locally pseudo-valuation domain if and only if each proper ideal of R is a finite product of 2-absorbing ideals of R. Moreover, every ideal of a Mori locally almost pseudo-valuation domain can be written as a finite product of 3-absorbing ideals. To provide concrete examples of such rings, we study rings of the form A + XB [ X ] where A is a subring of a commutative ring B and X is indeterminate, which is of independent interest, and along with several characterization theorems, we prove that in such a ring, each proper ideal is a finite product of n-absorbing ideals for some n ≥ 2 if and only if A ⊆ B is essentially a finite product of field extensions. A complete description of when an order of a quadratic number field is a locally pseudo valuation domain, a locally almost pseudo valuation domain or a locally conducive domain is given. [ABSTRACT FROM AUTHOR]

Suppose that K is a field, S = K [ x 1 , ... , x n ] or S = K [ [ x 1 , ... , x n ] ] and I is a monomial ideal of S. We study factorization properties of the ring R = S / I . In particular, we present conditions equivalent to R being présimplifiable, a bounded factorization ring, a finite factorization ring or a unique factorization ring. [ABSTRACT FROM AUTHOR]

We propose a distributed-memory parallel algorithm for computing some of the algebraically smallest eigenvalues (and corresponding eigenvectors) of a large, sparse, real symmetric positive definite matrix pencil that lie within a target interval. The algorithm is based on Chebyshev interpolation of the eigenvalues of the Schur complement (over the interface variables) of a domain decomposition reordering of the pencil and accordingly exposes two dimensions of parallelism: one derived from the reordering and one from the independence of the interpolation nodes. The new method demonstrates excellent parallel scalability, comparing favorably with PARPACK, and does not require factorization of the mass matrix, which significantly reduces memory consumption, especially for 3D problems. Our implementation is publicly available on GitHub. [ABSTRACT FROM AUTHOR]

We present a new restricted SVD-based CUR (RSVD-CUR) factorization for matrix triplets (A, B, G) that aims to extract meaningful information by providing a low-rank approximation of the three matrices using a subset of their rows and columns. The proposed method utilizes the discrete empirical interpolation method (DEIM) to select the subset of rows and columns from the orthogonal and nonsingular matrices obtained through an RSVD of the matrix triplet. We explore the relationships between a DEIM type RSVD-CUR factorization, a DEIM type CUR factorization, and a DEIM type generalized CUR decomposition and provide an error analysis that establishes the accuracy of the RSVD-CUR decomposition within a factor of the approximation error of the RSVD of the given matrices. The RSVD-CUR factorization can be used in applications that require approximating one data matrix relative to two other given matrices. We discuss two such applications, namely multiview dimension reduction and data perturbation problems where a correlated noise matrix is added to the input data matrix. Our numerical experiments demonstrate the advantages of the proposed method over the standard CUR approximation in these scenarios. [ABSTRACT FROM AUTHOR]