Related papers: A Reduction Algorithm for Hilbert Modular Groups
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…
These notes are our contribution to the Proceedings of the ICM 2026. We discuss some results we have obtained (in part jointly with coauthors) regarding the representation theory of reductive algebraic groups over algebraically closed…
The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.
Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example,…
In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving…
Modular reduction is a crucial operation in many post-quantum cryptographic schemes, including the Kyber key exchange method or Dilithium signature scheme. However, it can be computationally expensive and pose a performance bottleneck in…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
A general theory of vector-valued modular functions, holomorphic in the upper half-plane, is presented for finite dimensional representations of the modular group. This also provides a description of vector-valued modular forms of arbitrary…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
Submodular optimization has received significant attention in both practice and theory, as a wide array of problems in machine learning, auction theory, and combinatorial optimization have submodular structure. In practice, these problems…
We deal with the reduction theory of a $W^*$-algebra $M$ along a $W^*$-subalgebra $Z$ of the centre of $M$. This is done by using Hilbert modules naturally constructed by suitable spatial representations of the abelian $W^*$-algebra $Z$. We…
Rigged modules over an operator algebra are a generalization of Hilbert modules over a $C^{\star}$-algebra. We characterize the rigged modules over an operator algebra $\mathcal A$ which are orthogonally complemented in $C_\infty(\mathcal…
The descent algebra of the symmetric group, over a field of non-zero characteristic p, is studied. A homomorphism into the algebra of generalised p-modular characters of the symmetric group is defined. This is then used to determine the…
We present a method for computing the Hilbert series of the algebra of invariants of the complex symplectic and orthogonal groups acting on graded noncommutative algebras with homogeneous components which are polynomial modules of the…
The aim of the present paper is to obtain a classification of all the irreducible modular representations of the symmetric group on $n$ letters of dimension at most $n^3$, including dimension formulae. This is achieved by improving an idea,…
The theory of modular deformations is generalized for the category of complex analytic polyhedra which includes germs of complex space as well as any compact complex analytic space. The objective of the theory is a construction of fine…
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…
In the paper, effective filtering for a type of slow-fast data assimilation systems in Hilbert spaces is considered. Firstly, the system is reduced to a system on a random invariant manifold. Secondly, nonlinear filtering of the origin…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…