Related papers: An evaluation approach to computing invariants rin…
Inspired by methods in prime characteristic in commutative algebra, we introduce and study combinatorial invariants of seminormal monoids. We relate such numbers with the singularities and homological invariants of the semigroup ring…
We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…
Gauge theories with finite gauge groups have applications to quantum simulation and quantum gravity. Recently, the exact number of gauge-invariant states was computed for pure gauge theories on arbitrary lattices. In this work, we…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
We define a new invariant of finitely generated representations of a finite group, with coefficients in a commutative noetherian ring. This invariant uses group cohomology and takes values in the singularity category of the coefficient…
In this paper, we explore a ring invariant which is closely related to the Davenport constant of a group. In particular, we will calculate this invariant for a certain class of rings of integers and their orders and use it to understand…
We introduce a numerical method, based on finite elements and lattice gauge theory, to compute approximate solutions to Schr\"odinger and Pauli equations. The crucial geometric property of the method is discrete gauge invariance. The main…
We offer a groupoid-theoretic approach to computing invariants. We illustrate this approach by describing the Gel'fand-MacPherson correspondence and the Gale transform as well as giving Zariski-local descriptions of the moduli space of…
In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…
This note deals with the computation of the factorization number $F_2(G)$ of a finite group $G$. By using the M\"{o}bius inversion formula, explicit expressions of $F_2(G)$ are obtained for two classes of finite abelian groups, improving…
We compute the {\Omega}^1(G) invariant when 1 {\to} H {\to} G {\to} K {\to} 1 is a split short exact sequence. We use this result to compute the invariant for pure and full braid groups on compact surfaces. Applications to twisted conjugacy…
We apply a novel method for the equivalence group and its infinitesimal generators to the investigation of invariants of linear ordinary differential equations. First, a comparative study of this method is illustrated by an example. Next,…
We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…
The Ising model is the simplest to describe many-body effects in classical statistical mechanics. Duality analysis leads to a critical point under several assumptions. The Ising model itself has $Z(2)$ symmetry. The basis of the duality…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…
In this paper we introduce an algebra embedding $\iota:K< X >\to S$ from the free associative algebra $K< X >$ generated by a finite or countable set $X$ into the skew monoid ring $S = P * \Sigma$ defined by the commutative polynomial ring…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
Signature-based algorithms have become a standard approach for Gr\"obner basis computations for polynomial systems over fields, but how to extend these techniques to coefficients in general rings is not yet as well understood. In this…