Related papers: A sequence of quasipolynomials arising from random…

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers, containing zero, with finite complement. Its multiplicity $m$ is its smallest nonzero element. The Apery set of $S$ is the set $\text{Ap}(S) = \{n \in S :…

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $\Delta_m$ that arises in the study of multigraded…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

We give two proofs of a folkore result relating numerical semigroups of embedding dimension two and binary cyclotomic polynomials and explore some consequences. In particular, we give a more conceptual reproof of a result of Hong et al.…

Let $\mathbb{N}^{d}$ be the $d$-dimensional monoid of non-negative integers. A generalized numerical semigroup is a submonoid $ S\subseteq \mathbb{N}^d$ such that $H(S)=\mathbb{N}^d \setminus S$ is a finite set. We introduce irreducible…

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…

In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…

A minor of a matrix is quasi-principal if it is a principal or an almost-principal minor. The quasi principal rank characteristic sequence (qpr-sequence) of an $n\times n$ symmetric matrix is introduced, which is defined as $q_1 q_2 \cdots…

We find a relation between the genus of a quotient of a numerical semigroup $S$ and the genus of $S$ itself. We use this identity to compute the genus of a quotient of $S$ when $S$ has embedding dimension $2$. We also exhibit identities…

In this paper we study numerical semigroups containing a given positive integer and closed with respect to the action of an affine map. For such semigroups we find a minimal set of generators, their embedding dimension, their genus and…

Let a, k, h, c be positive integers and d a non zero integer. Recall that a numerical generalized almost arithmetic semigroup S is a semigroup minimally generated by relatively prime positive integers a, ha + d, ha + 2d, . . . , ha + kd, c,…

The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…

Let $X$ be a nonempty set and $X^{2}$ be the Cartesian square of $X$. Some semigroups of binary relations generated partitions of $X^2$ are studied. In particular, the algebraic structure of semigroups generated by the finest partition of…

Finite hamiltonian groups are counted. The sequence of numbers of all groups of order $n$ all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to $n$ all whose subgroups are normal are presented.