English
Related papers

Related papers: The Honeymoon Oberwolfach Problem: small cases

200 papers

We express the rational homotopy type of the mapping spaces $\mathrm{Map}^h(\mathsf D_m,\mathsf D_n^{\mathbb Q})$ of the little discs operads in terms of graph complexes. Using known facts about the graph homology this allows us to compute…

Quantum Algebra · Mathematics 2017-03-20 Benoit Fresse , Victor Turchin , Thomas Willwacher

Finding schedules for pairwise meetings between the members of a complex social group without creating interpersonal conflict is challenging, especially when different relationships have different needs. We formally define and study the…

Data Structures and Algorithms · Computer Science 2024-03-28 Leszek Gąsieniec , Benjamin Smith , Sebastian Wild

In the $(k,m)$-mappability problem, for a given sequence $T$ of length $n$, the goal is to compute a table whose $i$th entry is the number of indices $j \ne i$ such that the length-$m$ substrings of $T$ starting at positions $i$ and $j$…

Data Structures and Algorithms · Computer Science 2021-06-18 Panagiotis Charalampopoulos , Costas S. Iliopoulos , Tomasz Kociumaka , Solon P. Pissis , Jakub Radoszewski , Juliusz Straszyński

Riemann-Hilbert problems are jump problems for holomorphic functions along given interfaces. They arise in various contexts, e.g. in the asymptotic study of certain nonlinear partial differential equations and in the asymptotic analysis of…

Complex Variables · Mathematics 2024-04-05 Haakan Hedenmalm

We prove the non-existence of Hopf orders over number rings for two families of complex semisimple Hopf algebras. They are constructed as Drinfel'd twists of group algebras for the following groups: $A_n$, the alternating group on $n$…

Quantum Algebra · Mathematics 2019-01-16 Juan Cuadra , Ehud Meir

We define the Homomorphism Extension (HomExt) problem: given a group $G$, a subgroup $M \leq G$ and a homomorphism $\varphi: M \to H$, decide whether or not there exists a homomorphism $\widetilde{\varphi}: G\to H$ extending $\varphi$,…

Data Structures and Algorithms · Computer Science 2018-06-22 Angela Wuu

This paper is about the existence of periodic orbits near an equilibrium point of a two-degree-of-freedom Hamiltonian system. The equilibrium is supposed to be a nondegenerate minimum of the Hamiltonian. Every sphere-like component of the…

Dynamical Systems · Mathematics 2025-03-06 C. Grotta-Ragazzo , Lei Liu , Pedro A. S. Salomão

Conjunctive normal forms where every clause has length at most two are called 2-CNFs. We study minimally unsatisfiable 2-CNFs (2-MUs), that is, unsatisfiable 2-CNFs where removing any clause destroys unsatisfiability, and obtain their full…

Discrete Mathematics · Computer Science 2026-04-24 Hoda Abbasizanjani , Oliver Kullmann

We study the emergence of symmetric oscillatory behavior in multi-agent systems where each agent incorporates a continuous memory of its past states and past rates of change, modeled by distributed retarded and neutral delays. The…

Dynamical Systems · Mathematics 2026-04-23 Casey Crane

In this paper, we study the Hospitals / Residents problem with Couples (HRC), where a solution is a stable matching or a report that none exists. We present a novel polynomial-time algorithm that can find a near-feasible stable matching…

Data Structures and Algorithms · Computer Science 2024-09-26 Gergely Csáji , David Manlove , Iain McBride , James Trimble

We construct a zig-zag from the once delooped space of pseudoisotopies of a closed $2n$-disc to the once looped algebraic $K$-theory space of the integers and show that the maps involved are $p$-locally $(2n-4)$-connected for $n>3$ and…

Algebraic Topology · Mathematics 2022-03-01 Manuel Krannich

We construct new resolvable decompositions of complete multigraphs and complete equipartite multigraphs into cycles of variable lengths (and a perfect matching if the vertex degrees are odd). We develop two techniques: {\em layering}, which…

Combinatorics · Mathematics 2018-09-26 Amin Bahmanian , Mateja Šajna

We introduce the problem of hidden Hamiltonian cycle recovery, where there is an unknown Hamiltonian cycle in an $n$-vertex complete graph that needs to be inferred from noisy edge measurements. The measurements are independent and…

Discrete Mathematics · Computer Science 2018-04-18 Vivek Bagaria , Jian Ding , David Tse , Yihong Wu , Jiaming Xu

The uniform Hamilton-Waterloo Problem (HWP) asks for a resolvable $(C_M, C_N)$-decomposition of $K_v$ into $\alpha$ $C_M$-factors and $\beta$ $C_N$-factors. We denote a solution to the uniform Hamilton Hamilton-Waterloo problem by…

Combinatorics · Mathematics 2024-02-16 Zazil Santizo Huerta , Melissa Keranen

We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. This paper deals with a case in which the hubs are…

Data Structures and Algorithms · Computer Science 2021-06-03 Yuko Kuroki , Tomomi Matsui

The following optimization problem was introduced in \cite{gutinDAM}, where it was motivated by a real-world problem in defence logistics. Suppose we are given a pair of digraphs $D,H$ and a positive cost $c_i(u)$ for each $u\in V(D)$ and…

Discrete Mathematics · Computer Science 2007-05-23 G. Gutin , A. Rafiey , A. Yeo

The stable marriage problem requires one to find a marriage with no blocking pair. Given a matching that is not stable, Roth and Vande Vate have shown that there exists a sequence of matchings that leads to a stable matching in which each…

Computer Science and Game Theory · Computer Science 2023-05-18 Vijay Kumar Garg , Changyong Hu

This paper pursues the study carried out by the authors in "Stability and Hopf bifurcation in a hexagonal governor system", focusing on the codimension one Hopf bifurcations in the hexagonal Watt governor differential system. Here are…

Dynamical Systems · Mathematics 2015-05-13 Jorge Sotomayor , Luis Fernando Mello , Denis de Carvalho Braga

We introduce the Observation Route Problem ($\textsf{ORP}$) defined as follows: Given a set of $n$ pairwise disjoint compact regions in the plane, find a shortest tour (route) such that an observer walking along this tour can see (observe)…

Computational Geometry · Computer Science 2024-11-04 Adrian Dumitrescu , Csaba D. Tóth

A ferrofluid droplet confined in a Hele-Shaw cell can be deformed into a stably spinning ``gear,'' using crossed magnetic fields. Previously, fully nonlinear simulation revealed that the spinning gear emerges as a stable traveling wave…

Pattern Formation and Solitons · Physics 2023-05-19 Zongxin Yu , Ivan C. Christov