相关论文: On the existence of cyclic difference sets with sm…

Even though Peltesohn proved that a cyclic (v,3,1)-design exists if and only if $v\equiv 1,3\pmod{6}$ as early as 1939, the problem of determining the spectrum of cyclic (v,k,1)-designs with k>3 is far from being settled, even for k=4. This…

There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…

A $(v,k,\lambda)$ difference set in a group $G$ of order $v$ is a subset $\{d_1, d_2, \ldots,d_k\}$ of $G$ such that $D=\sum d_i$ in the group ring $\mathbb{Z}[G]$ satisfies $$D D^{-1} = n + \lambda G,$$ where $n=k-\lambda$. If $D=\sum s_i…

In this article, we study symmetric $(v, k, \lambda)$ designs admitting a flag-transitive and point-primitive automorphism group $G$ whose socle $X$ is a finite simple exceptional group of Lie type. We prove a reduction theorem, severely…

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

Given a subgroup $H$ of a group $(G,+)$, a $(G,H,k,1)$ difference family (DF) is a set $\mathcal F$ of $k$-subsets of $G$ such that $\{f-f':f,f'\in F, f\neq f',F\in \mathcal F\}=G\setminus H$. Let $g\mathbb Z_{gh}$ is the subgroup of order…

It is conjectured that the question of the existence of projective planes whose order is not a power of prime is intimately linked with the problem whether there exists a set of d+1 mutually unbiased bases in a d-dimensional Hilbert space…

Let lambda_1, \lambda_2, \lambda_3, \lambda_4 be non-zero real numbers, not all negative, with \lambda_1/\lambda_2 irrational and algebraic. Suppose that \mathcal{V} is a well-spaced sequence and \delta >0. In this paper, it is proved that…

We complete the enumeration of cyclic permutations avoiding two patterns of length three each by providing explicit formulas for all but one of the pairs for which no such formulas were known. The pair $(123,231)$ proves to be the most…

Building on the results of our previous work on Euclidean leaper tours, considering all integers $k>1$ and $h>0$, we study the existence of Hamiltonian cycles in the vertex set $C(2,k):=\{0,1\}^k$ of the $k$-dimensional hypercube when the…

We study planar piecewise quadratic differential systems of Kolmogorov type. Specifically, we consider systems with both coordinate axes invariant and with a separation line that is straight and distinct from the invariant axes. The main…

In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C^p is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to (2p-2)!/(p-1)!^2. In particular, the number of complex…

We prove that the number of limit cycles, which bifurcate from a two-saddle loop of a planar quadratic Hamiltonian system, under an arbitrary quadratic deformation, is less than or equal to three.

The existence of a biplane with parameters $(121,16,2)$ is an open problem. Recently, it has been proved by Alavi, Daneshkhah and Praeger that the order of an automorphism group of a of possible biplane ${\mathcal D}$ of order $14$ divides…

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

We revisit the old idea of constructing difference sets from cyclotomic classes. Two constructions of skew Hadamard difference sets are given in the additive groups of finite fields using unions of cyclotomic classes of order $N=2p_1^m$,…

Let $\Psi(t,k)$ denote the set of pairs $(v,\lambda)$ for which there exists a graphical $t$-$(v,k,\lambda)$ design. Most results on graphical designs have gone to show the finiteness of $\Psi(t,k)$ when $t$ and $k$ satisfy certain…

Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…

In 1999, Jacobson and Lehel conjectured that for $k \geq 3$, every $k$-regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthened by Verstra\"{e}te, who asked whether the regularity can…

Vl{\u a}du{\c t} characterized in 1999 the set of finite fields $k$ such that all elliptic curves defined over $k$ have a cyclic group of rational points. Under the conjecture of infinitely many Mersenne primes, this set is infinite. In…