Related papers: Rewriting as a Special Case of Noncommutative Groe…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…
We study frequent hypercyclicity in the context of strongly continuous semigroups of operators. More precisely, we give a criterion (sufficient condition) for a semigroup to be frequently hypercyclic, whose formulation depends on the Pettis…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
General coherence theorems are constructed that yield explicit presentations of categorical and algebraic objects. The categorical structures involved are finitary discrete Lawvere 2-theories, though they are approached within the language…
A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two \S_r-irreducibles into irreducibles.…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
Given a group G, we construct, in a canonical way, an inverse semigroup S(G) associated to G. The actions of S(G) are shown to be in one-to-one correspondence with the partial actions of G, both in the case of actions on a set, and that of…
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…
This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…
We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…
In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…
This paper is a tutorial in a general and explicit procedure to simplify semidefinite programs which are invariant under the action of a symmetry group. The procedure is based on basic notions of representation theory of finite groups. As…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
For the whole class of linear term rewriting systems, we define \emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze…
Let E be a division ring and G a finite group of automorphisms of E whose elements are distinct modulo inner automorphisms of E. Given a representation \rho: B-> GL(d,E) of an F-algebra B, we give necessary and sufficient conditions for…
Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progression and such collection is also piecewise syndetic in Z. They used algebraic structure of beta N. The above result…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
Signature-based algorithms are the latest and most efficient approach as of today to compute Gr\"obner bases for polynomial systems over fields. Recently, possible extensions of these techniques to general rings have attracted the attention…