Related papers: Maximum Nim and Josephus Problem algorithm

Given polynomials f(x), g_i(x), h_j(x), we study how to minimize f on the semialgebraic set S = { x \in R^n: h_1(x)=...=h_{m_1}(x) =0, g_1(x) >= 0, ..., g_{m_2}(x) >= 0}. Let f_{min} be the minimum of f on S. Suppose S is nonsingular and…

We consider the problem of certifying an inequality of the form $f(x)\geq 0$, $\forall x\in K$, where $f$ is a multivariate transcendental function, and $K$ is a compact semialgebraic set. We introduce a certification method, combining…

This paper presents a detailed discussion of the ``Newton's method'' algorithm for finding apparent horizons in 3+1 numerical relativity. We describe a method for computing the Jacobian matrix of the finite differenced $H(h)$ function by…

We consider the graph $k$-partitioning problem under the min-max objective, termed as Minmax $k$-cut. The input here is a graph $G=(V,E)$ with non-negative edge weights $w:E\rightarrow \mathbb{R}_+$ and an integer $k\geq 2$ and the goal is…

Fix positive integers $p$ and $q$ with $2 \leq q \leq {p \choose 2}$. An edge-coloring of the complete graph $K_n$ is said to be a $(p, q)$-coloring if every $K_p$ receives at least $q$ different colors. The function $f(n, p, q)$ is the…

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

Inspired by a paper of Erik Westzynthius,we build on work of Harlan Stevens and Hans-Joachim Kanold. Let $k \gt 2$ be the number of distinct prime divisors of a positive integer $n$. In 1977, Stevens used Bonferroni inequalities to get an…

In this paper, we consider nonlinear equations involving the fractional p-Laplacian $$ (-\lap)_p^s u(x)) \equiv C_{n,s,p} PV \int_{\mathbb{R}^n} \frac{|u(x)-u(y)|^{p-2}[u(x)-u(y)]}{|x-z|^{n+ps}} dz= f(x,u).$$ We prove a {\em maximum…

Understanding of the behavior of algorithms for resolving the optimization problem (hereafter shortened to OP) of optimizing a differentiable loss function (OP1), is enhanced by knowledge of the critical points of that loss function, i.e.…

An exact formula \[ B(n) = \frac{n}{2}(\lfloor \lg n \rfloor + 1) - \sum _{k=0} ^{\lfloor \lg n \rfloor} 2^k Zigzag(\frac{n}{2^{k+1}}), \] where \[ Zigzag (x) = \min (x - \lfloor x \rfloor, \lceil x \rceil - x), \] for the minimal number $…

Let $G$ be a graph with an even number of vertices. The matching preclusion number of $G$, denoted by $mp(G)$, is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. We introduced a $0$-$1$…

We propose a unified derivative-free proximal Newton-type algorithm framework for solving composite optimization problems formulated as the sum of a black-box function and a known regularization term. We establish the iteration and oracle…

We consider the 0-1 Penalized Knapsack Problem (PKP). Each item has a profit, a weight and a penalty and the goal is to maximize the sum of the profits minus the greatest penalty value of the items included in a solution. We propose an…

A determined algorithm is presented for solving the rSUM problem for any natural r with a sub-quadratic assessment of time complexity in some cases. In terms of an amount of memory used the obtained algorithm is the nlog^3(n) order. The…

Given relatively prime positive integers, $a_1,\ldots,a_n$, the Frobenius number is the largest integer with no representations of the form $a_1x_1+\cdots+a_nx_n$ with nonnegative integers $x_i$. This classical value has recently been…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})<p^{\alpha}$ and $f(p)\vert f(p^{\alpha})$. Suppose also that any prime that…

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

We study the complexity of computing majority as a composition of local functions: \[ \text{Maj}_n = h(g_1,\ldots,g_m), \] where each $g_j :\{0,1\}^{n} \to \{0,1\}$ is an arbitrary function that queries only $k \ll n$ variables and $h :…

Let $n, m, k$ be positive integers with $k=n-m+1$. We establish an abstract Morse-Sard-type theorem which allows us to deduce, on the one hand, a previous result of De Pascale's for Sobolev $W^{k,p}_{\textrm{loc}}(\mathbb{R}^n,…