Related papers: On the intersection of local Arthur packets for cl…

Grothendieck point residue is considered in the context of computational complex analysis. A new effective method is proposed for computing Grothendieck point residues mappings and residues. Basic ideas of our approach are the use of…

We establish an arithmetic intersection theory in the framework of Arakelov geometry over adelic curves. To each projective scheme over an adelic curve, we associate a multi-homogenous form on the group of adelic Cartier divisors, which can…

In this paper we introduce a variation on the multidimensional segment tree, formed by unifying different interpretations of the dimensionalities of the data structure. We give some new definitions to previously well-defined concepts that…

The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…

We model the societal task of redistricting political districts as a partitioning problem: Given a set of $n$ points in the plane, each belonging to one of two parties, and a parameter $k$, our goal is to compute a partition $\Pi$ of the…

We introduce a certain type of representations for the quantum Teichmuller space of a punctured surface, which we call local representations. We show that, up to finitely many choices, these purely algebraic representations are classified…

In this paper we establish the endoscopic classification of tempered representations of quasi-split unitary groups over local fields, and the endoscopic classification of the discrete automorphic spectrum of quasi-split unitary groups over…

The main problem is to understand and to find periodic symmetric orbits in the $n$-body problem, in the sense of finding methods to prove or compute their existence, and more importantly to describe their qualitative and quantitative…

Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the…

Local feature matching aims at establishing sparse correspondences between a pair of images. Recently, detector-free methods present generally better performance but are not satisfactory in image pairs with large scale differences. In this…

In arXiv:1208.1945, Shin and Templier proved certain equidistribution bounds on local components of certain families of automorphic representations. We extend their weight-aspect results to families of automorphic representations where the…

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. We consider a relaxed version of this problem in the setting of local algorithms. The relaxation is that the constructed subgraph is a sparse spanning…

For a connected reductive group $G$ over ${\mathbb R}$, we study cohomological $A$-parameters, which are Arthur parameters with the infinitesimal character of a finite-dimensional representation of $G({\mathbb C})$. We prove a structure…

We generalise a formula of Shou-Wu Zhang, which describes local arithmetic intersection numbers of three Cartier divisors with support in the special fibre on a a self-product of a semi-stable arithmetic surface using elementary analysis.…

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

By computing reducibility points of parabolically induced representations, we construct, to within at most two unramified quadratic characters, the Langlands parameter of an arbitrary depth zero irreducible cuspidal representation $\pi$ of…

In this paper, we reformulate conjectural formulas for the arithmetic intersection numbers of special cycles on unitary Shimura varieties with minuscule parahoric level structure in terms of weighted counting of lattices containing special…

This paper gives simple distributed algorithms for the fundamental problem of computing graph distances in the Congested Clique model. One of the main components of our algorithms is fast matrix multiplication, for which we show an…

Let G be a classical p-adic group and $(\psi ,\epsilon)$ the Langlands parameter of an irreducible supercuspidal representation of a Levi subgroup of G. Using data from $(\psi ,\epsilon)$, we determine explicitly the intertwining algebra of…