Related papers: Existence results for cyclotomic orthomorphisms
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum…
Every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le\delta^2+\delta-1$. The result is sharp.
Given a finite field $\F_q$ and $n\in \N^*$, one could try to compute all polynomial endomorphisms $\F_q^n\lp \F_q^n$ up to a certain degree with a specific property. We consider the case $n=3$. If the degree is low (like 2,3, or 4) and the…
In a recent paper Zhang et al. constructed 17 families of permutation pentanomials of the form $x^t+x^{r_1(q-1)+t}+x^{r_2(q-1)+t}+x^{r_3(q-1)+t}+x^{r_4(q-1)+t}$ over $\mathbb{F}_{q^2}$ where $q=2^m$. In this paper for 14 of these 17…
Let S be an nXn real symmetric matrix with spectral decomposition S=Q^T Lambda Q, where Q is an orthogonal matrix and Lambda is diagonal with simple spectrum {lambda_1,..., lambda_n}. Also let O_S e R_S be the orbits by conjugation of S by,…
First we give here a simple proof of a remarkable result of Videnskii and Shirokov: let $B$ be a Blaschke product with $n$ zeros, then there exists an outer function $\phi, \phi(0)=1$, such that $\|(B\phi)'\| \leq C n$, where $C$ is an…
A permutation $\sigma\in S_n$ is said to be $k$-universal or a $k$-superpattern if for every $\pi\in S_k$, there is a subsequence of $\sigma$ that is order-isomorphic to $\pi$. A simple counting argument shows that $\sigma$ can be a…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…
The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…
Let $G=QD_{8k}~$ be the quasi-dihedral group of order $8n$ and $\theta$ be an automorphism of $QD_{8k}$ of finite order. The fixed-point set $H$ of $\theta$ is defined as $H_{\theta}=G^{\theta}=\{x\in G \mid \theta(x)=x\}$ and generalized…
Let $H$ be a planar graph. By a classical result of Robertson and Seymour, there is a function $f:\mathbb{N} \to \mathbb{R}$ such that for all $k \in \mathbb{N}$ and all graphs $G$, either $G$ contains $k$ vertex-disjoint subgraphs each…
If the face\mbox{-}cycles at all the vertices in a map are of same type then the map is called semi\mbox{-}equivelar. In particular, it is called equivelar if the face-cycles contain same type of faces. A map is semiregular (or almost…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
Normal bases in finite fields constitute a vast topic of large theoretical and practical interest. Recently, $k$-normal elements were introduced as a natural extension of normal elements. The existence and the number of $k$-normal elements…
Let $q=2^m.$ In a recent paper \cite{Zhang3}, Zhang and Zheng investigated several classes of permutation pentanomials of the form $\epsilon_0x^{d_0}+L(\epsilon_{1}x^{d_1}+\epsilon_{2}x^{d_2})$ over ${\mathbb F}_{q^3}~(d_0=1,2,4)$ from some…
In this paper we introduce the definition of equal-difference cyclotomic coset, and prove that in general any cyclotomic coset can be decomposed into a disjoint union of equal-difference subsets. Among the equal-difference decompositions of…
Let $\mathbb{F}_q[t]$ be the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements, and let $p$ be the characteristic of $\mathbb{F}_q$. We denote $\widetilde{G}_q(k)$ to be the least integer $t_0$ with the property that…
Let $K$ be a field of prime characteristic $p$, $n>4 $ an integer, $f(x)$ an irreducible polynomial over $K$ of degree $n$, whose Galois group is either the full symmetric group $S_n$ or the alternating group $A_n$. Let $l$ be an odd prime…
It is shown that two vectors with coordinates in the finite $q$-element field of characteristic $p$ belong to the same orbit under the natural action of the symmetric group if each of the elementary symmetric polynomials of degree…
A graph on $n$ vertices is called pancyclic if it contains a cycle of every length $3\le l \le n$. Given a Hamiltonian graph $G$ with independence number at most $k$ we are looking for the minimum number of vertices $f(k)$ that guarantees…