Related papers: Rewriting as a Special Case of Noncommutative Groe…

In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the…

We show that if the non Gaussian part of the cumulants of a random matrix model obey some scaling bounds in the size of the matrix, then Wigner's semicircle law holds. This result is derived using the replica technique and an analogue of…

We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…

We construct a new bounded functional calculus for the generators of bounded semigroups on Hilbert spaces and generators of bounded holomorphic semigroups on Banach spaces. The calculus is a natural (and strict) extension of the classical…

The purpose of this paper is to revisit the proof of the Gearhardt-Pr\"uss-Hwang-Greiner theorem for a semigroup $S(t)$, following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on $\Vert…

In this paper, our aim is twofold: First, by using the technique of gluing semigroups, we give infinitely many families of a projective closure with the Cohen-Macaulay (Gorenstein) property. Also, we give an effective technique for…

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…

Let consider $n$ natural numbers $a\_1 ,\ldots , a\_{n} $. Let $S$ be the numerical semigroup generated by $a\_1 ,\ldots , a\_{n} $. Set $A=K[t^{a\_1}, \ldots , t^{a\_n}]=K[{x\_1}, \ldots , {x\_n}]/I$. The aim of this paper is:…

We define a categorical framework in which we build a systematic construction that provides generic invariants for C*-algebras. The benefit is significant as we show that any invariant arising this way automatically enjoys nice properties…

This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each…

Let $G$ be a complex, linear algebraic group acting on an algebraic space $X$. The purpose of this paper is to prove a Riemann-Roch theorem (Theorem 5.3) which gives a description of the completion of the equivariant Grothendieck group…

The purpose of this paper is twofold. In the first part we concentrate on hyperplane sections of algebraic schemes, and present results for determining when Gr\"obner bases pass to the quotient and when they can be lifted. The main…

Let $(G,\pmb{+})$ be any given semimodule over a discrete semiring $(R,+,\cdot)$ with a finite coloring, say $G=B_1\cup\dotsm\cup B_q$. By establishing a Regional Multiple Recurrence Theorem for semimodules, we prove that one of the colors…

We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…

In this work we describe a method to reconstruct the braid monodromy of the preimage of a curve by a Kummer cover. This method is interesting, since it combines two techniques, namely, the reconstruction of a highly non-generic braid…

We provide partial results towards a conjectural generalization of a theorem of Lubotzky-Mozes-Raghunathan for arithmetic groups (over number fields or function fields) that implies, in low dimensions, both polynomial isoperimetric…

Let us consider a specialization of an untwisted quantum affine algebra of type $ADE$ at a nonzero complex number, which may or may not be a root of unity. The Grothendieck ring of its finite dimensional representations has two bases,…

A numerical semigroup $M$ is a subset of the non-negative integers that is closed under addition. A factorization of $n \in M$ is an expression of $n$ as a sum of generators of $M$, and the Graver basis of $M$ is a collection $Gr(M_t)$ of…

This paper is intended to provide foundations to the theory of Witt-type topological group and ring functors defined on a category of topological algebras, and, in presence of Banach norms, to show how to topologically deal with them. It is…

Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…