Related papers: Maximum Nim and Josephus Problem

Let $K$ be a compact Hausdorff space and let $(f_n)_{n\in \N}$ be a pairwise disjoint sequence of continuous functions from $K$ into $[0,1]$. We say that a compact space $L$ \emph{adds supremum} of $(f_n)_{n\in \N}$ in $K$ if there exists a…

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

We describe a factor-revealing convex optimization problem for the integrality gap of the maximum-cut semidefinite programming relaxation: for each $n \geq 2$ we present a convex optimization problem whose optimal value is the largest…

We obtain sharp upper and lower bounds on a certain four-dimensional Frobenius number determined by a prime pair $(p,q)$, $2<p<q$, including exact formulae for two infinite subclasses of such pairs. Our work is motivated by the study of…

This paper explores special arrangements of clues in $m \times n$ Numbrix puzzles. The maximum number of clues which fails to define an $m \times n$ puzzle is demonstrated for all $m$ and $n$. In addition, a small upper bound on the minimum…

We consider the problem of multi-objective maximization of monotone submodular functions subject to cardinality constraint, often formulated as $\max_{|A|=k}\min_{i\in\{1,\dots,m\}}f_i(A)$. While it is widely known that greedy methods work…

Maximizing a submodular function is a fundamental task in machine learning and in this paper we study the deletion robust version of the problem under the classic matroids constraint. Here the goal is to extract a small size summary of the…

One of the main themes in this thesis is the description of the signature of both the infinite place and the finite places in cubic function fields of any characteristic and quartic function fields of characteristic at least 5. For these…

Suppose that $ m\equiv 1\mod 4 $ is a prime and that $ n\equiv 3\mod 4 $ is a primitive root modulo $ m $. In this paper we obtain a relation between the class number of the imaginary quadratic field $ \Q(\sqrt{-nm}) $ and the digits of the…

Given a rational elliptic surface X over an algebraically closed field, we investigate whether a given natural number k can be the intersection number of two sections of X. If not, we say that k a gap number. We try to answer when gap…

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

Maximum subarray is a classical problem in computer science that given an array of numbers aims to find a contiguous subarray with the largest sum. We focus on its use for a noisy statistical problem of localizing an interval with a mean…

We resolve a conjecture of Cox and Martin by determining asymptotically for every $k\ge 2$ the maximum number of copies of $C_{2k}$ in an $n$-vertex planar graph.

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

We study PDE of the form $\max\{F(D^2u,x)-f(x), H(Du)\}=0$ where $F$ is uniformly elliptic and convex in its first argument, $H$ is convex, $f$ is a given function and $u$ is the unknown. These equations are derived from dynamic programming…

A tiling of the unit square is an MTP tiling if the smallest tile can tile all the other tiles. We look at the function $f(n)=\max \sum s_i$, where $s_i$ is the side length of the $i$th tile and the sum is taken over all MTP tilings with…

Following P. Fenton, we investigate 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 non-degenerate" and upper-bounded…

We consider hyper- and superelliptic equations $f(x)=by^m$ with unknowns x,y from the ring of S-integers of a given number field K. Here, f is a polynomial with S-integral coefficients of degree n with non-zero discriminant and b is a…

In this article we study convex integer maximization problems with composite objective functions of the form $f(Wx)$, where $f$ is a convex function on $\R^d$ and $W$ is a $d\times n$ matrix with small or binary entries, over finite sets…