English
Related papers

Related papers: Almost resolvable $k$-cycle systems with $k\equiv …

200 papers

Let $S_{n}$ denote the set of permutations of $[n]=\{1,2,\dots, n\}$. For a positive integer $k$, define $S_{n,k}$ to be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles, i.e., \[ S_{n,k} = \{\pi \in S_{n}: \pi =…

Combinatorics · Mathematics 2014-02-05 Cheng Yeaw Ku , Kok Bin Wong

In this paper we study collections of mutually nearly orthogonal Latin squares ($\text{MNOLS}$), which come from a modification of the orthogonal condition for mutually orthogonal Latin squares. In particular, we find the maximum $\mu$ such…

Combinatorics · Mathematics 2018-11-06 F. Demirkale , D. M. Donovan , J. I. Kokkala , T. G. Marbach

Let N be a large enough natural number, A and B be subsets of {N+1, ... , 2N}. In this paper, we prove that there exists integers a, b with a belongs to A, b belongs to B such that ab=P_k^2 + O(P_k^{1-c}), where 0<c<1/2 and P_k denotes an…

Number Theory · Mathematics 2024-11-26 Yuetong Zhao , Wenguang Zhai

We give a polynomial improvement to the cycle-complete Ramsey numbers \[ r(C_{\ell},K_k) \geq k^{1+1/(\ell- 2) + \varepsilon_{\ell} + o(1)}, \] for all fixed odd $\ell > 7$ with $k \rightarrow \infty$, for some $\varepsilon_{\ell} > 0$.

Combinatorics · Mathematics 2026-05-05 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Florian Pfender , Julian Sahasrabudhe

Let $T_{\ell,k}(n)$ denote the number of $\ell$-regular $k$-tuple partitions of $n$. In a recent work, Nath, Saikia, and Sarma derived several families of congruences for $T_{\ell,k}(n)$, with particular emphasis on the cases $T_{2,3}(n)$…

Number Theory · Mathematics 2025-03-18 Bishnu Paudel , James A. Sellers , Haiyang Wang

We show that there exists an absolute constant $A$ such that the size Ramsey number of a pair of cycles $(C_n$, $C_{2d})$, where $4\le 2d\le n$, is bounded from above by $An$. We also study the restricted size Ramsey number for such a pair.

Combinatorics · Mathematics 2023-09-01 Małgorzata Bednarska-Bzdęga , Tomasz Łuczak

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…

Group Theory · Mathematics 2018-08-02 Morteza Baniasad Azad , Behrooz Khosravi

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

Number Theory · Mathematics 2025-08-18 Robert Dougherty-Bliss , Mits Kobayashi , Natalya Ter-Saakov , Eugene Zima

Bermond and Thomassen conjectured that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex disjoint cycles. So far the conjecture was verified for $k\le 3$. Here we generalise the question asking for all outdegree…

Combinatorics · Mathematics 2022-08-18 Mikołaj Lewandowski , Joanna Polcyn , Christian Reiher

In this paper, we present a method of higher-order analysis on bifurcation of small limit cycles around an elementary center of integrable systems under perturbations. This method is equivalent to higher-order Melinikov function approach…

Dynamical Systems · Mathematics 2017-08-29 Yun Tian , Pei Yu

Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at least $k$ vertices is considered long. When $k \le 3$, the…

Data Structures and Algorithms · Computer Science 2022-08-08 Mingyang Gong , Brett Edgar , Jing Fan , Guohui Lin , Eiji Miyano

Let $S_{n}$ denote the set of permutations of $[n]=\{1,2,\dots, n\}$. For each integer $k\geq 1$, let $S_{n,k}$ be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles. A subset $H\subseteq S_{n,k}$ is to be a matching if…

Combinatorics · Mathematics 2025-08-26 Cheng Yeaw Ku , Kok Bin Wong

We present efficient counting and sampling algorithms for random $k$-SAT when the clause density satisfies $\alpha \le \frac{2^k}{\mathrm{poly}(k)}.$ In particular, the exponential term $2^k$ matches the satisfiability threshold…

Data Structures and Algorithms · Computer Science 2024-11-06 Zongchen Chen , Aditya Lonkar , Chunyang Wang , Kuan Yang , Yitong Yin

Let $S_{g}$ denote the genus $g$ closed orientable surface. For $k\in \mathbb{N}$, a $k$-system is a collection of pairwise non-homotopic simple closed curves such that no two intersect more than $k$ times. Juvan-Malni\v{c}-Mohar…

Geometric Topology · Mathematics 2016-02-25 Tarik Aougab

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

Combinatorics · Mathematics 2015-06-15 Daniel Horsley , Rosalind A. Hoyte

We consider quasinormal modes with complex energies from the point of view of the theory of quasi-exactly solvable (QES) models. We demonstrate that it is possible to find new potentials which admit exactly solvable or QES quasinormal modes…

High Energy Physics - Theory · Physics 2008-11-26 Choon-Lin Ho , Hing-Tong Cho

We study almost automorphic solutions of the discrete delayed neutral dynamic system% \[ x(t+1)=A(t)x(t)+\Delta Q(t,x(t-g(t)))+G(t,x(t),x(t-g(t))) \] by means of a fixed point theorem due to Krasnoselskii. Using discrete variant of…

Functional Analysis · Mathematics 2015-11-06 Murat Adıvar , H. Can Koyuncuoglu

We propose a family of mixed finite elements that are robust for the nearly incompressible strain gradient model, which is a fourth-order singular perturbed elliptic system. The element is similar to [C. Taylor and P. Hood, Comput. &…

Numerical Analysis · Mathematics 2023-03-30 Yulei Liao , Pingbing Ming , Yun Xu

The theta cycle of a modular form modulo a prime $p\geq 5$ is well understood. By contrast, the theta cycle modulo a power of $p$ is still mysterious and experimentally erratic. Here we completely determine the theta cycle of a weight $k <…

Number Theory · Mathematics 2026-04-08 Scott Ahlgren , Martin Raum , Olav K. Richter

Let $ k \geq 2 $ and $ ( L_{n}^{(k)} )_{n \geq 2-k} $ be the $k-$generalized Lucas sequence with initial condition $ L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)}=0 ,$ $ L_{0}^{(k,}=2,$ $ L_{1}^{(k)}=1$ and each term afterwards is the sum of the $…

Number Theory · Mathematics 2023-01-19 Alaa Altassan , Murat Alan