Abstract For polyhedral constrained optimization problems and a feasible point$$\textbf{x}$$ , it is shown that the projection of the negative gradient on the tangent cone, denoted$$\nabla _\varOmega f(\textbf{x})$$ , has an orthogonal decomposition of the form$$\varvec{\beta }(\textbf{x}) + \varvec{\varphi }(\textbf{x})$$ . At a stationary point,$$\nabla _\varOmega f(\textbf{x}) = \textbf{0}$$ so$$\Vert \nabla _\varOmega f(\textbf{x})\Vert $$ reflects the distance to a stationary point. Away from a stationary point,$$\Vert \varvec{\beta }(\textbf{x})\Vert $$ and$$\Vert \varvec{\varphi }(\textbf{x})\Vert $$ measure different aspects of optimality since$$\varvec{\beta }(\textbf{x})$$ only vanishes when the KKT multipliers at$$\textbf{x}$$ have the correct sign, while$$\varvec{\varphi }(\textbf{x})$$ only vanishes when$$\textbf{x}$$ is a stationary point in the active manifold. As an application of the theory, an active set algorithm is developed for convex quadratic programs which adapts the flow of the algorithm based on a comparison between$$\Vert \varvec{\beta }(\textbf{x})\Vert $$ and$$\Vert \varvec{\varphi }(\textbf{x})\Vert $$ .
more »
« less
Orthogonal root numbers of tempered parameters
Abstract We show that an orthogonal root number of a temperedL-parameter $$\varphi $$ decomposes as the product of two other numbers: the orthogonal root number of the principal parameter and the value on a central involution of Langlands’s central character for $$\varphi $$ . The formula resolves a conjecture of Gross and Reeder and computes root numbers of Weil–Deligne representations arising in a conjectural description of the Plancherel measure.
more »
« less
- Award ID(s):
- 1840234
- PAR ID:
- 10370090
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- Mathematische Annalen
- Volume:
- 386
- Issue:
- 3-4
- ISSN:
- 0025-5831
- Page Range / eLocation ID:
- p. 2283-2319
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract The azimuthal ($$\Delta \varphi $$ ) correlation distributions between heavy-flavor decay electrons and associated charged particles are measured in pp and p–Pb collisions at$$\sqrt{s_{\mathrm{{NN}}}} = 5.02$$ TeV. Results are reported for electrons with transverse momentum$$4<16$$ $$\textrm{GeV}/c$$ and pseudorapidity$$|\eta |<0.6$$ . The associated charged particles are selected with transverse momentum$$1<7$$ $$\textrm{GeV}/c$$ , and relative pseudorapidity separation with the leading electron$$|\Delta \eta | < 1$$ . The correlation measurements are performed to study and characterize the fragmentation and hadronization of heavy quarks. The correlation structures are fitted with a constant and two von Mises functions to obtain the baseline and the near- and away-side peaks, respectively. The results from p–Pb collisions are compared with those from pp collisions to study the effects of cold nuclear matter. In the measured trigger electron and associated particle kinematic regions, the two collision systems give consistent results. The$$\Delta \varphi $$ distribution and the peak observables in pp and p–Pb collisions are compared with calculations from various Monte Carlo event generators.more » « less
-
Abstract The double differential cross sections of the Drell–Yan lepton pair ($$\ell ^+\ell ^-$$ , dielectron or dimuon) production are measured as functions of the invariant mass$$m_{\ell \ell }$$ , transverse momentum$$p_{\textrm{T}} (\ell \ell )$$ , and$$\varphi ^{*}_{\eta }$$ . The$$\varphi ^{*}_{\eta }$$ observable, derived from angular measurements of the leptons and highly correlated with$$p_{\textrm{T}} (\ell \ell )$$ , is used to probe the low-$$p_{\textrm{T}} (\ell \ell )$$ region in a complementary way. Dilepton masses up to 1$$\,\text {Te\hspace{-.08em}V}$$ are investigated. Additionally, a measurement is performed requiring at least one jet in the final state. To benefit from partial cancellation of the systematic uncertainty, the ratios of the differential cross sections for various$$m_{\ell \ell }$$ ranges to those in the Z mass peak interval are presented. The collected data correspond to an integrated luminosity of 36.3$$\,\text {fb}^{-1}$$ of proton–proton collisions recorded with the CMS detector at the LHC at a centre-of-mass energy of 13$$\,\text {Te\hspace{-.08em}V}$$ . Measurements are compared with predictions based on perturbative quantum chromodynamics, including soft-gluon resummation.more » « less
-
Abstract LetMbe a connected, closed, oriented three-manifold andK, Ltwo rationally null-homologous oriented simple closed curves in M. We give an explicit algorithm for computing the linking number betweenKandLin terms of a presentation of Mas an irregular dihedral three-fold cover of $$S^3$$ branched along a knot$$\alpha \subset S^3$$ . Since every closed, oriented three-manifold admits such a presentation, our results apply to all (well-defined) linking numbers in all three-manifolds. Furthermore, ribbon obstructions for a knot $$\alpha $$ can be derived from dihedral covers of $$\alpha $$ . The linking numbers we compute are necessary for evaluating one such obstruction. This work is a step toward testing potential counter-examples to the Slice-Ribbon Conjecture, among other applications.more » « less
-
Abstract We report that there are 49679870 Carmichael numbers less than$$10^{22}$$ which is an order of magnitude improvement on Richard Pinch’s prior work. We find Carmichael numbers of the form$$n = Pqr$$ using an algorithm bifurcated by the size ofPwith respect to the tabulation boundB. For$$P < 7 \times 10^7$$ , we found 35985331 Carmichael numbers and 1202914 of them were less than$$10^{22}$$ . When$$P > 7 \times 10^7$$ , we found 48476956 Carmichael numbers less than$$10^{22}$$ . We provide a comprehensive overview of both cases of the algorithm. For the large case, we show and implement asymptotically faster ways to tabulate compared to the prior tabulation. We also provide an asymptotic estimate of the cost of this algorithm. It is interesting that Carmichael numbers are worst case inputs to this algorithm. So, providing a more robust asymptotic analysis of the cost of the algorithm would likely require resolution of long-standing open questions regarding the asymptotic density of Carmichael numbers.more » « less
An official website of the United States government
