Related papers: Integral bases and monogenity of the simplest sext…

In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…

In this note, we prove that every non-complete $(k+1)$-critical graph contains cycles of all lengths modulo $k$, where $k=4,5$.

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $\alpha $ be a generator of…

Some time ago we extended our monogenity investigations and calculations of generators of power integral bases to the relative case. Up to now we considered (usually totally real) extensions of complex quartic fields. In the present paper…

The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a…

Suppose $\ell$ is a prime number, $\ell >3$, $K$ is a field that is an unramified finite extension of the field $\Q_\ell$ of $\ell$-adic numbers, and $G$ is a finite group that is a semi-direct product of a normal $\ell'$-subgroup $H$ and a…

We unconditionally determine $I_\Q(d)$, the set of possible prime degrees of cyclic $K$-isogneies of elliptic curves with $\Q$-rational $j$-invariants and without complex multiplication over number fields $K$ of degree $\leq d$, for $d\leq…

Let $M$ be a closed, orientable hyperbolic 3-manifold and $\phi$ a homomorphism of its fundamental group onto $\mathbb{Z}$ that is not induced by a fibration over the circle. For each natural number $n$ we give an explicit lower bound,…

Let $K$ be a function field over an algebraically closed field $k$ of characteristic $0$, let $\varphi\in K(z)$ be a rational function of degree at least equal to $2$ for which there is no point at which $\varphi$ is totally ramified, and…

In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…

We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…

Let $m>1$ and $\mathfrak{d} \neq 0$ be integers such that $v_{p}(\mathfrak{d}) \neq m$ for any prime $p$. We construct a matrix $A(\mathfrak{d})$ of size $(m-1) \times (m-1)$ depending on only of $\mathfrak{d}$ with the following property:…

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least…

In this note, we construct explicit examples of $F_Q$-minimal quadratic forms of dimension $5$ and $7$, where $F_Q$ is the function field of a conic over a field $F$ of characteristic $2$. The construction uses the fact that any set of $n$…

The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least…

Let $g>1$ be an integer and $f(X)\in{\mathbb Z}[X]$ a polynomial of positive degree with no multiple roots, and put $u(n)=f(g^n)$. In this note, we study the sequence of quadratic fields ${\mathbb Q}(\sqrt{u(n)}\,)$ as $n$ varies over the…

A periodic cell complex, $K$, has a finite representation as the quotient space, $q(K)$, consisting of equivalence classes of cells identified under the translation group acting on $K$. We study how the Betti numbers and cycles of $K$ are…

For $q>27$ we determine the independence number $\alpha(\Gamma)$ of the Kneser graph $\Gamma$ on plane-solid flags in $PG(6,q)$. More precisely we describe all maximal independent sets of size at least $q^{11}$ and show that every other…

One way to certify that a graph does not contain an induced cycle of length six is to provide a partition of its vertex set into (i) a stable set, and (ii) a graph containing no stable set of size three and no induced matching of size two.…

Let $I$ be a square-free monomial ideal in a polynomial ring $R=K[x_1,\ldots, x_n]$ over a field $K$, $\mathfrak{m}=(x_1, \ldots, x_n)$ be the graded maximal ideal of $R$, and $\{u_1, \ldots, u_{\beta_1(I)}\}$ be a maximal independent set…