Related papers: On the Generalized Honeymoon Oberwolfach Problem

Witten- Helffer-Sj\"ostrand theory is a considerable addition to the De Rham- Hodge theory for Riemannian manifolds and can serve as a general tool to prove results about comparison of numerical invariants associated to compact manifolds…

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

We study orbits and reachable sets of generic couples of Hamiltonians $H_1, H_2$ on a symplectic manifold $N$. We prove that, $C^k$-generically for $k$ large enough, orbits coincide with the whole of $N$, and that the same is true for…

Generalized permutahedra are a family of polytopes with a rich combinatorial structure and strong connections to optimization. We prove that they are the universal family of polyhedra with a certain Hopf algebraic structure. Their antipode…

We consider stable and popular matching problems in arbitrary graphs, which are referred to as stable roommates instances. We extend the 3/2-approximation algorithm for the maximum size weakly stable matching problem to the roommates case,…

We give an explicit formula for the probability that the convex hull of an $n$-step random walk in $R^d$ does not contain the origin, under the assumption that the distribution of increments of the walk is centrally symmetric and puts no…

Let $p$ be an odd prime, and fix integers $m$ and $n$ such that $0<m<n\leq (p-1)(p-2)$. We give a $p$-local homotopy decomposition for the loop space of the complex Stiefel manifold $W_{n,m}$. Similar decompositions are given for the loop…

This paper presents the Tate pairing computation on generalized Huff curves proposed by Wu and Feng. In fact, we extend the results of the Tate pairing computation on the standard Huff elliptic curves done previously by Joye, Tibouchi and…

The Hospitals / Residents problem with Couples (HRC) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is…

The Oberwolfach Problem $OP(F)$ -- posed by Gerhard Ringel in 1967 -- is a paradigmatic Combinatorial Design problem asking whether the complete graph $K_v$ decomposes into edge-disjoint copies of a $2$-regular graph $F$ of order $v$. In…

In the study of the periodic solutions of a $\Gamma$-equivariant dynamical system, the $H~\mathrm{mod}~K$ theorem gives all possible periodic solutions, based on group-theoretical aspects. By contrast, the equivariant Hopf theorem…

We prove that $K_n+I$, the complete graph of an even order with a $1$-factor duplicated, admits a decomposition into $2$-factors, each a disjoint union of cycles of length $m \geq 5$ if and only if $m \mid n$, except possibly when $m$ is…

A classical diffusion model of Ehrenfest which consists of $2$-urns and $n$-balls is realized by a finite Gelfand pair $(H_{n},S_{n})$, where $H_{n}$ is the hyperoctahedral group and $S_{n}$ is the symmetric group. This fact can be…

In this paper we study generalized Poincar\'e-Andronov-Hopf bifurcations of discrete dynamical systems. We prove a general result for attractors in n-dimensional manifolds satisfying some suitable conditions. This result allows us to obtain…

We devise a Hybrid High-Order (HHO) method for highly oscillatory elliptic problems that is capable of handling general meshes. The method hinges on discrete unknowns that are polynomials attached to the faces and cells of a coarse mesh;…

We study the self-dual Hopf algebra $\h\_{\SP}$ of special posets introduced by Malvenuto and Reutenauer and the Hopf algebra morphism from $\h\_{\SP}$ to to the Hopf algebra of free quasi-symmetric functions $\FQSym$ given by linear…

The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to any two-sided market. In the classical formulation, n…

The Meeting problem for $k\geq 2$ searchers in a polygon $P$ (possibly with holes) consists in making the searchers move within $P$, according to a distributed algorithm, in such a way that at least two of them eventually come to see each…

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…

We prove a conjecture of Adamaszek generalizing the seating couples problem to the case of $2n$ seats. Concretely, we prove that given a positive integer $n$ and $d_1,\ldots,d_n\in(\mathbb{Z}/2n)^*$ we can partition $\mathbb{Z}/2n$ into $n$…