中文
相关论文

相关论文: An asymptotic result concerning a question of Wilf

200 篇论文

For a numerical semigroup S $\subseteq$ N with embedding dimension e, conductor c and left part L = S $\cap$ [0, c -- 1], set W (S) = e|L| -- c. In 1978 Wilf asked, in equivalent terms, whether W (S) $\ge$ 0 always holds, a question known…

组合数学 · 数学 2021-08-19 Shalom Eliahou , Daniel Marín-Aragón

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 $\Lambda(n)$ be the von Mangoldt function, and let $[t]$ be the integral part of real number $t$. In this note, we prove that for any $\varepsilon>0$ the asymptotic formula $$ \sum_{n\le x} \Lambda\Big(\Big[\frac{x}{n}\Big]\Big) =…

数论 · 数学 2021-05-25 Kui Liu , Jie Wu , Zhishan Yang

We give an affirmative answer to Wilf's conjecture for numerical semigroups satisfying 2 \nu \geq m, where \nu and m are respectively the embedding dimension and the multiplicity of a semigroup. The conjecture is also proved when m \leq 8…

交换代数 · 数学 2012-12-18 Alessio Sammartano

Let $S$ be a numerical semigroup of embedding dimension $e$ and conductor $c$. The question of Wilf is, if $\#(\mathbb N\setminus S)/c\leq e-1/e$. \noindent In (An asymptotic result concerning a question of Wilf, arXiv:1111.2779v1…

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

Let S $\subseteq$ N be a numerical semigroup with multiplicity m = min(S \ {0}), conductor c = max(N \ S) + 1 and minimally generated by e elements. Let L be the set of elements of S which are smaller than c. Wilf conjectured in 1978 that…

组合数学 · 数学 2021-08-19 S Eliahou

We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordell\`{e}s (2007),…

数论 · 数学 2020-02-06 Titus Hilberdink , Florian Luca , László Tóth

Given coprime positive integers $g_1 < \ldots < g_e$, the Frobenius number $F=F(g_1,\ldots,g_e)$ is the largest integer not representable as a linear combination of $g_1,\ldots,g_e$ with non-negative integer coefficients. Let $n$ denote the…

数论 · 数学 2022-08-31 Marco D'Anna , Alessio Moscariello

Let S $\subseteq$ N be a numerical semigroup with multiplicity m = min(S \ {0}) and conductor c = max(N \ S) + 1. Let P be the set of primitive elements of S, and let L be the set of elements of S which are smaller than c. A longstand-ing…

组合数学 · 数学 2021-08-19 Shalom Eliahou

Wilf Conjecture on numerical semigroups is an inequality connecting the Frobenius number, embedding dimension and the genus of the semigroup. The conjecture is still open in general. We prove that the Wilf inequality is preserved under…

交换代数 · 数学 2025-07-02 Srishti Singh , Hema Srinivasan

Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \[ c_t=\lim_{N\rightarrow\infty}\frac 1N\left\lvert\{n<N:s(n+t)\geq s(n)\}\right\rvert>1/2.…

数论 · 数学 2019-04-19 Lukas Spiegelhofer

Let $S$ be a numerical semigroup with Frobenius number $f$, genus $g$ and embedding dimension $e$. % In 1978 Wilf asked the question, whether $\frac{f+1-g}{f+1}\geq\frac1e$. As is well known, this holds in the cases $e=2$ and $e=3$. For…

数论 · 数学 2021-07-16 Michael Hellus , Anton Rechenauer , Rolf Waldi

Given coprime positive integers $a_1 < ...< a_d$, the Frobenius number $F$ is the largest integer which is not representable as a non-negative integer combination of the $a_i$. Let $g$ denote the number of all non-representable positive…

数论 · 数学 2015-05-21 Alessio Moscariello , Alessio Sammartano

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

数论 · 数学 2007-05-23 Constantin M. Petridi

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

In 2023, the first author and Vandehey proved that the largest $k$ for which the string of equalities $\lambda(n+1)=\lambda(n+2)=\cdots=\lambda(n+k)$ holds for some $n\leq x$, where $\lambda$ is the Carmichael $\lambda$ function, is bounded…

数论 · 数学 2024-06-11 Noah Lebowitz-Lockard , J. C. Saunders

Let $r$ be a positive integer, and let $A$ be a nonempty finite set of at least two integers. We let $\tilde{C}_r(A)$ denote the {\em asymptotic $r$-covering number} of $A$, that is, the smallest integer value of $l$ for which, for all…

数论 · 数学 2016-03-22 Bela Bajnok

We prove that for all natural numbers k,n,d with k <= d and every partition lambda of size kn with at most k parts there exists an irreducible GL(d, C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n) (C^d)). This…

群论 · 数学 2010-12-16 Peter Bürgisser , Matthias Christandl , Christian Ikenmeyer

For a numerical semigroup $S \subseteq \mathbb{N}$, let $m,e,c,g$ denote its multiplicity, embedding dimension, conductor and genus, respectively. Wilf's conjecture (1978) states that $e(c-g) \ge c$. As of 2023, Wilf's conjecture has been…

群论 · 数学 2023-10-13 Manuel Delgado , Shalom Eliahou , Jean Fromentin

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
‹ 上一页 1 2 3 10 下一页 ›