Related papers: An optimal representation for the trace zero subgr…
Hypergraphs capture multi-way relationships in data, and they have consequently seen a number of applications in higher-order network analysis, computer vision, geometry processing, and machine learning. In this paper, we develop…
Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal…
We present various results on disconnected reductive groups, in particular about the characteristic 0 representation theory of such groups over finite fields.
We use graded Specht modules to calculate the graded decomposition numbers for the Iwahori-Hecke algebra of the symmetric group over a field of characteristic zero at a root of unity. The algorithm arrived at is the Lascoux-Leclerc-Thibon…
We reduce the computation of Poisson traces on quotients of symplectic vector spaces by finite subgroups of symplectic automorphisms to a finite one, by proving several results which bound the degrees of such traces as well as the dimension…
We classify non-polar irreducible representations of connected compact Lie groups whose orbit space is isometric to that of a representation of a finite extension of $Sp(1)^k$ for some $k>0$. It follows that they are obtained from isotropy…
Let $\Fth$ be a $\Bk$-graph on a single vertex. We show that every irreducible atomic $*$-representation is the minimal $*$-dilation of a group construction representation. It follows that every atomic representation decomposes as a direct…
For any maximal surface group representation into $\mathrm{SO}_0(2,n+1)$, we introduce a non-degenerate scalar product on the the first cohomology group of the surface with values in the associated flat bundle. In particular, it gives rise…
Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let $0<p<1$ be constant and let $G\sim G_{n,p}$. Let $odd(G)$ be the…
Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…
This paper aims to use topological methods to compute $\mathrm{Ext}$ between an irreducible representation of a finite monoid inflated from its group completion and one inflated from its group of units, or more generally coinduced from a…
For a discrete memoryless channel with finite input and output alphabets, we prove convergence of a parametric family of iterative computations of the optimal correct-decoding exponent. The exponent, as a function of communication rate, is…
Lie-Trotter-Suzuki decompositions are an efficient way to approximate operator exponentials $\exp(t H)$ when $H$ is a sum of $n$ (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution…
We study Picard groups and Picard functors of perfectoid spaces which are limits of rigid spaces. For sufficiently large covers that are limits of rigid spaces of good reduction, we show that the Picard functor can be represented by the…
We study isometric representations of product systems of correspondences over the semigroup $\mathbb{N}^k$ which are minimal dilations of finite dimensional, fully coisometric representations. We show the existence of a unique minimal…
We describe the maximal torus and maximal unipotent subgroup of the Picard variety of a proper scheme over a perfect field.
Let G be a complex reductive linear algebraic group and let K be a maximal compact subgroup of G. Given a nilpotent group \Gamma generated by r elements, we consider the representation spaces Hom(\Gamma,G) and Hom(\Gamma,K) with the natural…
Clustering trajectories is a central challenge when faced with large amounts of movement data such as GPS data. We study a clustering problem that can be stated as a geometric set cover problem: Given a polygonal curve of complexity $n$,…
A dot-product representation of a graph is a mapping of its vertices to vectors of length $k$ so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of their corresponding vertices exceeds some threshold.…
Tensors, which provide a powerful and flexible model for representing multi-attribute data and multi-way interactions, play an indispensable role in modern data science across various fields in science and engineering. A fundamental task is…