Classification of metabelian 2-groups G with Gab ≃ (2,2n),n ≥ 2, and rank d(G′)=2; Applications to real quadratic number fields

We characterize all finite metabelian 2-groups G whose abelianizations $G^{\mathrm{ab}}$ are of type $(2,2^n)$, with $n\ge 2$, and for which their commutator subgroups $G^{\prime }$ have $\text{rank}=2$. This is given in terms of the order of the abelianizations of the maximal subgroups and the structure of the abelianizations of those normal subgroups of index 4 in G. We then translate these group theoretic properties to give a characterization of number fields k with 2-class group ${\mathrm{Cl}}_2(k)?(2,2^n)$, $n\ge 2$, such that the rank of ${\mathrm{Cl}}_2(k^1)=2$ where $k^1$ is the Hilbert 2-class field of k. In particular, we apply all this to real quadratic number fields whose discriminants are a sum of two squares.     

The combinatorial properties of the Benoumhani polynomials for the Whitney numbers of Dowling lattices

In the papers (Benoumhani 1996;1997), Benoumhani defined two polynomials $F_{m,n,1}\left(x\right)$ and $F_{m,n,2}\left(x\right)$. Then, he defined $A_m(n,k)$ and $B_m(n,k)$ to be the polynomials satisfying $F_{m,n,1}\left(x\right)={\sum }_{k=0}^n{A}_m(n,k)x^{n?k}{(x+1)}^k$ and $F_{m,n,1}\left(x\right)={\sum }_{k=0}^n{B}_m(n,k)x^{n?k}{(x+1)}^k$. In this paper, we give a combinatorial interpretation of the coefficients of $A_{m+1}(n,k)$ and prove a symmetry of the coefficients, i.e., $\left[m^s\right]A_{m+1}(n,k)=\left[m^{n?s}\right]A_{m+1}(n,n?k)$. We give a combinatorial interpretation of $B_{m+1}(n,k)$ and prove that $B_{m+1}(n,n?1)$ is a polynomial in $m$ with non-negative integer coefficients. We also prove that if $n\ge 6$ then all coefficients of $B_{m+1}(n,n?2)$ except the coefficient of $m^{n?1}$ are non-negative integers. For all $n$, the coefficient of $m^{n?1}$ in $B_{m+1}(n,n?2)$ is $?(n?1)$, and when $n\le 5$ some other coefficients of $B_{m+1}(n,n?2)$ are also negative.     

On the boomerang uniformity of a class of permutation quadrinomials over finite fields

Let ${\mathbb{F}}_{2^n}$ be a finite field with $2^n$ elements and $f_{\underset{\_}{c}}(x)=c_0{x}^{2^m(2^k+1)}+c_1{x}^{2^{m+k}+1}+c_2{x}^{2^m+2^k}+c_3{x}^{2^k+1}\in {\mathbb{F}}_{2^n}[x]$, where n, m and k are positive integers with $n=2m$ and $\gcd ?(m,k)=e$. In this paper, motivated by a recent work of Li, Xiong and Zeng (Li et al. (2021) [12]), we further study the boomerang uniformity of $f_{\underset{\_}{c}}(x)$ by using similar ideas and carrying out particular techniques in solving equations over finite fields. As a consequence, we generalize Li, Xiong and Zeng's result from the case of m being odd and $e=1$ to that of both $m/e$ and $k/e$ being odd.     

The Orlicz inequality for multilinear forms

The Orlicz $({?}_2,{?}_1)$-mixed inequality states that${\left(\sum _{j_1=1}^n{\left(\sum _{j_2=1}^n|A(e_{j_1},e_{j_2})|\right)}^2\right)}^{\frac{1}{2}}\le \sqrt{2}6A6$ for all bilinear forms $A:{\mathbb{K}}^n\times {\mathbb{K}}^n\to \mathbb{K}$ and all positive integers n, where ${\mathbb{K}}^n$ denotes ${\mathbb{R}}^n$ or ${\mathbb{C}}^n$ endowed with the supremum norm. In this paper we extend this inequality to multilinear forms, with ${\mathbb{K}}^n$ endowed with ${?}_p$ norms for all $p\in [1,\infty ]$.     

New upper bound for multicolor Ramsey number of odd cycles

Let $r_k\left(C_{2m+1}\right)$ be the $k$-color Ramsey number of an odd cycle $C_{2m+1}$ of length $2m+1$. It is shown that for each fixed $m\ge 2$, $r_k\left(C_{2m+1}\right)<c^k\sqrt{k!}$for all sufficiently large $k$, where $c=c\left(m\right)>0$ is a constant. This improves an old result by Bondy and Erd?s (1973).     

Maximal sets of Hamilton cycles in Knr;λ1,λ2

