Related papers: On the computation of factorization invariants for…
We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
We address the problem of classifying complete $\mathbb{C}$-subalgebras of $\mathbb{C}[[t]]$. A discrete invariant for this classification problem is the semigroup of orders of the elements in a given $\mathbb{C}$-subalgebra. Hence we can…
The group of units modulo constants of an affine variety over an algebraically closed field is free abelian of finite rank. Computing this group is difficult but of fundamental importance in tropical geometry, where it is desirable to…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
The aim of this paper is to study the $p$-Frobenius vector of affine semigroups $S\subset \mathbb N^q$; that is, the maximum element, with respect to a graded monomial order, with at most $p$ factorizations in $S$. We produce several…
The notion of mixed representations of quivers can be derived from ordinary quiver representations by considering the dual action of groups on "vertex" vector spaces together with the usual action. A generating system for the algebra of…
In earlier work, the first author outlined an algorithm for calculating a parametrization of the conjugacy classes in a Sylow $p$-subgroup $U(q)$ of a finite Chevalley group $G(q)$, valid when $q$ is a power of a good prime for $G(q)$. In…
We develop a natural variant of Dikin's affine-scaling method, first for semidefinite programming and then for hyperbolic programming in general. We match the best complexity bounds known for interior-point methods. All previous…
Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X]^G in the case where G is reductive. Furthermore, we address the case where G is connected and…
We prove that the category of commutative Hopf algebras over a field $k$ is co-semi-abelian. Consequently, the category of affine group $k$-schemes is semi-abelian. We establish coregularity by identifying the orthogonal factorization…
The toric Hilbert scheme parametrizes all algebras isomorphic to a given semigroup algebra as a multigraded vectorspace. All components of the scheme are toric varieties, and among them, there is a fairly well understood coherent component.…
In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…
We study how certain invariants of numerical semigroups relate to the number of second kind gaps. Furthermore, given two fixed non-negative integers F and k, we provide an algorithm to compute all the numerical semigroups whose Frobenius…
We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…
We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
Let $\Gamma=\langle \alpha, \beta \rangle$ be a numerical semigroup. In this article we consider the dual $\Delta^*$ of a $\Gamma$-semimodule $\Delta$; in particular we deduce a formula that expresses the minimal set of generators of…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…