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

The classical Erd\H{o}s-Littlewood-Offord problem concerns the random variable $X = a_1 \xi_1 + \dots + a_n \xi_n$, where $a_i \in \mathbb{R} \setminus \{0\}$ are fixed and $\xi_i \sim \text{Ber}(1/2)$ are independent. The…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…

For three positive integers ai, aj, ak pairwise coprime, we present an algorithm that find the least multiple of ai that is a positive linear combination of aj, ak. The average running time of this algorithm is O(1). Using this algorithm…

We consider the set $$\mathcal{A} = \left\{10\cdot a + 11\cdot b \ | \gcd(a,b)=1, a\geq 1, b\geq 2a+1 \right\}.$$ We will prove that $\mathcal{A}$ is unbounded and that there exists a natural number $M\notin \mathcal{A}$ for which…

Suppose that R is a two-dimensional normal standard-graded domain over a finite field. We prove that there exists a uniform Frobenius test exponent b for the class of homogeneous ideals in R generated by at most n elements. This means that…

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

Let consider $n$ natural numbers $a\_1 ,\ldots , a\_{n} $. Let $S$ be the numerical semigroup generated by $a\_1 ,\ldots , a\_{n} $. Set $A=K[t^{a\_1}, \ldots , t^{a\_n}]=K[{x\_1}, \ldots , {x\_n}]/I$. The aim of this paper is:…

The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…

For a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$. The extremal problem on estimating the maximum possible size of $r$-multiple-free…

In this paper, we give convenient formulas in order to obtain explicit expressions of a generalized Frobenius number called the $p$-Frobenius number as well as its related values. Here, for a non-negative integer $p$, the $p$-Frobenius…

If E is a linear homogenous equation and c a natural then the Rado number $R_c(E)$ is the least N so that any c-coloring of the positive integers from 1 to N contains a monochromatic solution. Rado characterized for which E R_c(E) always…

The fibbinary numbers are positive integers whose binary representation contains no consecutive ones. We prove the following result: If the $j$th odd fibbinary is the $n$th \emph{odd} fibbinary number, then $j = \lfloor n\phi^2 \rfloor -…

For a prime p, we call a positive integer n a Frobenius p-number if there exists a finite group with exactly n subgroups of order p^a for some $a\ge 0$. Extending previous results on Sylow's theorem, we prove in this paper that every…

For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For…

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

We consider a generalization of the Frobenius Problem where the object of interest is the greatest integer which has exactly $j$ representations by a collection of positive relatively prime integers. We prove an analogue of a theorem of…

Constraint "at most one" is a basic cardinality constraint which requires that at most one of its $n$ boolean inputs is set to $1$. This constraint is widely used when translating a problem into a conjunctive normal form (CNF) and we…

Let $F_h(n)$ denote the minimum cardinality of an additive {\em $h$-fold basis} of $\{1,2,\cdots,n\}$: a set $S$ such that any integer in $\{1,2,\cdots, n\}$ can be written as a sum of at most $h$ elements from $S$. While the trivial bounds…