English
Related papers

Related papers: On the Generalized Honeymoon Oberwolfach Problem

200 papers

We consider Stable Marriage with Covering Constraints (SMC): in this variant of Stable Marriage, we distinguish a subset of women as well as a subset of men, and we seek a matching with fewest number of blocking pairs that matches all of…

Data Structures and Algorithms · Computer Science 2019-10-08 Matthias Mnich , Ildikó Schlotter

In 1976, Knuth asked if the stable marriage problem (SMP) can be generalized to marriages consisting of 3 genders. In 1988, Alkan showed that the natural generalization of SMP to 3 genders ($3$GSM) need not admit a stable marriage. Three…

Computational Complexity · Computer Science 2014-12-04 Rafail Ostrovsky , Will Rosenbaum

We address the last outstanding case of the directed Oberwolfach problem with two tables of different lengths. Specifically, we show that the complete symmetric directed graph $K^*_n$ admits a decomposition into spanning subdigraphs…

Combinatorics · Mathematics 2024-08-21 Daniel Horsley , Alice Lacaze-Masmonteil

We develop a geometric approach to stable homotopy groups of spheres in the spirit of the work of Pontrjagin and Rokhlin. A new proof of the Hopf Invariant One Theorem by J.F.Adams is obtained in all dimensions except 15 and 31. To prove…

Algebraic Topology · Mathematics 2009-05-07 Petr M. Akhmet'ev

This paper studies various Hopf bifurcations in the two-dimensional plane Poiseuille problem. For several values of the wavenumber $\alpha$, we obtain the branch of periodic flows which are born at the Hopf bifurcation of the laminar flow.…

Dynamical Systems · Mathematics 2015-05-28 Pablo S. Casas , Angel Jorba

We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…

Combinatorics · Mathematics 2019-02-05 Ondřej Turek , Dardo Goyeneche

Starting from Borel's description of the mod-2 cohomology of real flag manifolds, we give a minimal presentation of the cohomology ring for semi complete flag manifolds $F_{k,m}:=F(1,\ldots,1,m)$ where $1$ is repeated $k$ times. The…

Algebraic Topology · Mathematics 2015-11-19 Jesús González , Barbara Gutiérrez , Darwin Gutiérrez , Adriana Lara

Let $P^{2n+1}$ be a two-cell complex which is formed by attaching a $(2n+1)$--cell to a $2m$--sphere by a suspension map. We construct a universal space $U$ for $P^{2n+1}$ in the category of homotopy associative, homotopy commutative…

Algebraic Topology · Mathematics 2007-05-23 Jelena Grbic

Let $F$ be a $2$-regular graph of order $v$. The Oberwolfach problem, $OP(F)$, asks for a $2$-factorization of the complete graph on $v$ vertices in which each $2$-factor is isomorphic to $F$. In this paper, we give a complete solution to…

Combinatorics · Mathematics 2019-08-15 Simone Costa

Constrained optimization demands highly efficient solvers which promotes the development of learn-to-optimize (L2O) approaches. As a data-driven method, L2O leverages neural networks to efficiently produce approximate solutions. However, a…

Machine Learning · Computer Science 2025-02-04 Ke Deng , Hanwen Zhang , Jin Lu , Haijian Sun

The strong truncated Hamburger moment problem (STHMP) of degree $(-2k_1,2k_2)$ asks to find necessary and sufficient conditions for the existence of a positive Borel measure, supported on $\mathbb{R}\setminus \{0\}$, such that $\beta_i=\int…

Functional Analysis · Mathematics 2022-12-06 Aljaž Zalar

The Birkhoff polytope (the convex hull of the set of permutation matrices) is frequently invoked in formulating relaxations of optimization problems over permutations. The Birkhoff polytope is represented using $\Theta(n^2)$ variables and…

Optimization and Control · Mathematics 2016-02-16 Cong Han Lim , Stephen J. Wright

The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit…

Computational Complexity · Computer Science 2009-02-17 Joshua Brody , Amit Chakrabarti

We enumerate arrangements of $n$ couples, i.e. pairs of people, placed in a single-file queue, and consider four statistics from the vantage point of a distinguished given couple. In how many arrangements are exactly $p$ of the $n-1$ other…

Combinatorics · Mathematics 2020-07-30 Donovan Young

Optimized Pulse Patterns (OPPs) are gaining increasing popularity in the power electronics community over the well-studied pulse width modulation due to their inherent ability to provide the switching instances that optimize current…

Optimization and Control · Mathematics 2020-10-29 Lukas Wachter , Orcun Karaca , Georgios Darivianakis , Themistoklis Charalambous

Explainable multi-hop question answering (QA) not only predicts answers but also identifies rationales, i. e. subsets of input sentences used to derive the answers. This problem has been extensively studied under the supervised setting,…

Computation and Language · Computer Science 2023-05-24 Wenting Zhao , Justin T. Chiu , Claire Cardie , Alexander M. Rush

Genome assembly is a fundamental problem in Bioinformatics, where for a given set of overlapping substrings of a genome, the aim is to reconstruct the source genome. The classical approaches to solving this problem use assembly graphs, such…

Data Structures and Algorithms · Computer Science 2021-06-14 Shahbaz Khan

The notion of quantum algebras is merged with that of Lie systems in order to establish a new formalism called Poisson-Hopf algebra deformations of Lie systems. The procedure can be naturally applied to Lie systems endowed with a symplectic…

Mathematical Physics · Physics 2021-01-28 Eduardo Fernandez-Saiz

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

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

Combinatorics · Mathematics 2016-08-19 Robert Coquereaux , Jean-Bernard Zuber