English
Related papers

Related papers: On the Generalized Honeymoon Oberwolfach Problem

200 papers

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

Computational Geometry · Computer Science 2024-10-10 Oswin Aichholzer , Anna Brötzner , Daniel Perz , Patrick Schnider

The Wiener-Hopf equations are a Toeplitz system of linear equations that naturally arise in several applications in time series. These include the update and prediction step of the stationary Kalman filter equations and the prediction of…

Statistics Theory · Mathematics 2022-01-19 Suhasini Subba Rao , Junho Yang

The Hamilton-Waterloo Problem HWP$(v;m,n;\alpha,\beta)$ asks for a 2-factorization of the complete graph $K_v$ or $K_v-I$, the complete graph with the edges of a 1-factor removed, into $\alpha$ $C_m$-factors and $\beta$ $C_n$-factors, where…

Combinatorics · Mathematics 2019-02-26 A. C. Burgess , P. Danziger , T. Traetta

We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…

Number Theory · Mathematics 2016-07-11 Vincent Fleckinger , Ibrahim Abdoulkarim

Cohn--Conway--Elkies--Kumar [Experiment. Math. (2007)] described that one can construct a family of designs on $S^{2n-1}$ from a design on $\mathbb{CP}^{n-1}$. In this paper, we prove their claim for the case where $n=2$. That is, we give…

Metric Geometry · Mathematics 2015-06-30 Takayuki Okuda

The generalization of the Oberwolfach Problem, proposed by J. Liu in 2000, asks for a uniform $2$-factorization of the complete multipartite graph $K_{m\times n}$. Here we focus our attention on $2$-factorizations regular under the cyclic…

Combinatorics · Mathematics 2016-03-22 Anita Pasotti , Marco Antonio Pellegrini

The first author's geometric Hopf invariant of a stable map $F:\Sigma^{\infty}X \to \Sigma^{\infty}Y$ is a stable ${\mathbb Z}_2$-equivariant map $h(F):\Sigma^{\infty}X \to \Sigma^{\infty}(Y \wedge Y)$ constructed by an explicit difference…

Algebraic Topology · Mathematics 2017-10-09 Michael Crabb , Andrew Ranicki

The Howe dual pair (sl(2),O(m)) allows the characterization of the classical Fourier transform (FT) on the space of rapidly decreasing functions as the exponential of a well-chosen element of sl(2) such that the Helmholtz relations are…

Classical Analysis and ODEs · Mathematics 2018-08-14 H. De Bie , R. Oste , J. Van der Jeugt

Holroyd and Propp used Hall's marriage theorem to show that, given a probability distribution pi on a finite set S, there exists an infinite sequence s_1,s_2,... in S such that for all integers k >= 1 and all s in S, the number of i in…

Combinatorics · Mathematics 2010-07-15 Omer Angel , Alexander E. Holroyd , James B. Martin , James Propp

This paper presents a new extension of the classical Heron problem, termed the generalized $(k,m)$-Heron problem, which seeks an optimal configuration among $k$ feasible and $m$ target non-empty closed convex sets in $\mathbb{R}^n$. The…

Optimization and Control · Mathematics 2026-01-21 Triloki Nath , Manohar Choudhary , Ram K. Pandey

An approach by J.Wu describes homotopy groups $\pi_{n}(S^2)$ of the standard 2-sphere as isotopy classes of spherical $n+1$--strand Brunnian braids is investigated in the case $n=3$ for applications.

Geometric Topology · Mathematics 2016-08-03 Petr Mikhailovich Akhmet'ev

The holomorph of a discrete group $G$ is the universal semi-direct product of $G$. In chapter 1 we describe why it is an interesting object and state main results. In chapter 2 we recall the classical definition of the holomorph as well as…

Group Theory · Mathematics 2007-05-23 Maria S. Voloshina

The Hamilton-Waterloo problem asks for which $s$ and $r$ the complete graph $K_n$ can be decomposed into $s$ copies of a given 2-factor $F_1$ and $r$ copies of a given 2-factor $F_2$ (and one copy of a 1-factor if $n$ is even). In this…

Combinatorics · Mathematics 2016-05-09 Melissa Keranen , Adrián Pastine

Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication…

Computational Complexity · Computer Science 2007-10-16 Dima Grigoriev

Interpolation of data on non-Euclidean spaces is an active research area fostered by its numerous applications. This work considers the Hermite interpolation problem: finding a sufficiently smooth manifold curve that interpolates a…

Numerical Analysis · Mathematics 2024-02-27 Axel Séguin , Daniel Kressner

This paper is devoted to the study of infinitesimal limit cycles that can bifurcate from zero-Hopf equilibria of differential systems based on the averaging method. We develop an efficient symbolic program using Maple for computing the…

Symbolic Computation · Computer Science 2023-05-19 Bo Huang

For a partially multiplicative quandle (PMQ) $\mathcal{Q}$ we consider the topological monoid $\mathring{\mathrm{HM}}(\mathcal{Q})$ of Hurwitz spaces of configurations in the plane with local monodromies in $\mathcal{Q}$. We compute the…

Algebraic Topology · Mathematics 2024-11-20 Andrea Bianchi

We provide a sufficient condition for the nontriviality of the Lipschitz homotopy group of the Heisenberg group, $\pi_m^{Lip}(H_n)$, in terms of properties of the classical homotopy group of the sphere, $\pi_m(S^n)$. As an application we…

Geometric Topology · Mathematics 2013-12-02 Piotr Hajlasz , Armin Schikorra , Jeremy T. Tyson

In a mathematics workshop with $mn$ mathematicians from $n$ different areas, each area consisting of $m$ mathematicians, we want to create a collaboration network. For this purpose, we would like to schedule daily meetings between groups of…

Combinatorics · Mathematics 2021-02-08 Amin Bahmanian

We show that the complete symmetric digraph $K_{2m}^\ast$ admits a resolvable decomposition into directed cycles of length $m$ for all odd $m$, $5 \le m \le 49$. Consequently, $K_{n}^\ast$ admits a resolvable decomposition into directed…

Combinatorics · Mathematics 2017-06-22 Andrea Burgess , Nevena Francetic , Mateja Sajna