Related papers: On the intersection of local Arthur packets for cl…
We check Sakellaridis-Venkatesh conjectures giving a description of the discrete spectrum of a spherical variety $\mathscr{X}=G/H$ in the Langlands-Arthur formalism when $G$ is a classical real group and $\mathscr{X}$ is a symmetric space.…
The endoscopic classification via the stable trace formula comparison provides certain character relations between irreducible cuspidal automorphic representations of classical groups and their global Arthur parameters, which are certain…
In this paper we study branching laws for certain unitary representations. This is done on the smooth vectors via a version of the {\it period integrals}, studied in number theory, and also closely connected to the {\it symmetry-breaking…
Local Pl\"ucker formulas relate the vector of metrics on a holomorphic curve in the projective space, induced by the Fubini-Study metrics on projetive spaces via Pl\"ucker embeddings of associated curves, to the corresponding vector of…
Given the damping factor $\alpha$ and precision tolerance $\epsilon$, \citet{andersen2006local} introduced Approximate Personalized PageRank (APPR), the \textit{de facto local method} for approximating the PPR vector, with runtime bounded…
The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…
The detection and classification of intersections between triangles are crucial tasks in a wide range of applications within Computer Graphics and Geometry Processing, including mesh Arrangements, mesh Booleans, and generic mesh processing…
We exhibit a basis for the space of spherical characters of a distinguished supercuspidal representation $\pi$ of a connected reductive $p$-adic group, subject to the assumption that $\pi$ is obtained via induction from a representation of…
In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…
While obtaining optimal algorithms for the most important problems in the LOCAL model has been one of the central goals in the area of distributed algorithms since its infancy, tight complexity bounds are elusive for many problems even when…
We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…
Nous d\'ecrivons explicitement les paquets d'Arthur des groupes classiques complexes, ainsi que leur param\'etrisation interne par les caract\`eres du groupe des composantes connexes du centralisateur de leur param\`etre. Nous montrons…
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
Let $G$ be a classical group defined over a local field $F$ of characteristic zero. Let $\pi$ be an irreducible admissible representation $\pi$ of $G(F)$, which is of Casselman-Wallach type if $F$ is archimedean. If $\pi$ has a generic…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is restricted to intersection graphs of sets of axis-aligned…
We describe algorithms to represent and compute groups of Hecke characters. We make use of an id{\`e}lic point of view and obtain the whole family of such characters, including transcendental ones. We also show how to isolate the algebraic…
Imagine we want to split a group of agents into teams in the most \emph{efficient} way, considering that each agent has their own preferences about their teammates. This scenario is modeled by the extensively studied \textsc{Coalition…
In this work, we explicitly compute a certain family of twisted gamma factors of a simple supercuspidal representation $\pi$ of a $p$-adic odd orthogonal group. These computations, together with analogous computations for general linear…
Sweeping is a powerful and versatile method of designing objects. Boundary of volumes (henceforth envelope) obtained by sweeping solids have been extensively investigated in the past, though, obtaining an accurate parametrization of the…