Related papers: Maximum Nim and Josephus Problem

We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a…

Let $K\subset\mathbb N$ and $\mathbf T(K)$ is a set of trigonometric polynomials \[ T(x)=T_0+\sum_{k\in K, k\le H}T_k\cos(2\pi kx), \qquad H>1, \] $T(x)\ge0$ for all $x$ and $T(0)=1$. Suppose that $0<h\le1/2$ and $K(h)$ is the class of…

Let $f: B^n \rightarrow {\mathbb R}$ be a $d+1$ times continuously differentiable function on the unit ball $B^n$, with $\max_{z\in B^n} |f(z)|=1$. A well-known fact is that if $f$ vanishes on a set $Z\subset B^n$ with a non-empty interior,…

The function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to the first k primes. We give a new computational method for calculating strong upper bounds on h(k).

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…

A Green's function method is developed for solving strongly-coupled gravity and matter in the semiclassical limit. In the strong-coupling limit, one assumes that Newton's constant approaches infinity. As a result, one may neglect second…

Different questions lead to the same class of functions from natural integers to integers: those which have integral difference ratios, i.e. verifying $f(a)-f(b)\equiv0 \pmod {(a-b)}$ for all $a>b$. We characterize this class of functions…

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…

Motivated by the Maximum Theorem for convex functions (in the setting of linear spaces) and for subadditive functions (in the setting of Abelian semigroups), we establish a Maximum Theorem for the class of generalized convex functions,…

Let $\left[x\right]$ be the largest integer not exceeding $x$. For $0<\theta \leq 1$, let $\pi_{\theta}(x)$ denote the number of integers $n$ with $1 \leq n \leq x^{\theta}$ such that $\left[\frac{x}{n}\right]$ is prime and…

A curious identity of Bunyakovsky (1882), made more widely known by P\'olya and Szeg{\H o} in their ``Problems and Theorems in Analysis", gives an evaluation of a sum of the floor function of square roots involving primes $p\equiv…

We propose a theoretical framework to capture incremental solutions to cardinality constrained maximization problems. The defining characteristic of our framework is that the cardinality/support of the solution is bounded by a value…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

Jacobsthal's conjecture has been disproved by counterexample a few years ago. We continue to verify this conjecture on a larger scale. For this purpose, we implemented an extension of the Greedy Permutation Algorithm and computed the…

For a polynomial $f(x)\in \mathbb Z[x]$ we study an analogue of Jacobsthal function, defined by the formula \[ j_f(N)=\max_{m}\{\text{For some } x\in \mathbb N \text{ the inequality } (x+f(i),N)>1 \text{ holds for all }i\leq m\}. \] We…

We develop refined Karush-Kuhn-Tucker (KKT) and Fritz-John (FJ)-type optimality conditions for nonsmooth, nonconvex mathematical pro\-gra\-mming problems. We pay special attention in the case that the functional constraint belongs to a…

A tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max $k$-cut problem is a fundamental combinatorial optimization problem with…

In this paper we prove an analogue of the discrete spherical maximal theorem of Magyar, Stein, and Wainger, an analogue which concerns maximal functions associated to homogenous algebraic surfaces. Let $\mathfrak{p}$ be a homogenous…

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In…