Related papers: Arithmetic varieties of numerical semigroups
We define and study root graded groups, that is, groups graded by finite root systems. This notion generalises several existing concepts in the literature, including in particular Jacques Tits' notion of RGD-systems. The most prominent…
A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…
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…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we characterize the…
We generalize the notion of symmetric semigroups, pseudo symmetric semigroups, and row factorization matrices for pseudo Frobenius elements of numerical semigroups to the case of semigroups with maximal projective dimension (MPD…
The study of Frobenius endomorphism provides numerous information about its corresponding Abelian variety. To understand the action of the Frobenius endomorphism, one may be interested in its eigenvalues. According to Weil's third…
Motivated by the change-making problem, we extend the notion of greediness to sets of positive integers not containing the element $1$, and from there to numerical semigroups. We provide an algorithm to determine if a given set (not…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
We define a reflective numerical semigroup of genus $g$ as a numerical semigroup that has a certain reflective symmetry when viewed within $\mathbb{Z}$ as an array with $g$ columns. Equivalently, a reflective numerical semigroup has one gap…
We generalize and prove a hypothesis by V. Arnold on the parity of Frobenius number. For the case of symmetric semigroups with three generators of Frobenius numbers we found an exact formula, which in a sense is the sum of two Sylvester's…
We study suitable parameters and relations in a numerical semigroup S. When S is the Weierstrass semigroup at a rational point P of a projective curve C, we evaluate the Feng-Rao order bound of the associated family of Goppa codes. Further…
This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…
We give a categorical description of all abelian varieties with commutative endomorphism ring over a finite field with $q=p^a$ elements in a fixed isogeny class in terms of pairs consisting of a fractional $\mathbb Z[\pi,q/\pi]$-ideal and a…
In this work we will show that if $F$ is a positive integer, then ${\mathrm{Sat}}(F)=\{S\mid S \mbox{ is a saturated numerical semigroup with Frobenius number } F\}$ is a covariety. As a consequence, we present two algorithms: one that…
We introduce a new class of numerical semigroups, which we call the class of {\it acute} semigroups and we prove that they generalize symmetric and pseudo-symmetric numerical semigroups, Arf numerical semigroups and the semigroups generated…