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

Tree-level scattering amplitudes of particles have a geometrical description in terms of intersection numbers of pairs of twisted differential forms on the moduli space of Riemann spheres with punctures. We customize a catalog of twisted…

The goal of this paper is to prove how Arthur's results, in the case of split odd orthogonal p-adic groups, imply the Langlands' classification of discrete series. Of course this need the validity of ''fundamental'' lemmas which are not yet…

In this paper we study the local theta correspondences between epipelagic supercupsidal representations of a type I classical dual pair $(G,G')$ over $p$-adic fields. We show that, besides an exceptional case, an epipelagic supercupsidal…

Intersection graphs of planar geometric objects such as intervals, disks, rectangles and pseudo-disks are well studied. Motivated by various applications, Butman et al. in SODA 2007 considered algorithmic questions in intersection graphs of…

We study the algebra Sp(n,R) of the symplectic model, in particular for the cases n=1,2,3, in a new way. Starting from the Poisson-bracket realization we derive a set of partial differential equations for the generators as functions of…

We study the intersection theory of punctured pseudoholomorphic curves in $4$-dimensional symplectic cobordisms. We first study the local intersection properties of such curves at the punctures. We then use this to develop topological…

If $E/F$ is a quadratic extension $p$-adic fields, we first prove that the $\mathrm{SL}_n(F)$-distinguished representations inside a distinguished unitary L-packet of $\mathrm{SL}_n(E)$ are precisely those admitting a degenerate Whittaker…

Let $G \subseteq \tilde{G}$ be two quasisplit connected reductive groups over a local field of characteristic zero and $G_{der} = \tilde{G}_{der}$. Although the existence of L-packets is still conjectural in general, it is believed that the…

This article highlights interactions of diverse areas: the Heron formula for the area of a triangle, the Descartes circle equation, and right triangles with integer or rational sides. New and old results are synthesized. We show that every…

In this paper, we define locally matchable subsets of a group which is extracted 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…

We have introduced recently a particles model with blocking and pushing interactions which is related to a Pieri type formula for the orthogonal group. This model has a symplectic version presented here.

We apply the tropical intersection theory developed by L. Allermann and J. Rau to compute intersection products of tropical Psi-classes on the moduli space of rational tropical curves. We show that in the case of zero-dimensional (stable)…

Circuit topology refers to the arrangement of interactions between objects belonging to a linearly ordered object set. Linearly ordered set of objects are common in nature and occur in a wide range of applications in economics, computer…

We investigate the large intersection properties of the set of points that are approximated at a certain rate by a family of affine subspaces. We then apply our results to various sets arising in the metric theory of Diophantine…

Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However, algorithms for a line intersection with other surfaces are…

Geometric embeddings have recently received attention for their natural ability to represent transitive asymmetric relations via containment. Box embeddings, where objects are represented by n-dimensional hyperrectangles, are a particularly…

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

We exploit the classical correspondence between finitely generated abelian groups and abelian complex algebraic reductive groups to study the intersection theory of translated subgroups in an abelian complex algebraic reductive group, with…

We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when parameterized by the vertex cover size. This is a notable…

In information theory, we often use intersection and union of the typical sets to analyze various communication problems. However, in the quantum setting it is not very clear how to construct a measurement which behaves analogously to…