Related papers: Langlands Program and Ramanujan Conjecture: a surv…
We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling…
This Survey provides an overview of techniques in termination analysis for programs with numerical variables and transitions defined by linear constraints. This subarea of program analysis is challenging due to the existence of undecidable…
Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating…
The study of a machine learning problem is in many ways is difficult to separate from the study of the loss function being used. One avenue of inquiry has been to look at these loss functions in terms of their properties as scoring rules…
We provide a definition for an extended system of $\gamma$-factors for products of generic representations $\tau$ and $\pi$ of split classical groups or general linear groups over a non-archimedean local field of characteristic $p$. We…
Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup) algorithm on this data. In the LP methodology one aims at…
These notes are very informal notes on the Langlands program. I had some pleasure in daring to ask colleagues to explain to me the importance of some of the recent results on Langlands program, so I thought I will record (to the best of my…
The object of this work is the spinor L-function of degree 3 and certain degeneration related to the functoriality principle. We study liftings of automorphic forms on the pair of symplectic groups $(\text{GSp}(2),\text{GSp}(4))$ to…
A sparse linear programming (SLP) problem is a linear programming problem equipped with a sparsity (or cardinality) constraint, which is nonconvex and discontinuous theoretically and generally NP-hard computationally due to the…
We prove that a strengthened form of the local Langlands conjecture is valid throughout the principal series of any connected split reductive $p$-adic group. The method of proof is to establish the presence of a very simple geometric…
Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our main results concern relationships with…
We give an introduction to the "categorical" approach to the p-adic Langlands program, in both the "Banach" and "analytic" settings.
This paper investigates the capabilities of large language models (LLMs) in formulating and solving decision-making problems using mathematical programming. We first conduct a systematic review and meta-analysis of recent literature to…
If one proposes to use the theory of Eisenstein cohomology to prove algebraicity results for the special values of automorphic L-functions as in my work with Harder for Rankin-Selberg L-functions, or its generalizations as in my work with…
We consider from a geometric point of view the conjectural fundamental lemma of Langlands and Shelstad for unitary groups over a local field of positive characteristic. We introduce projective algebraic varieties over the finite residue…
Embeddings play a pivotal role across various disciplines, offering compact representations of complex data structures. Randomized methods like Johnson-Lindenstrauss (JL) provide state-of-the-art and essentially unimprovable theoretical…
We study the relation of $L$-equivalence, which derives from the construction of the free locally convex spaces, through a concept that particularizes several notions related to the simultaneous extension of continuous functions. We also…
The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…
We study the preorder $\le_p$ on the family of subsets of an algebraically closed field of characteristic $0$ defined by letting $A\le_pB $ if there exists a polynomial $P$ such that $A=P^{-1}(B)$.
This is a report on the work of Robert Langlands, following his award of the Abel Prize in 2018. It includes his contributions to the general areas of Representation Theory, Automorphic Forms, Number Theory and Arithmetic Geometry. We have…