Related papers: A New Take on Classic 'Pen Problems'

This paper examines a variety of classical optimization problems, including well-known minimization tasks and more general variational inequalities. We consider a stochastic formulation of these problems, and unlike most previous work, we…

In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…

The paper addresses general constrained and non-linear optimization problems. For some of these notoriously hard problems, there exists a reformulation as an unconstrained, global optimization problem. We illustrate the transformation, and…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

The present paper extends the classical second-order variational problem of Herglotz type to the more general context of the Euclidean sphere S^n following variational and optimal control approaches. The relation between the Hamiltonian…

Variational quantum algorithms are proposed to solve relevant computational problems on near term quantum devices. Popular versions are variational quantum eigensolvers and quantum ap- proximate optimization algorithms that solve ground…

In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed {\em n-fold integer programming problems} are polynomial time solvable. Our proof involves two heavy ingredients…

We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…

In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its appropriate…

A classical result due to Bochner characterizes the classical orthogonal polynomial systems as solutions of a second-order eigenvalue equation. We extend Bochner's result by dropping the assumption that the first element of the orthogonal…

Manifold optimization is ubiquitous in computational and applied mathematics, statistics, engineering, machine learning, physics, chemistry and etc. One of the main challenges usually is the non-convexity of the manifold constraints. By…

We solve the problem of characterizing the Kronecker structure of a matrix pencil obtained by a rank-one perturbation of another matrix pencil. The results hold over arbitrary fields.

We consider the parity variants of basic problems studied in fine-grained complexity. We show that finding the exact solution is just as hard as finding its parity (i.e. if the solution is even or odd) for a large number of classical…

We derive new solutions of the Schr\"odinger equation which describe the motion of particles in the Penning trap. These solutions are direct counterparts of classical orbits. They are obtained by injection of classical trajectories into the…

Multiobjective design optimization problems require multiobjective optimization techniques to solve, and it is often very challenging to obtain high-quality Pareto fronts accurately. In this paper, the recently developed flower pollination…

Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

This paper aims to study canonical pencils of higher dimensional projective varieties. It seems that the geometric genus of the general fibre for the derived fibration from the canonical pencil for a 3-fold of general type does not have an…

In an effort to overcome the limitations of random spin-glass benchmarks for quantum annealers, focus has shifted to carefully-crafted gadget-based problems whose logical structure has typically a planar topology. Recent experiments on…

The seminal work by Mackey et al. in 2006 (reference [21] of the article) introduced vector spaces of matrix pencils, with the property that almost all the pencils in the spaces are strong linearizations of a given square regular matrix…