Related papers: Maximum Nim and Josephus Problem

In this article, we investigate the Grundy values of the popular game of Fibonacci nim. The winning strategy, which amounts to understanding positions of Grundy value 0, was known since Whinihan in 1963. In this paper, we extend Whinihan's…

Let $F$ be a number field, $k$ a positive integer. In this paper, we define the Mobius and Liouville functions of order $k$ in $F$. We give a formula about the partial sums of them by using elementary number theory and complex analysis.…

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. For a positive integer n, let f(n) denote the greatest finite total number of solutions of a subsystem of E_n in integers x_1,...,x_n. We prove: (1) the function f is…

We consider a Cauchy problem for a Hamilton--Jacobi equation with coinvariant derivatives of an order $\alpha \in (0, 1)$. Such problems arise naturally in optimal control problems for dynamical systems which evolution is described by…

The rook numbers are fairly well-studied in the literature. In this paper, we study the max-rook number of the Ferrers boards associated to integer partitions. We show its connections with the Durfee triangle of the partitions. The max-rook…

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

We study a generalization of the \emph{Frobenius problem}: given $k$ positive relatively prime integers, what is the largest integer $g_0$ that cannot be represented as a nonnegative integral linear combination of these parameters? More…

Let $f$ be a function in the Eremenko-Lyubich class $\mathcal{B}$, and let $U$ be an unbounded, forward invariant Fatou component of $f$. We relate the number of singularities of an inner function associated to $f|_U$ with the number of…

We study variants of the \emph{Frobenius coin-exchange problem}: given $n$ positive relatively prime parameters, what is the largest integer that cannot be represented as a nonnegative integral linear combination of the given integers? This…

In this work, we consider a nonsmooth minimisation problem in which the objective function can be represented as the maximum of finitely many smooth ``subfunctions''. First, we study a smooth min-max reformulation of the problem. Due to…

We prove the curse of dimensionality in the worst case setting for numerical integration for a number of classes of smooth $d$-variate functions. Roughly speaking, we consider different bounds for the derivatives of $f \in C^k(D_d)$ and ask…

This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…

We study the Frobenius problem: given relatively prime positive integers $a_1,...,a_d$, find the largest value of t (the Frobenius number) such that $\sum_{k=1}^d m_k a_k = t$ has no solution in nonnegative integers $m_1,...,m_d$. Based on…

Let $K$ be a complete non-archimedean field with a discrete valuation, $f\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\M$ the maximal ideal of $A$. The first main result of this paper is a…

The solving degree is an important parameter for estimating the complexity of solving a system of polynomial equations. In this paper, we provide an upper bound for the solving degree in terms of the degree of regularity. We also show that…

For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding…

In this paper we study relationships between the \emph{matching number}, written $\mu(G)$, and the \emph{independence number}, written $\alpha(G)$. Our first main result is to show \[ \alpha(G) \le \mu(G) + |X| - \mu(G[N_G[X]]), \] where…

We introduce and analyze a new cardinal characteristic of the continuum, the \emph{splitting number of the reals}, denoted $\mathfrak{s}(\mathbb R)$. This number is connected to Efimov's problem, which asks whether every infinite compact…

The problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems. Unfortunately, it is generally not possible to maximize a monotone set function up to an acceptable…