Related papers: Maximum Nim and Josephus Problem

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

We deal with a problem of finding maximum of a function from the Holder class on a quantum computer. We show matching lower and upper bounds on the complexity of this problem. We prove upper bounds by constructing an algorithm that uses the…

For $2\le k\le t<s$, the Erd\H{o}s-Rogers function $f^{(k)}_{t,s}(N)$ denotes the largest $m$ such that every $K^{(k)}_s$-free $k$-graph on $N$ vertices contains a $K^{(k)}_t$-free induced subgraph on $m$ vertices. Mubayi and Suk (J. London…

In previous papers we investigated so-called sum of translates functions $F({\mathbf{x}},t):=J(t)+\sum_{j=1}^n \nu_j K(t-x_j)$, where $J:[0,1]\to \underline{\mathbb{R}}:={\mathbb{R}}\cup\{-\infty\}$ is a "sufficiently nondegenerate" and…

This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences. Based…

For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality of its maximum matching.

In this paper we design a new primal-dual algorithm for the classic discrete optimization problem of maximizing a monotone submodular function subject to a cardinality constraint achieving the optimal approximation of $(1-1/e)$. This…

Let $\mathcal{A}$ be a unital $\mathbf{C}^*$-algebra with unit $e$. We develop several inequalities for a positive linear functional $f$ on $\mathcal{A}$ and obtain several bounds for the numerical radius $v(a)$ of an element $a\in…

Let $[\, \cdot\,]$ be the floor function. In this paper, we show that when $1<c<37/36$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c_1]+[p^c_2]+[p^c_3]\,, \end{equation*} where…

We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree of each term should be small (up to 10), and the number of…

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

We present take-away games whose Sprague-Grundy functions are given by the Nim sum of heap sizes in a mixed base $\beta$. Let $\Delta_\beta$ be the set of such games. We give a necessary and sufficient condition for the existence of a…

We study a bi-objective optimization problem, which for a given positive real number $n$ aims to find a vector $X = \{x_0,\cdots,x_{k-1}\} \in \mathbb{R}^{k}_{\ge 0}$ such that $\sum_{i=0}^{k-1} x_i = n$, minimizing the maximum of $k$…

We obtain sufficient conditions for solutions of the $m$th-order differential inequality $$ \sum_{|\alpha| = m} \partial^\alpha a_\alpha (x, u) \ge f (x) g (|u|) \quad \mbox{in } B_1 \setminus \{ 0 \} $$ to have a removable singularity at…

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…

We study the behavior of canonical height functions $\widehat{h}_f$, associated to rational maps $f$, on totally $p$-adic fields. In particular, we prove that there is a gap between zero and the next smallest value of $\widehat{h}_f$ on the…

Under study is the new class of geometrical extremal problems in which it is required to achieve the best result in the presence of conflicting goals; e.g., given the surface area of a convex body $\mathfrak x$, we try to maximize the…

We consider Newton's problem of minimal resistance, in particular we address the problem arising in the limit if the height goes to infinity. We establish existence of solutions and lack radial symmetry of solutions. Moreover, we show that…

In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R(C_k,H)$ is at most $2m+\lfloor \frac{k-1}{2} \rfloor$, provided $m$ is sufficiently large with respect to $k$. This…

In the last three decades, the $k$-SUM hypothesis has emerged as a satisfying explanation of long-standing time barriers for a variety of algorithmic problems. Yet to this day, the literature knows of only few proven consequences of a…