English
Related papers

Related papers: On the existence of cyclic difference sets with sm…

200 papers

We study the number of limit cycles and the bifurcation diagram in the Poincar\'{e} sphere of a one-parameter family of planar differential equations of degree five $\dot {\bf x}=X_b({\bf x})$ which has been already considered in previous…

Dynamical Systems · Mathematics 2012-02-10 J. D. García-Saldaña , A. Gasull , H. Giacomini

In [13], K. Roth showed that the expected value of the $L^2$ discrepancy of the cyclic shifts of the $N$ point van der Corput set is bounded by a constant multiple of $\sqrt{\log N}$, thus guaranteeing the existence of a shift with…

Number Theory · Mathematics 2008-11-13 Dmitriy Bilyk

New results on pentagonal geometries PENT(k,r) with block sizes k = 3 or k = 4 are given. In particular we completely determine the existence spectra for PENT(3,r) systems with the maximum number of opposite line pairs as well as those…

Combinatorics · Mathematics 2020-07-22 Anthony D. Forbes , Terry S. Griggs , Klara Stokes

In this paper, we first obtain some analogues of a formula of Zagier (1995) and Stanley (2011). For instance, we prove that the number of pairs of $n$-cycles whose product has $k$ cycles and has $m$ given elements contained in distinct…

Combinatorics · Mathematics 2019-10-01 Ricky X. F. Chen

We consider vectors from $\{0,1\}^n$. The weight of such a vector $v$ is the sum of the coordinates of $v$. The distance ratio of a set $L$ of vectors is ${\rm dr}(L):=\max \{\rho(x,y):\ x,y \in L\}/ \min \{\rho(x,y):\ x,y \in L,\ x\neq…

Discrete Mathematics · Computer Science 2012-12-04 Gregory Gutin , Mark Jones

We show a $n^2 \cdot 2^{n/2}$ upper bound on the number of $(132,213)$ avoiding cyclic permutations. This is the first nontrivial upper bound on the number of such permutations. We also construct an algorithm to determine whether a…

Combinatorics · Mathematics 2019-03-14 Brice Huang

We provide a simple proof of the existence of a planar separator by showing that it is an easy consequence of the circle packing theorem. We also reprove other results on separators, including: (A) There is a simple cycle separator if the…

Computational Geometry · Computer Science 2025-10-07 Sariel Har-Peled

Frame difference families, which can be obtained via a careful use of cyclotomic conditions attached to strong difference families, play an important role in direct constructions for resolvable balanced incomplete block designs. We…

Combinatorics · Mathematics 2018-02-06 Simone Costa , Tao Feng , Xiaomiao Wang

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…

Combinatorics · Mathematics 2025-10-02 Michael Kiermaier , Reinhard Laue , Alfred Wassermann

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-05-03 Tingfang Chen , Cunsheng Ding , Chengju Li , Zhonghua Sun

Skew Hadamard difference sets are an interesting topic of study for over seventy years. For a long time, it had been conjectured the classical Paley difference sets (the set of nonzero quadratic residues in $\mathbb{F}_q$ where $q \equiv 3…

Combinatorics · Mathematics 2013-05-09 Cunsheng Ding , Alexander Pott , Qi Wang

We present a simpler proof of the existence of an exact number of one or more limit cycles to the Lienard system $\dot{x}=y-F(x) $, $\dot {y}=-g(xt)$, under weaker conditions on the odd functions $F(x) $ and $g(x) $ as compared to those…

Classical Analysis and ODEs · Mathematics 2010-08-16 Aniruddha Palit , Dhurjati Prasad Datta

We give a simple proof of the fact that - in all dimensions - there are no homogeneous solutions to the thin obstacle problem with frequency $\lambda$ belonging to intervals of the form $(2k,2k+1)$, $k \in \mathbb{N}$. In particular, there…

Analysis of PDEs · Mathematics 2024-12-19 Federico Franceschini , Ovidiu Savin

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

Number Theory · Mathematics 2019-02-06 Nathan McNew

A $2t$-cycle system of order $v$ is a set $\mathcal{C}$ of cycles whose edges partition the edge-set of $K_v-I$ (i.e., the complete graph minus the $1$-factor $I$). If $v\equiv 0 \pmod{2t}$, a set of $v/2t$ vertex-disjoint cycles of…

Combinatorics · Mathematics 2016-04-01 Peter Danziger , Eric Mendelsohn , Tommaso Traetta

A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is…

Combinatorics · Mathematics 2024-02-21 Stefan Steinerberger

Strong difference families are an interesting class of discrete structures which can be used to derive relative difference families. Relative difference families are closely related to $2$-designs, and have applications in constructions for…

Combinatorics · Mathematics 2017-08-14 Simone Costa , Tao Feng , Xiaomiao Wang

In this paper we prove the existence of real-analytic natural Hamiltonian systems - i.e. where H(q,p)=T(q,p)+V(q) in the 2N-dimensional real space, where N is any integer greater than 1 - with non critical energy levels E for the potential…

Dynamical Systems · Mathematics 2014-06-04 R. Giambò , F. Giannoni , P. Piccione

It is conjectured that Hadamard matrices exist for all orders $4t$ ($t>0$). However, despite a sustained effort over more than five decades, the strongest overall existence results are asymptotic results of the form: for all odd natural…

Combinatorics · Mathematics 2010-03-23 Warwick de Launey

We prove that $\mathop{\mathbb{E}}_{m \leq M} \mathop{\mathbb{E}}_{n \leq N} \Lambda(n) \Lambda\bigl(n + \lfloor m^c \rfloor\bigr) = 1 + \rm{O}(\log^{2 - Bc} N)$, where $c > 2$ is a non-integer, $B \geq 3/c$, and $M$ is of order $N^{1/c}…

Number Theory · Mathematics 2024-11-27 Bora Çalım , Ioannis Iakovakis , Sophie Long , Jack Moffatt , Deborah Wooton