Related papers: Finite group characters on free resolutions
We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…
Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…
In this paper we study algebras of modular forms on unitary groups of signature $(n,1)$. We give a necessary and sufficient condition for an algebra of unitary modular forms to be free in terms of the modular Jacobian. As a corollary we…
Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…
We prove a result that can be applied to determine the finite-dimensional simple Poisson modules over a Poisson algebra and apply it to numerous examples. In the discussion of the examples, the emphasis is on the correspondence with the…
The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation of the algorithm is available to download from [19]. The exposition is…
The equivariant cohomology for actions of compact connected abelian groups and elementary abelian p-groups have been widely studied in the last decades. We study some of these results on actions of finite cyclic groups over a field of…
In this paper we present a new characterization of free group actions (in classical differential geometry), involving dynamical systems and representations of the corresponding transformation groups. In fact, given a dynamical system, we…
We classify the finite groups whose non-linear irreducible characters that are not conjugate under the natural Galois action have distinct degrees, therefore extending the results in Berkovich et al. [Proc. Amer. Math. Soc. {\bf 115}…
This paper extends the results of Boij, Eisenbud, Erman, Schreyer, and S\"oderberg on the structure of Betti cones of finitely generated graded modules and finite free complexes over polynomial rings, to all finitely generated graded rings…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
A recent result of Eisenbud-Schreyer and Boij-S\"oderberg proves that the Betti diagram of any graded module decomposes as a positive rational linear combination of pure diagrams. When does this numerical decomposition correspond to an…
We present a general algorithm for constructing a free resolution for unit groups of orders in semisimple rational algebras. The approach is based on computing a contractible $G$-complex employing the theory of minimal classes of quadratic…
Finite determinacy for mappings has been classically thoroughly studied in numerous scenarios in the real- and complex-analytic category and in the differentiable case. It means that the map-germ is determined, up to a given equivalence…
Here we present a working framework to establish finite abelian groups in python. The primary aim is to allow new A-level students to work with examples of finite abelian groups using open source software. We include the code used in the…
In this expository article intended to be accessible to undergraduate students we introduce a finite abelian group that can be associated to any finite connected graph. This group can be defined in an elementary combinatorial way in terms…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.
In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.