Related papers: On the Complexity of the Orbit Problem

There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner…

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

It is known that there is no EPTAS for the $m$-dimensional knapsack problem unless $W[1] = FPT$. It is true already for the case, when $m = 2$. But, an FPTAS still can exist for some other particular cases of the problem. In this note, we…

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

This work addresses the Hamiltonian dynamics of the Kepler problem in a deformed phase space, by considering the equatorial orbit. The recursion operators are constructed and used to compute the integrals of motion. The same investigation…

The airplane refueling problem is a nonlinear combinatorial optimization problem, and its equivalent problem the $n$-vehicle exploration problem is proved to be NP-complete (arXiv:2304.03965v1, The $n$-vehicle exploration problem is…

While iterating the quadratic polynomial f_{c}(x)=x^{2}+c the degree of the iterates grows very rapidly, and therefore solving the equations corresponding to periodic orbits becomes very difficult even for periodic orbits with a low period.…

Any sufficiently often differentiable curve in the orbit space $V/G$ of a real finite-dimensional orthogonal representation $G \to O(V)$ of a finite group $G$ admits a differentiable lift into the representation space $V$ with locally…

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

We prove the $W^{1,2}_p$-estimate and solvability for the Dirichlet problem of second-order parabolic equations in simple convex polytopes with time irregular coefficients, when $p\in (1,2]$. We also consider the corresponding Neumann…

First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…

In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin,…

In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…

In 1980, V.I. Arnold studied the classification problem for convex lattice polygons of given area. Since then this problem and its analogues have been studied by B'ar'any, Pach, Vershik, Liu, Zong and others. Upper bounds for the numbers of…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

Let $L$ be a set of $n$ lines in the real projective plane in general position. We show that there exists a vertex $v\in \A(L)$ such that $v$ is positioned in a face of size at most 5 in the arrangement obtained by removing the two lines…

Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…

Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study…

Consider a polyhedral convex cone which is given by a finite number of linear inequalities. We investigate the problem to project this cone into a subspace and show that this problem is closely related to linear vector optimization: We…

We study the complexity of computing (and approximating) VC Dimension and Littlestone's Dimension when we are given the concept class explicitly. We give a simple reduction from Maximum (Unbalanced) Biclique problem to approximating VC…