Related papers: Factorization length distribution for affine semig…
Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…
Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
We present a new algorithm to explore or count the numerical semigroups of a given genus which uses the unleaved version of the tree of numerical semigroups. In the unleaved tree there are no leaves rather than the ones at depth equal to…
In this paper we introduce the notion of weighted (weakly) almost periodic compactifcation of a semitopological semigroup and generalize this notion to corresponding notion for transformation semigroup.The inclusion relation and equality of…
We investigate S^3/Z_n partition function of 3d N = 2 supersymmetric field theories. In a gauge theory the partition function is the sum of the contributions of sectors specified by holonomies, and we should carefully choose the relative…
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
This work extends the results known for the Delta sets of non-symmetric numerical semigroups with embedding dimension three to the symmetric case. Thus, we have a fast algorithm to compute the Delta set of any embedding dimension three…
In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…
We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with…
Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…
In this paper we present an efficient numerical approach based on the Renormalization Group method for the computation of self-similar dynamics. The latter arise, for instance, as the long-time asymptotic behavior of solutions to nonlinear…
This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. In part I, we studied the behavior of coefficients in the partial fraction decomposition of this…
We characterize affine semigroups having one Betti element and we compute some relevant non-unique factorization invariants for these semigroups. As an example, we particularize our description to numerical semigroups.
In this paper, we propose new semiparametric procedures for making inference on linear functionals and their functions of two semicontinuous populations. The distribution of each population is usually characterized by a mixture of a…
We calculate full asymptotic expansions of prime-independent multiplicative functions on additive arithmetic semigroups that satisfy a strong form of Knopfmacher's axioms. When applied to the semigroup of unlabeled graphs, our method yields…
We consider exponential ultradistribution semigroups with non--densely defined generators and give structural theorems for ultradistribution semigroups. Also structural theorems for exponential ultradistribution semigroups are given.