Related papers: The Structure of Root Data and Smooth Regular Embe…
Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension…
It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…
We prove that the stable endomorphism rings of rigid objects in a suitable Frobenius category have only finitely many basic algebras in their derived equivalence class and that these are precisely the stable endomorphism rings of objects…
This is a draft of a monograph to appear in the Springer series "Encyclopaedia of Mathematical Sciences", subseries "Invariant Theory and Algebraic Transformation Groups". The subject is homogeneous spaces of algebraic groups and their…
The recovery of the intrinsic geometric structures of data collections is an important problem in data analysis. Supervised extensions of several manifold learning approaches have been proposed in the recent years. Meanwhile, existing…
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
We construct infinite rank summands isomorphic to $\mathbb{Z}^\infty$ in the higher homotopy and homology groups of the diffeomorphism groups of certain $4$-manifolds. These spherical families become trivial in the homotopy and homology…
Given $G$ an algebraic reductive group over an algebraically closed field of characteristic zero and $\Gamma$ a finitely generated group, we provide a stratification of the $G$-character variety of $\Gamma$ in terms of conjugacy classes of…
Most real-world datasets consist of a natural hierarchy between classes or an inherent label structure that is either already available or can be constructed cheaply. However, most existing representation learning methods ignore this…
Splint is a decomposition of root system into union of root systems. Splint of root system for simple Lie algebra appears naturally in studies of (regular) embeddings of reductive subalgebras. Splint can be used to construct branching…
The classification of unitary representations for the non-compact real form E6(-14) of the exceptional Lie group E6 has long been hindered by computational bottlenecks due to its complex root system (72 roots) and large Weyl group (order…
We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij--Soederberg theory. That is, given a Betti diagram, we decompose it into pure diagrams. Relaxing the requirement that the degree sequences…
We introduce continuous Wilson lines to reduce the rank of the gauge group in orbifold constructions. In situations where the orbifold twist can be realised as a rotation in the root lattice of a grand unified group we derive an appealing…
We introduce directional regularity, a new definition of anisotropy for multivariate functional data. Instead of taking the conventional view, which determines anisotropy as a notion of smoothness along a dimension, directional regularity…
While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods are not amenable to the analysis of such manifolds. This is mainly…
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…
Many data-rich industries are interested in the efficient discovery and modelling of structures underlying large data sets, as it allows for the fast triage and dimension reduction of large volumes of data embedded in high dimensional…
In this second article, we continue to study classes of groups constructed from a functorial method due to Vaughan Jones. A key observation of the author shows that these groups have remarkable diagrammatic properties that can be used to…