Related papers: InfoMod: A visual and computational approach to Ga…

A computational fluid model is developed to study waves and instabilities. A new technique involving initial perturbations in configuration space have been implemented to excite the plasma waves; i.e. the perturbations acting similar to a…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

We study the commutator subgroup of integral orthogonal groups belonging to indefinite quadratic forms. We show that the index of this commutator is 2 for many groups that occur in the construction of moduli spaces in algebraic geometry, in…

Predicting drug efficacy and safety in vivo requires information on biological responses (e.g., cell morphology and gene expression) to small molecule perturbations. However, current molecular representation learning methods do not provide…

This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.

Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…

The set of modular invariants that can be obtained from Galois transformations is investigated systematically for WZW models. It is shown that a large subset of Galois modular invariants coincides with simple current invariants. For…

We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different…

The classical quadratic Gauss sum can be thought of as an exponential sum attached to a quadratic form on a cyclic group. We introduce an equivariant version of Gauss sum for arbitrary finite quadratic forms, which is an exponential sum…

We present the SLIM (https://github.com/slimgroup) open-source software framework for computational geophysics, and more generally, inverse problems based on the wave-equation (e.g., medical ultrasound). We developed a software environment…

Topological order of a topological phase of matter in two spacial dimensions is encoded by a unitary modular (tensor) category (UMC). A group symmetry of the topological phase induces a group symmetry of its corresponding UMC. Gauging is a…

In a recent paper, Dave Benson and Peter Symonds defined a new invariant $\gamma_G(M)$ for a finite dimensional module $M$ of a finite group $G$ which attempts to quantify how close a module is to being projective. In this paper, we…

In previous works, we described algorithms to compute the number field cut out by the mod ell representation attached to a modular form of level N=1. In this article, we explain how these algorithms can be generalised to forms of higher…

Logical query answering over Knowledge Graphs (KGs) is a fundamental yet complex task. A promising approach to achieve this is to embed queries and entities jointly into the same embedding space. Research along this line suggests that using…

Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…

For solving linear inverse problems, particularly of the type that appears in tomographic imaging and compressive sensing, this paper develops two new approaches. The first approach is an iterative algorithm that minimizes a regularized…

Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in…

3D Gaussians, as a low-level scene representation, typically involve thousands to millions of Gaussians. This makes it difficult to control the scene in ways that reflect the underlying dynamic structure, where the number of independent…

When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier…

In this work, we study several variants of matrix reduction via Gaussian elimination that try to keep the reduced matrix sparse. The motivation comes from the growing field of topological data analysis where matrix reduction is the major…