Related papers: The simultaneous conjugacy problem in the symmetri…

Let $S_1, S_2 \in \Sigma^*$ strings, we say that $S_1$ {\em jumble match} $S_2$ if they are permutations of each other. Given a text $T$ of size $N$ and a string $S \in \Sigma^*$, the problem of \emph{Jumbled Pattern Matching} (JPM) is to…

The assignment problem takes as input two finite point sets S and T and establishes a correspondence between points in S and points in T, such that each point in S maps to exactly one point in T, and each point in T maps to at least one…

This paper is concerned with the $1||\sum p_jU_j$ problem, the problem of minimizing the total processing time of tardy jobs on a single machine. This is not only a fundamental scheduling problem, but also a very important problem from a…

It is explained how a locally convex (lc) topology $\tau$ on a real vector space $V$ extends to a locally multiplicatively convex (lmc) topology $\overline{\tau}$ on the symmetric algebra $S(V)$. This allows the application of the results…

Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work…

In this paper we introduce the 'simultaneous membership problem', defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two graphs G_1 and G_2, sharing some vertices X (and the…

We revisit the Subset Sum problem over the finite cyclic group $\mathbb{Z}_m$ for some given integer $m$. A series of recent works has provided near-optimal algorithms for this problem under the Strong Exponential Time Hypothesis. Koiliaris…

Let $S$ be a string of length $n$ over an alphabet $\Sigma$ and let $Q$ be a subset of $\Sigma$ of size $q \geq 2$. The 'co-occurrence problem' is to construct a compact data structure that supports the following query: given an integer $w$…

Most evolutionary algorithms (EAs) used in practice employ crossover. In contrast, only for few and mostly artificial examples a runtime advantage from crossover could be proven with mathematical means. The most convincing such result shows…

In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…

We consider the problem of minimizing the total processing time of tardy jobs on a single machine. This is a classical scheduling problem, first considered by [Lawler and Moore 1969], that also generalizes the Subset Sum problem. Recently,…

The problem of spontaneous pair creation in static external fields is reconsidered. A weak version of the conjecture proposed by G Nenciu (1980) is seated and proved. The method reduces the proof of the general conjecture to the study of…

Let $P\in Sp(2n)$ satisfying $P^{k}=I_{2n}$, we consider the minimal $P$-symmetric period problem of the autonomous nonlinear Hamiltonian system \begin{equation*} \dot x(t) = JH^{\prime}(x(t)). \end{equation*} For some symplectic matrices…

In this note we study the problem of simultaneous stabilization for the algebra $A_\R(\D)$. Invertible pairs $(f_j,g_j)$, $j=1,..., n$, in a commutative unital algebra are called \textit{simultaneously stabilizable} if there exists a pair…

In this paper we generalize techniques of Belk-Matucci to solve the conjugacy problem for every Thompson-like group $V_n(H)$, where $n \geq 2$ and $H$ is a subgroup of the symmetric group on $n$ elements. We use this to prove that, if $n…

Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…

We address the problem of identifying the (nonstationary) quantum systems that admit supersymmetric dynamical invariants. In particular, we give a general expression for the bosonic and fermionic partner Hamiltonians. Due to the…

We present new, faster pseudopolynomial time algorithms for the $k$-Subset Sum problem, defined as follows: given a set $Z$ of $n$ positive integers and $k$ targets $t_1, \ldots, t_k$, determine whether there exist $k$ disjoint subsets…

We present a new approach for solving (minimum disagreement) correlation clustering that results in sublinear algorithms with highly efficient time and space complexity for this problem. In particular, we obtain the following algorithms for…

We present efficient algorithms for simultaneously computing Kendall's tau and the jackknife estimator of its variance. For the classical pairwise tau, we describe a modification of Knight's algorithm (originally designed to compute only…