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

We study $R$-groups for $p$-adic inner forms of quasi-split special unitary groups. We prove Arthur's conjecture, the isomorphism between the Knapp-Stein $R$-group and the Langlands-Arthur $R$-group, for quasi-split special unitary groups…

The classical fiber product in algebraic geometry provides a powerful tool for studying loci where two morphisms to a base scheme, $\phi: X \to S$ and $\psi: Y \to S$, coincide exactly. This condition of strict equality, however, is…

We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to…

The local spectrum of a vertex set in a graph has been proven to be very useful to study some of its metric properties. It also has applications in the area of pseudo-distance-regularity around a set and can be used to obtain quasi-spectral…

For a generic $L$-parameter of $U(n)\times U(n)$, it is conjectured that there is a unique representation in their associated relevant Vogan $L$-packet which produces the unique Fourier-Jacobi model. We investigated this conjecture for some…

Let F be a non-archimedean local field, of characteristic 0. Let V be a finite dimensional vector space over F and q be a non-degenerate quadratic form on V. Denote d the dimension of V and G=SO(d) the special orthogonal group of (V,q). Let…

Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations…

Many quantum computing workflows manipulate long lists of Pauli strings. A basic classical subroutine involves taking $m$ Pauli strings on $n$ qubits, each of weight bounded by a constant, to determine if they are pairwise commuting,…

The alignment of shapes has been a crucial step in statistical shape analysis, for example, in calculating mean shape, detecting locational differences between two shape populations, and classification. Procrustes alignment is the most…

Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…

The present thesis studies structural properties of non-crossing partitions associated to finite Coxeter groups from both algebraic and geometric perspectives. On the one hand, non-crossing partitions are lattices, and on the other hand, we…

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

A systematic study of closed classical orbits of the hydrogen atom in crossed electric and magnetic fields is presented. We develop a local bifurcation theory for closed orbits which is analogous to the well-known bifurcation theory for…

Abstract. The Set Intersection Problem (SIP) is the problem of finding a point in the intersection of convex sets. This problem is typically solved by the method of alternating projections. To accelerate the convergence, the idea of using…

Let $\mathbf{G}$ be an unramified quasi-split unitary group over a p-adic field of odd residual characteristic. The goal of this paper is to describe the supercuspidal representations within certain L-packets of $\mathbf{G}$, which are…

Determining the crossing numbers of Cartesian products of small graphs with arbitrarily large paths has been an ongoing topic of research since the 1970s. Doing so requires the establishment of coincident upper and lower bounds; the former…

Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…

Let G be a unitary, symplectic or special orthogonal group over a locally compact non-archimedean local field of odd residual characteristic. We construct many new supercuspidal representations of G, and Bushnell-Kutzko types for these…

When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has…