Related papers: On the counting function for numerical monoids

We discuss representations of monogenic functions over very regular groups.

We construct arithmetic terms representing the partial sums of binomial coefficients, and we extend these results to obtain arithmetic terms representing the multisections of binomial coefficient sums. We also introduce an arithmetic term…

In this paper we give results on the counting function associated with the interior transmission eigenvalues. For a complex refraction index we estimate of the counting function by Ctn. In the case where the refraction index is positive we…

In this article we give an algorithm for computing the integral closure of a reduced Noetherian ring R, in case this integral closure is finitely generated over R.

We find a generalization of the Mordell integral and we also establish a set of properties for a generalization of the Mordell integral similar to those in the third author's PhD thesis.

We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

In this note, we give a simple method for computing the column sums of the Sonnenschein summability matrices.

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…

We introduce a $2$-approximation algorithm for the minimum total covering number problem.

Elementary proofs of unique factorization in rings of arithmetic functions using a simple variant of Euclid's proof for the fundamental theorem of arithmetic.

We give a monoid presentation in terms of generators and defining relations for the partial analogue of the finite dual inverse symmetric monoid.

The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.

We discuss the problem of counting vertices in Gelfand-Zetlin polytopes. Namely, we deduce a partial differential equation with constant coefficients on the exponential generating function for these numbers. For some particular classes of…

Nominal unification calculates substitutions that make terms involving binders equal modulo alpha-equivalence. Although nominal unification can be seen as equivalent to Miller's higher-order pattern unification, it has properties, such as…

We provide a countable series of bisimple $\mathcal{H}$-trivial finitely presented congruence-free monoids.

In the paper I study properties of random polynomials with respect to a general system of functions. Some lower bounds for the mathematical expectation of the uniform and recently introduced integral-uniform norms of random polynomials are…

Combinatorial and topological aspects of monoids with an absorbing element and their associated algebras are considered. Phd thesis.

A consistently specified halting function may be computed.