Let $K\left(n^r;{\lambda }_1,{\lambda }_2\right)$ be the $r$-partite multigraph in which each part has size $n$, where two vertices in the same part or different parts are joined by exactly ${\lambda }_1$ edges or ${\lambda }_2$ edges, respectively. It is proved that there exists a maximal set of $t$ edge-disjoint Hamilton cycles in $K\left(n^r;{\lambda }_1,{\lambda }_2\right)$ for ${\lambda }_{2}n\lfloor \frac{r+3}{4}\rfloor \le t\le min\left\{\lfloor \frac{{\lambda }_2{n}^2(r-1)}{2}\rfloor ,\lfloor \frac{{\lambda }_1(n-1)+{\lambda }_{2}n(r-1)}{2}\rfloor \right\}$, the upper bound being best possible. The results proved make use of the method of amalgamations.     

A sufficient integral condition for local regularity of solutions to the surface growth model

The surface growth model, $u_t+u_{xxxx}+{?}_{xx}{u}_x^2=0$, is a one-dimensional fourth order equation, which shares a number of striking similarities with the three-dimensional incompressible Navier–Stokes equations, including the results regarding existence and uniqueness of solutions and the partial regularity theory. Here we show that a weak solution of this equation is smooth on a space-time cylinder Q if the Serrin condition $u_x\in L^{q^{\prime }}{L}^q(Q)$ is satisfied, where $q,q^{\prime }\in [1,\infty ]$ are such that either $1/q+4/q^{\prime }<1$ or $1/q+4/q^{\prime }=1$, $q^{\prime }<\infty$.     

Complete graphs and complete bipartite graphs without rainbow path

Motivated by Ramsey-type questions, we consider edge-colorings of complete graphs and complete bipartite graphs without rainbow path. Given two graphs $G$ and $H$, the $k$-colored Gallai–Ramsey number $g{r}_k(G:H)$ is defined to be the minimum integer $n$ such that $\left(\genfrac{}{}{0ex}{}{n}{2}\right)\ge k$ and for every $N\ge n$, every rainbow $G$-free coloring (using all $k$ colors) of the complete graph $K_N$ contains a monochromatic copy of $H$. In this paper, we first provide some exact values and bounds of $g{r}_k(P_5:K_t)$. Moreover, we define the $k$-colored bipartite Gallai–Ramsey number $bg{r}_k(G:H)$ as the minimum integer $n$ such that $n^2\ge k$ and for every $N\ge n$, every rainbow $G$-free coloring (using all $k$ colors) of the complete bipartite graph $K_{N,N}$ contains a monochromatic copy of $H$. Furthermore, we describe the structures of complete bipartite graph $K_{n,n}$ with no rainbow $P_4$ and $P_5$, respectively. Finally, we find the exact values of $bg{r}_k(P_4:K_{s,t})$ ($1\le s\le t$), $bg{r}_k(P_4:F)$ (where $F$ is a subgraph of $K_{s,t}$), $bg{r}_k(P_5:K_{1,t})$ and $bg{r}_k(P_5:K_{2,t})$ by using the structural results.     

Irreducible polynomials over F2r with three prescribed coefficients

For any positive integers $n\ge 3$ and $r\ge 1$, we prove that the number of monic irreducible polynomials of degree n over ${\mathbb{F}}_{2^r}$ in which the coefficients of $T^{n-1}$, $T^{n-2}$ and $T^{n-3}$ are prescribed has period 24 as a function of n, after a suitable normalization. A similar result holds over ${\mathbb{F}}_{5^r}$, with the period being 60. We also show that this is a phenomena unique to characteristics 2 and 5. The result is strongly related to the supersingularity of certain curves associated with cyclotomic function fields, and in particular it complements an equidistribution result of Katz.     

Long path and cycle decompositions of even hypercubes

We consider edge decompositions of the $n$-dimensional hypercube $Q_n$ into isomorphic copies of a given graph $H$. While a number of results are known about decomposing $Q_n$ into graphs from various classes, the simplest cases of paths and cycles of a given length are far from being understood. A conjecture of Erde asserts that if $n$ is even, $\ell <2^n$ and $\ell$ divides the number of edges of $Q_n$, then the path of length $\ell$ decomposes $Q_n$. Tapadia et al. proved that any path of length $2^{m}n$, where $2^m<n$, satisfying these conditions decomposes $Q_n$. Here, we make progress toward resolving Erde’s conjecture by showing that cycles of certain lengths up to $2^{n+1}∕n$ decompose $Q_n$. As a consequence, we show that $Q_n$ can be decomposed into copies of any path of length at most $2^n∕n$ dividing the number of edges of $Q_n$, thereby settling Erde’s conjecture up to a linear factor.