Related papers: $p$-numerical semigroup of generalized Fibonacci t…

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

In this paper we present the notion of arithmetic variety for numerical semigroups. We study various aspects related to these varieties such as the smallest arithmetic that contains a set of numerical semigroups and we exhibit the root…

Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…

For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibonacci numbers, where the order of the summands does not matter. Moreover, for all positive integers $p$ and $N$, let \begin{equation*}…

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…

We define the concentration of a numerical semigroup $S$ as $\mathsf{C}(S)=\max \left\{\text{next}_S(s)-s ~|~ s\in S \backslash \{0\}\right\}$ wherein $\text{next}_S(s)=\min\left\{x \in S ~|~ s<x\right\}$. In this paper, we study the class…

We consider symmetric polynomials, p, in the noncommutative free variables (x_1, x_2, ..., x_g). We define the noncommutative complex hessian of p and we call a noncommutative symmetric polynomial noncommutative plurisubharmonic if it has a…

We consider numerical semigroups $S_3 = \langle d_1,d_2,d_3\rangle$, minimally generated by three positive integers. We revisit the Wilf question in $S_3$ and, making use of identities for degrees of syzygies of such semigroups, give a…

For any rational prime $p$, we define a certain $p$-stabilization of holomorphic Siegel Eisenstein series for the symplectic group $\text{Sp}(2n)_{/\mathbb{Q}}$ of an arbitrary genus $n \ge 1$. In addition, we derive an explicit formula for…

Let $(F_n)_{n\ge 1}$ be the Fibonacci sequence. Define $P(F_n): = (\sum_{i=1}^n F_i)_{n\ge 1}$; that is, the function $P$ gives the sequence of partial sums of $(F_n)$. In this paper, we first give an identity involving $P^k(F_n)$, which is…

The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive $1$s. Recently Jianxin Wei and Yujun Yang introduced a one parameter generalization, Fibonacci $p$-cubes $\Gamma_n^p$, which are…

Let H = <n_1,...,n_e> be a numerical semigroup generated by e elements. Let k[H]= k[x_1, .... , x_e]/I_H = S/I_H be the semigroup ring of H over k. We define inverse polynomial J_{H,h} for h in H and express the defining ideal of I_H using…

Let $\mathcal{C}\subseteq \mathbb{N}^p$ be an integer cone. A $\mathcal{C}$-semigroup $S\subseteq \mathcal{C}$ is an affine semigroup such that the set $\mathcal{C}\setminus S$ is finite. Such $\mathcal{C}$-semigroups are central to our…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

In this study, we introduce a new classes of quaternion numbers. We show that this new classes quaternion numbers include all of quaternion numbers such as Fibonacci, Lucas, Pell, Jacobsthal, Pell-Lucas, Jacobsthal-Lucas quaternions have…

Let $p$ be a prime number. We compute the trivial source character tables of finite Frobenius groups $G$ with an abelian Frobenius complement $H$ and an elementary abelian Frobenius kernel of order $p^2$. More precisely, we deal with all…

This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…

Let $n$ be a positive integer greater than $2$. We define \textit{the Proth numerical semigroup}, $P_{k}(n)$, generated by $\{k 2^{n+i}+1 \,\mid\, i \in \mathbb{N}\}$, where $k$ is an odd positive number and $k < 2^{n}$. In this paper, we…

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…

Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…