Related papers: A Linearly-growing Conversion from the Set Splitti…
To treat a problem with a Quantum Processing Unit (QPU), it must be transformed into a sequence of quantum operations, or gates: this is the quantum description of the problem. These operations are either packed into a query (i.e. quantum…
This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison…
We consider the formal reduction of a system of linear differential equations and show that, if the system can be block-diagonalised through transformation with a ramified Shearing-transformation and following application of the Splitting…
After long-term efforts, the Hamilton path (cycle) problem for connected vertex-transitive graphs of order $pq$ (where $p$ and $q$ are primes) was finally resolved in 2021, see [10]. Fifteen years ago, mathematicians began addressing this…
Variational problems of splitting-type with mixed linear-superlinear growth conditions are considered. In the twodimensional case the minimizing problem is given by \[ J [w] = \int_{\Omega} \Big[f_1\big(\partial_1 w\big) +…
A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates…
We take a soliton solution of a classical non-linear integrable equation and quench (suddenly change) its non-linearity parameter. For that we multiply the amplitude or the width of a soliton by a numerical factor $\eta$ and take the…
We solve the Stokes equations for the flow around two parallel translating and rotating cylinders using tools from complex analysis and conformal mapping. By considering cylinders of arbitrary size and separation, we generalise the…
The Hamiltonian dynamics of chains of nonlinearly coupled particles is numerically investigated in two and three dimensions. Simple, off-lattice homopolymer models are used to represent the interparticle potentials. Time averages of…
A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…
Resource allocation problems in which demand is splittable are usually solved using different solution methods from their unsplittable equivalents. Although splittable problem instances can be the easier of the two (for example, they might…
We develop the connection between large deviation theory and more applied approaches to stochastic hybrid systems by highlighting a common underlying Hamiltonian structure. A stochastic hybrid system involves the coupling between a…
We are motivated by a tantalizing open question in exact algorithms: can we detect whether an $n$-vertex directed graph $G$ has a Hamiltonian cycle in time significantly less than $2^n$? We present new randomized algorithms that improve…
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…
\noindent An \textit{\(m \times n\) grid graph} is the induced subgraph of the square lattice whose vertex set consists of all integer grid points \(\{(i,j) : 0 \leq i < m,\ 0 \leq j < n\}\). Let $H$ and $K$ be Hamiltonian cycles in an $m…
A solution is given to the basic distributed feedback control problem for a multi-channel linear system assuming only that the system is jointly controllable, jointly observable and has an associated neighbor graph which is strongly…
A key operational challenge for call centers is to decide, in real time, which waiting customer should be served by which available agent. This is known as skill-based routing, and the decision becomes especially difficult in large systems…
In the weakened 16th Hilbert's Problem one asks for a bound of the number of limit cycles which appear after a polynomial perturbation of a planar polynomial Hamiltonian vector field. It is known that this number is finite for an individual…
We study the characterization of several distance problems for linear differential-algebraic systems with dissipative Hamiltonian structure. Since all models are only approximations of reality and data are always inaccurate, it is an…
We study homogenization of a class of bidimensional stationary Hamilton-Jacobi equations where the Hamiltonian is obtained by perturbing near a half-line of the state space a Hamiltonian that either does not have fast variations with…