中文
相关论文

相关论文: Note on a question of Wilf

200 篇论文

Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…

A numerical semigroup $S$ is coated with odd elements (Coe-semigroup), if $\left\{x-1, x+1\right\}\subseteq S$ for all odd element $x$ in $S$. In this note, we will study this kind of numerical semigroups. In particular, we are interested…

交换代数 · 数学 2024-07-25 J. C. Rosales , M. B. Branco , M. A. Traesel

In this paper, we introduce and study the numerical semigroups generated by $\{a_1, a_2, \ldots \} \subset \mathbb{N}$ such that $a_1$ is the repunit number in base $b > 1$ of length $n > 1$ and $a_i - a_{i-1} = a\, b^{i-2},$ for every $i…

交换代数 · 数学 2021-12-14 Manuel B. Branco , Isabel Colaço , Ignacio Ojeda

Let $S\neq\mathbb N$ be a numerical semigroup generated by $e$ elements. In his paper (A Circle-Of-Lights Algorithm for the "Money-Changing Problem", Amer. Math. Monthly 85 (1978), 562--565), H.~S.~Wilf raised the following question: Let…

交换代数 · 数学 2018-04-19 Michael Hellus , Anton Rechenauer , Rolf Waldi

Let $n_g$ be the number of numerical semigroups of genus $g$. We present an approach to compute $n_g$ by using even gaps, and the question: Is it true that $n_{g+1}>n_g$? is investigated. Let $N_\gamma(g)$ be the number of numerical…

组合数学 · 数学 2017-08-15 Matheus Bernardini , Fernando Torres

Let $a,b$ be positive integers. In this note, we study the numerical semigroup $H=\left<a,a+1,b\right>$ and and the associated numerical semigroup ring $R=k[[H]]$. Under the certain conditions, we provide explicit formulas for the Frobenius…

群论 · 数学 2026-01-30 Do Van Kien , Pham Hung Quy

Let $0<\lambda\leq1$, $\lambda\notin\left\{\frac24, \frac27, \frac2{10}, \frac2{13}, \ldots\right\}$, be a real and $p$ a prime number, with $[p,p+\lambda p]$ containing at least two primes. Denote by $f_\lambda(p)$ the largest integer…

数论 · 数学 2022-03-02 Michael Hellus , Anton Rechenauer , Rolf Waldi

$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…

最优化与控制 · 数学 2015-03-24 Mehdi Ghasemi , Murray Marshall

Let $(R, \frak m)$ be a local ring of prime characteristic $p$ of dimension $d$ with the embedding dimension $v$. Suppose the Frobenius test exponent for parameter ideals $Fte(R)$ of $R$ is finite, and let $Q = p^{Fte(R)}$. It is shown that…

交换代数 · 数学 2019-10-17 Duong Thi Huong , Pham Hung Quy

Consider a sequence of positive integers of the form $ca^n-d$, $n\geq 1$, where $a, c$ and $d$ are positive integers, $a>1$. For each $n\geq 1$, let $S_n$ be the submonoid of $\mathbb N$ generated by $\mathbf s_j=ca^{n+j}-d$, with…

数论 · 数学 2023-01-25 Fabián Arias , Jerson Borja

We study statistical properties of numerical semigroups of genus $g$ as $g$ goes to infinity. More specifically, we answer a question of Eliahou by showing that as $g$ goes to infinity, the proportion of numerical semigroups of genus $g$…

组合数学 · 数学 2022-11-16 Nathan Kaplan , Deepesh Singhal

Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\frac{n}{n -…

离散数学 · 计算机科学 2025-04-08 Hareshkumar Jadav , Sreekara Madyastha , Rahul Raut , Ranveer Singh

Given two numerical semigroups $S$ and $T$ and a positive integer $d$, $S$ is said to be one over $d$ of $T$ if $S=\{s \in \mathbb{N} \ | \ ds \in T \}$ and in this case $T$ is called a $d$-fold of $S$. We prove that the minimal genus of…

群论 · 数学 2015-12-03 Francesco Strazzanti

A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…

组合数学 · 数学 2025-03-27 Carmelo Cisto , Francesco Navarra

We introduce a new way of counting numerical semigroups, namely by their maximum primitive, and show its relation with the counting of numerical semigroups by their Frobenius number. We show that these two ways of counting are M\"obius…

组合数学 · 数学 2026-04-28 Manuel Delgado , Neeraj Kumar , Claude Marion

A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. The size of its complement is called the genus and the largest number in the complement is called its Frobenius number. We consider the set of…

组合数学 · 数学 2020-08-10 Deepesh Singhal

We study Wilf's conjecture for numerical semigroups $S$ such that the second least generator $a_2$ of $S$ satisfies $a_2>\frac{c(S)+\mu(S)}{3}$, where $c(S)$ is the conductor and $\mu(S)$ the multiplicity of $S$. In particular, we show that…

组合数学 · 数学 2017-10-26 Dario Spirito

We consider a proper parabolic subalgebra p of a simple Lie algebra g and the Inonu-Wigner contraction of p with respect to its decomposition into its standard Levi factor and its nilpotent radical : this is the Lie algebra which is…

表示论 · 数学 2025-04-25 Florence Fauquant-Millet

In this article, we classify all symmetric generalized numerical semigroups in $\mathbb{N}^d$ of embedding dimension $2d+1$. Consequently, we show that in this case the property of being symmetric is equivalent to have a unique maximal gap…

交换代数 · 数学 2025-07-15 Om Prakash Bhardwaj , Carmelo Cisto

Let S $\subseteq$ N be a numerical semigroup with multiplicity m, conductor c and minimal generating set P. Let L = S $\cap$ [0, c -- 1] and W(S) = |P||L| -- c. In 1978, Herbert Wilf asked whether W(S) $\ge$ 0 always holds, a question known…

组合数学 · 数学 2021-08-19 Shalom Eliahou , Jean Fromentin