中文
相关论文

相关论文: An Optimal Lower Bound for the Frobenius Problem

200 篇论文

We derive the lower bound for Frobenius number of symmetric (not complete intersection) semigroups generated by four elements.

交换代数 · 数学 2015-06-16 Leonid G. Fel

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

A subset $A$ of the integers is a $B_k[g]$ set if the number of multisets from $A$ that sum to any fixed integer is at most $g$. Let $F_{k,g}(n)$ denote the maximum size of a $B_k[g]$ set in $\{1,\dots, n\}$. In this paper we improve the…

组合数学 · 数学 2021-06-21 Griffin Johnston , Michael Tait , Craig Timmons

An explicit upper bound is established for the least non-trivial integer zero of an arbitrary cubic form $C \in \mathbb{Z}[X_1,...,X_n],$ provided that $n \geq 14.$

数论 · 数学 2024-07-02 Yixiu Xiao , Hongze Li

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

组合数学 · 数学 2020-07-21 Quentin Dubroff , Jacob Fox , Max Wenqiang Xu

For relatively prime positive integers $u_0$ and $r$ and for $0\le k\le n$, define $u_k:=u_0+kr$. Let $L_n:={\rm lcm}(u_0, u_1, ..., u_n)$ and let $a, l\ge 2$ be any integers. In this paper, we show that, for integers $\alpha \geq a$ and…

数论 · 数学 2013-11-05 Rongjun Wu , Qianrong Tan , Shaofang Hong

In this paper we study a certain kind of generalized linear Diophantine problem of Frobenius. Let $a_1,a_2,\dots,a_l$ be positive integers such that their greatest common divisor is one. For a nonnegative integer $p$, denote the…

组合数学 · 数学 2022-12-06 Takao Komatsu , Haotian Ying

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

组合数学 · 数学 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof

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…

数论 · 数学 2020-04-17 Melvyn B. Nathanson

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…

交换代数 · 数学 2018-08-29 Leonid G. Fel

We study the number of lattice points in integer dilates of the rational polytope $P = (x_1,...,x_n) \in \R_{\geq 0}^n : \sum_{k=1}^n x_k a_k \leq 1$, where $a_1,...,a_n$ are positive integers. This polytope is closely related to the linear…

数论 · 数学 2007-05-23 Matthias Beck , Ricardo Diaz , Sinai Robins

Let $f(m)$ be the largest integer such that for every set $A = \{a_1 < \cdots < a_m\}$ of $m$ positive integers and every open interval $I$ of length $2a_m$, there exist at least $f(m)$ disjoint pairs $(a, b)$ with $a \in A$ dividing $b \in…

组合数学 · 数学 2026-03-31 Wouter van Doorn , Yanyang Li , Quanyu Tang

A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…

组合数学 · 数学 2010-03-04 Greg Martin , Kevin O'Bryant

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

数论 · 数学 2023-01-31 Luke Pebody

A numerical set is a co-finite subset of the natural numbers that contains zero. Its Frobenius number is the largest number in its complement. Each numerical set has an associated semigroup $A(T)=\{t\mid t+T\subseteq T\}$, which has the…

组合数学 · 数学 2021-05-11 Deepesh Singhal , Yuxin Lin

Let $G$ be a $p$-group for some prime $p$. Let $n$ be the positive integer so that $|G:Z(G)| = p^n$. Suppose $A$ is a maximal abelian subgroup of $G$. Let $$p^l = {\rm max} \{|Z(C_G (g)):Z(G)| : g \in G \setminus Z(G)\},$$ $$p^b = {\rm max}…

群论 · 数学 2024-02-20 Mark L. Lewis

Let $\mathcal{A}$ be the set of all integers of the form $\gcd(n, F_n)$, where $n$ is a positive integer and $F_n$ denotes the $n$th Fibonacci number. Leonetti and Sanna proved that $\mathcal{A}$ has natural density equal to zero, and asked…

数论 · 数学 2022-10-10 Abhishek Jha , Carlo Sanna

A set of integers $A$ is non-averaging if there is no element $a$ in $A$ which can be written as an average of a subset of $A$ not containing $a$. We show that the largest non-averaging subset of $\{1, \ldots, n\}$ has size $n^{1/4+o(1)}$,…

组合数学 · 数学 2025-09-11 Huy Tuan Pham , Dmitrii Zakharov

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

数论 · 数学 2013-01-17 Marina Nincevic , Sinisa Slijepcevic

We present a new approach to the ideal membership problem for polynomial rings over the integers: given polynomials $f_0,f_1,...,f_n\in\Z[X]$, where $X=(X_1,...,X_N)$ is an $N$-tuple of indeterminates, are there $g_1,...,g_n\in\Z[X]$ such…

交换代数 · 数学 2007-05-23 Matthias Aschenbrenner