Vladimir L. Shchur
We generalize and prove a hypothesis by V. Arnold on the parity of Frobenius number. For the case of symmetric semigroups with three generators of Frobenius numbers we found an exact formula, which in a sense is the sum of two Sylvester's formulaes. We prove that the fraction of the symmetric semigroups is vanishing in the weak limit.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$ and finding the Frobenius number is called the Frobenius problem. In this paper, we introduce the Frobenius problem for numerical semigroups generated by Thabit number base b and Thabit number of the second kind base b which are motivated by the Frobenius problem for Thabit numerical semigroups. Also, we introduce the Frobenius problem for numerical semigroups generated by Cunningham number and Fermat number base $b$
The greatest integer that does not belong to $S$ is the Frobenius number of $S$ and denoted by $F(S)$. To solve the Frobenius problem means the study to find $F(S)$. The Frobenius problem have treated steadily for a long time. In this paper, We will introduce the Frobenius problem for generalized Thabit numerical semigroups, which is motivated by the Frobenius problem for Thabit numerical semigroups.
The Frobenius problem for Numerical Semigroups generated by binomial coefficients
本文研究由二项式系数生成的数值半群的Frobenius问题，给出其求解结果，同时得到二项式系数的非平凡恒等式，并将结论与整数的$(s,s+1,s+p)$-core分拆理论建立关联。
We give a formula for the Frobenius vector of a free affine simplicial semigroup.
The matrix representation of the set $Δ({\bf d}^3)$, ${\bf d}^3=(d_1,d_2, d_3)$, of the integers which are unrepresentable by $d_1,d_2,d_3$ is found. The diagrammatic procedure of calculation of the generating function $Φ({\bf d}^3;z)$ for the set $Δ({\bf d}^3)$ is developed. The Frobenius number $F({\bf d}^3)$, genus $G({\bf d}^3)$ and Hilbert series $H({\bf d}^3;z)$ of a graded subring for non--symmetric and symmetric semigroups ${\sf S}({\bf d}^3)$ are found. The upper bound for the number of non--zero coefficients in the polynomial numerators of Hilbert series $H({\bf d}^m;z)$ of graded su…
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 $j\in\mathbb N$. We obtain a numerical semigroup $(1/e)S_n$ by dividing every element of $S_n$ by $e=\gcd(S_n)$. We characterize the embedding dimension of $S_n$ and describe a method to find the minimal generating set of $S_n$. We also show how to find the maximum element of the Apéry set ${\rm Ap}(S_n, \mathbf s_0)$, characterize the elements of ${\rm Ap}(S_n, \mat…
Let $0<λ\leq1$, $λ\notin\left\{\frac24, \frac27, \frac2{10}, \frac2{13}, \ldots\right\}$, be a real and $p$ a prime number, with $[p,p+λp]$ containing at least two primes. Denote by $f_λ(p)$ the largest integer which cannot be written as a sum of primes from $[p,p+λp]$. Then \[f_λ(p)\sim\left\lfloor2+\frac2λ\right\rfloor\cdot p\text{, as }p\text{ goes to infinity.}\] Further a question of Wilf about the 'Money-Changing Problem' has a positive answer for all semigroups of multiplicity $p$ containing the primes from $[p,2p]$. In particular, this holds for the semigroup generated by all primes no…
In this paper we present a procedure to build the set of irreducible numerical semigroups with a fixed Frobenius number. The construction gives us a rooted tree structure for this set. Furthermore, by using the notion of Kunz-coordinates vector we translate the problem of finding such a tree into the problem of manipulating 0-1 vectors with as many component as the Frobenius number.
Frobenius problem and its many generalizations have been extensively studied in several areas of mathematics. We study semigroups of totally positive algebraic integers in totally real number fields, defining analogues of the Frobenius numbers in this context. We use a geometric framework recently introduced by Aliev, De Loera and Louveaux to produce upper bounds on these Frobenius numbers in terms of a certain height function. We discuss some properties of this function, relating it to absolute Weil height and obtaining a lower bound in the spirit of Lehmer's conjecture for algebraic vectors …
This paper provides a formula for the minimal relations and the Frobenius number of a numerical semigroup minimally generated by three pairwise coprime positive integers.
On $p$-Frobenius of affine semigroups
本文研究仿射半群的 $p$-Frobenius 向量，提出计算算法，并分析其在与 $\mathbb N^q$ 粘合时的行为。
Frobenius numbers and the first Hilbert coefficients of certain numerical semigroup rings
本文研究了特定数值半群的弗罗贝尼乌斯数和其环的第一希尔伯特系数，提供了显式计算公式。
The Frobenius problem for shifted square sequences
本文解决了以4的倍数开头的移位平方序列的Frobenius问题，即找到不属于该数值半群的最大整数。
We compute the Frobenius number for sequences of triangular and tetrahedral numbers. In addition, we study some properties of the numerical semigroups associated to those sequences.
On the Frobenius Number and Genus of a Collection of Semigroups Generalizing Repunit Numerical Semigroups
本文研究了特定数数半群的弗罗贝尼乌斯数和亏格，提出d可为负整数的新方法，并针对特殊情形如梅森、塔比特和雷努特数数半群给出简化公式，部分解决了普罗思数数半群的开放问题。
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one irreducible and one homogeneous numerical semigroup at each class in the relation, and from those two elements we reconstruct the whole class. An alternative more efficient method is proposed based on the use of the Kunz-coordinates vectors of the elements in S(F).
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 the $d$-folds of $S$ is $g + \lceil \frac{(d-1)f}{2} \rceil$, where $g$ and $f$ denote the genus and the Frobenius number of $S$. The case $d=2$ is a problem proposed by Robles-Pérez, Rosales, and Vasco. Furthermore, we find the minimal genus of the symmetric doubles of $S$ and study the particular case when $S$ is almost symmetric. Finally, we study the Frobe…
We define a reflective numerical semigroup of genus $g$ as a numerical semigroup that has a certain reflective symmetry when viewed within $\mathbb{Z}$ as an array with $g$ columns. Equivalently, a reflective numerical semigroup has one gap in each residue class modulo $g$. In this paper, we give an explicit description for all reflective numerical semigroups. With this, we can describe the reflective members of well-known families of numerical semigroups as well as obtain formulas for the number of reflective numerical semigroups of a given genus or given Frobenius number.
$p$-numerical semigroups with $p$-symmetric properties
本文引入$p$-数值半群，推广数值半群理论，定义$p$-间隙、$p$-对称半群等，并研究其性质，当$p=0$时还原为经典情形。
On numerical semigroups with embedding dimension four
本文开发了一种几何方法，用于计算任意嵌入维数为四的数值半群的Apéry集，并应用于四个连续平方数和四个连续三角数生成的数值半群，得到了Frobenius数、亏格、Betti元素、极小表示和链环度。
Let $S=\left\langle s_1,\ldots,s_n\right\rangle$ be a numerical semigroup generated by the relatively prime positive integers $s_1,\ldots,s_n$. Let $k\geqslant 2$ be an integer. In this paper, we consider the following $k$-power variant of the Frobenius number of $S$ defined as $${}^{k\!}r\!\left(S\right):= \text{ the largest } k \text{-power integer not belonging to } S.$$In this paper, we investigate the case $k=2$. We give an upper bound for ${}^{2\!}r\!\left(S_A\right)$ for an infinite family of semigroups $S_A$ generated by {\em arithmetic progressions}. The latter turns out to be the exa…
Given an integral $d \times n$ matrix $A$, the well-studied affine semigroup $\mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\}$ can be stratified by the number of lattice points inside the parametric polyhedra $P_A(b)=\{x: Ax=b, x\geq0\}$. Such families of parametric polyhedra appear in many areas of combinatorics, convex geometry, algebra and number theory. The key themes of this paper are: (1) A structure theory that characterizes precisely the subset $\mbox{ Sg}_{\geq k}(A)$ of all vectors $b \in \mbox{ Sg}(A)$ such that $P_A(b) \cap {\mathbb Z}^n $ has at least $k$ solutions. …
We consider the Diophantine problem of Frobenius for semigroup ${\sf S}({\bf d}^3)$ where ${\bf d}^3$ denotes the tuple $(d_1,d_2,d_3)$, $\gcd(d_1,d_2,d_3)=1$. Based on the Hadamard product of analytic functions we have found the analytic representation for the diagonal elements $a_{kk}({\bf d}^3)$ of the Johnson's matrix of minimal relations in terms of $d_1,d_2,d_3$. Bearing in mind the results of the recent paper this gives the analytic representation for the Frobenius number $F({\bf d}^3)$, genus $G({\bf d}^3)$ and the Hilbert series $H({\bf d}^3;z)$ for the semigroups ${\sf S}({\bf d}^3)$…
The Frobenius Problem for the Proth Numbers
本文定义了Proth数值半群$P_{k}(n)$，给出了其嵌入维数公式，并通过推导Frobenius数的闭式公式解决了该半群的Frobenius问题，同时证明了其满足Wilf性质。
Let $A$ be a finite set of relatively prime positive integers, and let $S(A)$ be the set of all nonnegative integral linear combinations of elements of $A$. The set $S(A)$ is a semigroup that contains all sufficiently large integers. The largest integer not in $S(A)$ is the Frobenius number of $A$, and the number of positive integers not in $S(A)$ is the genus of $A$. Sharp and Sylvester proved in 1884 that the Frobenius number of the set $A = \{a,b\}$ is $ab-a-b$, and that the genus of $A$ is $(a-1)(b-1)/2$. Graded rings and a simple form of Hilbert's syzygy theorem are used to give a commuta…
$p$-numerical semigroup of generalized Fibonacci triples
本文针对非负整数 $p$，给出了涉及 Jacobsthal 多项式（包含 Fibonacci 数）的广义 Fibonacci 数值半群的 $p$-Frobenius 数和 $p$-亏格显式公式，并探讨了其在 $p$-Hilbert 级数上的应用。
The extended Frobenius problem for Lucas series incremented by a Lucas number
本文研究了增加一个Lucas数的Lucas序列的扩展Frobenius问题，并证明了与这些序列相关的数值半群族满足Wilf猜想。
We consider symmetric (not complete intersection) numerical semigroups S_6, generated by a set of six positive integers {d_1,...,d_6}, gcd(d_1,...,d_6)=1, and derive inequalities for degrees of syzygies of such semigroups and find the lower bound for their Frobenius numbers. We show that this bound may be strengthened if S_6 satisfies the Watanabe lemma.
We give a simple explanation of numerical experiments of V. Arnold with two sequences of symmetric numerical semigroups, S(4,6+4k,87-4k) and S(9,3+9k,85-9k) generated by three elements. We present a generalization of these sequences by numerical semigroups S(r_1^2,r_1r_2+r_1^2k,r_3-r_1^2k), k\in{\mathbb Z}, r_1,r_2,r_3\in{\mathbb Z}^+, r_1\geq 2 and \gcd(r_1,r_2)=\gcd(r_1,r_3)=1, and calculate their universal Frobenius number Phi(r_1,r_2,r_3) for the wide range of k providing semigroups be symmetric. We show that this kind of semigroups admit also nonsymmetric representatives. We describe the …
Frobenius Numbers Associated with Primitive Pythagorean Quadruples
本文针对原始毕达哥拉斯四元组生成的数值半群，在特定条件下给出了 Frobenius 数的显式公式，证明基于完全剩余系、规范化与提升-轨道方法。
Let 0 < a < b be two relatively prime integers and let <a,b> be the numerical semigroup generated by a and b with Frobenius number g(a,b)=ab-a-b. In this note, we prove that there exists a prime number p in <a,b> with p < g(a,b) when the product ab is sufficiently large. Two related conjectures are posed and discussed as well.
The symmetric numerical semigroups S(F_a,F_b,F_c) and S(L_k,L_m,L_n) generated by three Fibonacci (F_a,F_b,F_c) and Lucas (L_k,L_m,L_n) numbers are considered. Based on divisibility properties of the Fibonacci and Lucas numbers we establish necessary and sufficient conditions for both semigroups to be symmetric and calculate their Hilbert generating series, Frobenius numbers and genera.
The Frobenius number corresponding to the squares of three consecutive Fibonacci numbers: comparison of three algorithmic processes
本文针对三个连续斐波那契数平方生成的数值半群，计算其Frobenius数，并比较Ramírez Alfonsín-Rødseth、Rosales-García-Sánchez和Tripathi三种算法过程的效果。
A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the ordinarization transform, by removing its smallest non-zero non-gap (the multiplicity) and adding its largest gap (the Frobenius number). This gives another numerical semigroup and by repeating this transform several times we end up with an ordinary semigroup. The genus, that is, the number of gaps, is kept constant in all the transforms. This procedure allows the …
A Note on Generalized Repunit Numerical Semigroups
本文研究广义循环单位数值半群的Frobenius问题，在特定条件下给出Frobenius数和亏格的公式，并简化了循环单位、梅森和塔比特等特殊情形。
Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, Keith and Nath illustrated an injection from numerical semigroups to integer partitions. We explore this connection between partitions and numerical semigroups with a focus on classifying the partitions that appear in the image of the injection from numerical semigroups. In particular, we count the number of partitions that correspond to numerical semigroups in terms of genus, Frobenius number, and multiplicity, with some restrictions.
The Frobenius problem over real number fields
本文将经典Frobenius问题推广至实数子域的整数环上，定义了Frobenius半群并构造偏序，证明其由有限个极大元素完全描述且极大元素数量可无界增长，并给出实二次数域的具体算例。
On the Frobenius Number of Quotients of Numerical Semigroups
研究数值半群商的弗罗贝尼乌斯数问题，通过受柯蒂斯定理启发，利用狄利克雷定理，得到该数不能用有限多项式公式统一表示、特定函数性质及不存在相关非零多项式等结果。
Steganographic information hiding via symmetric numerical semigroups
本文提出一种基于对称数值半群的隐写信息隐藏方案，利用间隙结构实现信息嵌入，通过数论方法实现隐蔽通信和抗量子安全信息隐藏。
The extended Frobenius problem for Fibonacci sequences incremented by a Fibonacci number
本文研究由斐波那契数列平移一个斐波那契数所得序列的扩展 Frobenius 问题，并证明相应数值半群族满足 Wilf 猜想。
On Families of Numerical Semigroups with two Coprime Generators and Dimension three
本文重新审视了最小生成元个数至多三且至少两个互素的数值半群，改进了求伪Frobenius数的算法，并构造了型至多$n-1$的$n$维数值半群族。
Let $S,T$ be two numerical semigroups. We study when $S$ is one half of $T$, with $T$ almost symmetric. If we assume that the type of $T$, $t(T)$, is odd, then for any $S$ there exist infinitely many such $T$ and we prove that $1 \leq t(T) \leq 2t(S)+1$. On the other hand, if $t(T)$ is even, there exists such $T$ if and only if $S$ is almost symmetric and different from $\mathbb{N}$; in this case the type of $S$ is the number of even pseudo-Frobenius numbers of $T$. Moreover, we construct these families of semigroups using the numerical duplication with respect to a relative ideal.
The $p$-numerical semigroup of the triple of arithmetic progressions
本文研究算术数列三元组的 $p$-Frobenius 数，通过确定 $p$-Apéry 集的元素，给出了此前未知的 $p>0$ 情形下显式公式及相关值。
Motivated by a promotion to increase the number of musical downloads, we introduce the concept of $C$-incentive and show an algorithm that compute the smallest $C$-incentive containing a subset $X \subseteq {\mathbb N}$. On the other hand, in order to study $C$-incentives, we see that we can focus on numerical $C$-incentives. Then, we establish that the set formed by all numerical $C$-incentives is a Frobenius pseudo-variety and we show an algorithmic process to recurrently build such a pseudo-variety.
$p$-numerical semigroups of Pell triples
本文针对基于 Pell 型数递推关系构建的 Pell 数值半群，利用 $p$-Apéry 集，通过逐案讨论推导出了其 $p$-Frobenius 数和 $p$-亏格的显式公式。
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 number of all representable non-negative integers less than $F$; Wilf conjectured that $F+1 \le e n$. We provide bounds for $g_1$ and for the type of the numerical semigroup $S=\langle g_1,\ldots,g_e \rangle$ in function of $e$ and $n$, and use these bounds to prove that $F+1 \le q e n$, where $q= \left \lceil \frac{F+1}{g_1} \right \rceil$, and $F+1 \le e …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。