Descent construction for GSpin groups: Main results and applications

Previous Article
The spectrum of the weakly coupled Fibonacci Hamiltonian
ERA-MS Home
This Volume
Next Article
On the analyticity of the bivariant JLO cocycle

January 2009, 16: 30-36. doi: 10.3934/era.2009.16.30

Descent construction for GSpin groups: Main results and applications

1.	Mathematics Department, Mailcode 4408, Southern Illinois University Carbondale, 1245 Lincoln Drive, Carbondale, IL 62901, United States
2.	Department of Mathematics, Ben Gurion University of Negev, PO Box 653, Be’er Sheva 84105, Israel

Received December 2008 Published May 2009

Abstract
Related Papers

The purpose of this note is to announce an extension of the descent method of Ginzburg, Rallis, and Soudry to the setting of essentially self dual representations. This extension of the descent construction provides a complement to recent work of Asgari and Shahidi [2] on the generic transfer for general Spin groups as well as to the work of Asgari and Raghuram [1] on cuspidality of the exterior square lift for representations of $GL_4$. Complete proofs of the results announced in the present note will appear in our forthcoming article(s).

Keywords: Langlands functoriality, descent construction..

Mathematics Subject Classification: Primary: 32N10; Secondary: 11F7.

Citation: Joseph Hundley, Eitan Sayag. Descent construction for GSpin groups: Main results and applications. Electronic Research Announcements, 2009, 16: 30-36. doi: 10.3934/era.2009.16.30

[1]	King Hann Lim, Hong Hui Tan, Hendra G. Harno. Approximate greatest descent in neural network optimization. Numerical Algebra, Control & Optimization, 2018, 8 (3) : 327-336. doi: 10.3934/naco.2018021
[2]	Herbert Gajewski, Jens A. Griepentrog. A descent method for the free energy of multicomponent systems. Discrete & Continuous Dynamical Systems - A, 2006, 15 (2) : 505-528. doi: 10.3934/dcds.2006.15.505
[3]	F. H. Clarke, Yu. S . Ledyaev, R. J. Stern. Proximal techniques of feedback construction. Conference Publications, 1998, 1998 (Special) : 177-194. doi: 10.3934/proc.1998.1998.177
[4]	Iryna Egorova, Johanna Michor, Gerald Teschl. Rarefaction waves for the Toda equation via nonlinear steepest descent. Discrete & Continuous Dynamical Systems - A, 2018, 38 (4) : 2007-2028. doi: 10.3934/dcds.2018081
[5]	Kai Wang, Lingling Xu, Deren Han. A new parallel splitting descent method for structured variational inequalities. Journal of Industrial & Management Optimization, 2014, 10 (2) : 461-476. doi: 10.3934/jimo.2014.10.461
[6]	Shishun Li, Zhengda Huang. Guaranteed descent conjugate gradient methods with modified secant condition. Journal of Industrial & Management Optimization, 2008, 4 (4) : 739-755. doi: 10.3934/jimo.2008.4.739
[7]	Wataru Nakamura, Yasushi Narushima, Hiroshi Yabe. Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization. Journal of Industrial & Management Optimization, 2013, 9 (3) : 595-619. doi: 10.3934/jimo.2013.9.595
[8]	Wei-Zhe Gu, Li-Yong Lu. The linear convergence of a derivative-free descent method for nonlinear complementarity problems. Journal of Industrial & Management Optimization, 2017, 13 (2) : 531-548. doi: 10.3934/jimo.2016030
[9]	Xiaming Chen. Kernel-based online gradient descent using distributed approach. Mathematical Foundations of Computing, 2019, 2 (1) : 1-9. doi: 10.3934/mfc.2019001
[10]	Andrea Malchiodi. Construction of multidimensional spike-layers. Discrete & Continuous Dynamical Systems - A, 2006, 14 (1) : 187-202. doi: 10.3934/dcds.2006.14.187
[11]	Elisavet Konstantinou, Aristides Kontogeorgis. Some remarks on the construction of class polynomials. Advances in Mathematics of Communications, 2011, 5 (1) : 109-118. doi: 10.3934/amc.2011.5.109
[12]	Chadi Nour. Construction of solutions to a global Eikonal equation. Conference Publications, 2007, 2007 (Special) : 779-783. doi: 10.3934/proc.2007.2007.779
[13]	Heide Gluesing-Luerssen, Carolyn Troha. Construction of subspace codes through linkage. Advances in Mathematics of Communications, 2016, 10 (3) : 525-540. doi: 10.3934/amc.2016023
[14]	Octav Cornea and Francois Lalonde. Cluster homology: An overview of the construction and results. Electronic Research Announcements, 2006, 12: 1-12.
[15]	Peter Giesl, Holger Wendland. Construction of a contraction metric by meshless collocation. Discrete & Continuous Dynamical Systems - B, 2019, 24 (8) : 3843-3863. doi: 10.3934/dcdsb.2018333
[16]	Saman Babaie–Kafaki, Reza Ghanbari. A class of descent four–term extension of the Dai–Liao conjugate gradient method based on the scaled memoryless BFGS update. Journal of Industrial & Management Optimization, 2017, 13 (2) : 649-658. doi: 10.3934/jimo.2016038
[17]	Yingying Li, Stanley Osher. Coordinate descent optimization for l¹ minimization with application to compressed sensing; a greedy algorithm. Inverse Problems & Imaging, 2009, 3 (3) : 487-503. doi: 10.3934/ipi.2009.3.487
[18]	Gaohang Yu, Lutai Guan, Guoyin Li. Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property. Journal of Industrial & Management Optimization, 2008, 4 (3) : 565-579. doi: 10.3934/jimo.2008.4.565
[19]	M. S. Lee, B. S. Goh, H. G. Harno, K. H. Lim. On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints. Numerical Algebra, Control & Optimization, 2018, 8 (3) : 315-326. doi: 10.3934/naco.2018020
[20]	Rodolfo Mendoza-Gómez, Roger Z. Ríos-Mercado, Karla B. Valenzuela-Ocaña. An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-29. doi: 10.3934/jimo.2018182

2018 Impact Factor: 0.263

American Institute of Mathematical Sciences