Related papers: A tour problem on a toroidal board
Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct…
It is shown that tiling in icosahedral quasicrystals can also be properly described by cyclic twinning at the unit cell level. The twinning operation is applied on the primitive prolate golden rhombohedra, which can be considered a result…
A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem for circular arc graphs: for n arcs, if m and M are the minimum and maximum number of arcs that contain a common…
Trajectory recommendation is the problem of recommending a sequence of places in a city for a tourist to visit. It is strongly desirable for the recommended sequence to avoid loops, as tourists typically would not wish to revisit the same…
It is proved that the broken circuit complex of an ordered matroid is Gorenstein if and only if it is a complete intersection. Several characterizations for a matroid that admits such an order are then given, with particular interest in the…
We present an improved version of the cyclic covering trick, which works inside the category of toroidal embeddings
We study the problem of Nadler and Quinn from 1972, which asks whether, given an arc-like continuum $X$ and a point $x \in X$, there exists an embedding of $X$ in $\mathbb{R}^2$ for which $x$ is an accessible point. We develop the notion of…
This paper investigates the low-rank tensor completion problem, which is about recovering a tensor from partially observed entries. We consider this problem in the tensor train format and extend the preconditioned metric from the matrix…
In the order picking problem, a picker has to collect a number of products in a warehouse with a minimum length tour. Ratliff and Rosenthal gave a linear algorithm solving the order picking problem in the case where the warehouse has two…
We propose a novel non-linear extension to the Orienteering Problem (OP), called the Correlated Orienteering Problem (COP). We use COP to model the planning of informative tours for the persistent monitoring of a spatiotemporal field with…
We consider the multiple traveling salesman problem on a weighted tree. In this problem there are $m$ salesmen located at the root initially. Each of them will visit a subset of vertices and return to the root. The goal is to assign a tour…
Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that interplay. We show that this number is not trivial, and we…
We present a comprehensive study of vortex structures in $d$-wave superconductors from large-scale renormalized mean-field theory of the square-lattice $t$-$t'$-$J$ model, which has been shown to provide a quantitative modeling for…
We give an optical physicist view of the problem of the trajectories in a polygonal billiard using only basic facts of Optics and the theory of functions of a complex variable. This approach allow us to stablish a certain correspondence…
We consider a large family F of torus bundles over the circle, and we use recent work of Li--Mak to construct, on each Y in F, a Stein fillable contact structure C. We prove that (i) each Stein filling of (Y,C) has vanishing first Chern…
It was shown by Beisegel, Chudnovsky, Gurvich, Milani\v{c}, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in…
In this paper a closed form expression for the number of tilings of an $n\times n$ square border with $1\times 1$ and $2\times1$ cuisenaire rods is proved using a transition matrix approach. This problem is then generalised to $m\times n$…
We review the condensation completion of a modular tensor category $\mathcal{C}$, which yields a fusion 2-category $\Sigma\mathcal{C}$ of separable algebras, bimodules over algebras and bimodule maps in $\mathcal{C}$. Physically,…
We present an approach for the traveling salesman problem with graph metric based on Steiner cycles. A Steiner cycle is a cycle that is required to contain some specified subset of vertices. For a graph $G$, if we can find a spanning tree…
The rational covariance extension problem to determine a rational spectral density given a finite number of covariance lags can be seen as a matrix completion problem to construct an infinite-dimensional positive-definite Toeplitz matrix…