On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of $$\mathbb {F}_{\varvec{q}} $$

In this paper we study the difference between the 2-adic valuations of the cardinalities \( \# E( \mathbb {F}_{q^k} ) \) and \( \# E( \mathbb {F}_q ) \) of an elliptic curve E over \( \mathbb {F}_q \). We also deduce information about the structure of the 2-Sylow subgroup \( E[ 2^\infty ]( \mathbb {F}_{q^k} ) \) from the exponents of \( E[ 2^\infty ]( \mathbb {F}_q ) \).     

Complete mappings and Carlitz rank

The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that for any \(d\ge 2\) and any prime \(p>(d^2-3d+4)^2\) there is no complete mapping polynomial in \(\mathbb {F}_p[x]\) of degree d. For arbitrary finite fields \(\mathbb {F}_q\), we give a similar result in terms of the Carlitz rank of a permutation polynomial rather than its degree. We prove that if \(n<\lfloor q/2\rfloor \), then there is no complete mapping in \(\mathbb {F}_q[x]\) of Carlitz rank n of small linearity. We also determine how far permutation polynomials f of Carlitz rank \(n<\lfloor q/2\rfloor \) are from being complete, by studying value sets of \(f+x.\) We provide examples of complete mappings if \(n=\lfloor q/2\rfloor \), which shows that the above bound cannot be improved in general.     

On the Diophantine equation $$X^{2N}+2^{2\alpha }5^{2\beta }{p}^{2\gamma } = Z^5$$

We prove that for each prime p, positive integer \(\alpha \), and non-negative integers \(\beta \) and \(\gamma \), the Diophantine equation \(X^{2N} + 2^{2\alpha }5^{2\beta }{p}^{2\gamma } = Z^5\) has no solution with N, X, \(Z\in \mathbb {Z}^+\), \(N > 1\), and \(\gcd (X,Z) = 1\).     

On the Dual Form of ‘Low <Emphasis Type="Italic">M</Emphasis><Superscript>*</Superscript> Estimate’ in the Quasi-convex Case

Let\(B_{2}^{n}\) denote the Euclidean ball in\({\mathbb R}^n\), and, given closed star-shaped body\(K \subset {\mathbb R}^{n}, M_{K}\) denote the average of the gauge of K on the Euclidean sphere. Let\(p \in (0,1)\) and let\(K \subset {\mathbb R}^{n}\) be a p-convex body. In [17] we proved that for every\(\lambda \in (0,1)\) there exists an orthogonal projection P of rank\((1 - \lambda)n\) such that

$\frac{f(\lambda)}{M_K} PB^{n}_{2} \subset PK,$

where\(f(\lambda)=c_p\lambda^{1+1/p}\) for some positive constant c _p depending on p only. In this note we prove that\(f(\lambda)\) can be taken equal to\(C_p\lambda^{1/p-1/2}\). In terms of Kolmogorov numbers it means that for every\(k \leq n\)

$d_k (\hbox{Id}:\ell^{n}_{2} \to ({\mathbb R}^{n},\|\cdot\|_{K})) \leq C_p \frac{n^{1/p-1}}{k^{1/p-1/2}} \ell(\hbox{ID}: \ell^{n}_{2} \to ({\mathbb R}^{n}, \|\cdot\|_{K})),$

where\(\ell(\hbox{Id})={\bf E}\|\sum\limits^{n}_{i=1}g_i e_i\|_K\) for the independent standard Gaussian random variables\(\{g_i\}\) and the canonical basis\(\{e_i\}\) of\({\mathbb R}^n\). All results do not require the symmetry of K.

     

Computing Explicit Isomorphisms with Full Matrix Algebras over $$\mathbb {F}_q(x)$$

We propose a polynomial time f-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over \(\mathbb {F}_q\)) for computing an isomorphism (if there is any) of a finite-dimensional \(\mathbb {F}_q(x)\)-algebra \(\mathcal{A}\) given by structure constants with the algebra of n by n matrices with entries from \(\mathbb {F}_q(x)\). The method is based on computing a finite \(\mathbb {F}_q\)-subalgebra of \(\mathcal{A}\) which is the intersection of a maximal \(\mathbb {F}_q[x]\)-order and a maximal R-order, where R is the subring of \(\mathbb {F}_q(x)\) consisting of fractions of polynomials with denominator having degree not less than that of the numerator.     

Some results on linear codes over the ring $$\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4$$

In this paper, we mainly study the theory of linear codes over the ring \(R =\mathbb {Z}_4+u\mathbb {Z}_4+v\mathbb {Z}_4+uv\mathbb {Z}_4\). By using the Chinese Remainder Theorem, we prove that R is isomorphic to a direct sum of four rings. We define a Gray map \(\Phi \) from \(R^{n}\) to \(\mathbb {Z}_4^{4n}\), which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over \(\mathbb {Z}_4\). We also discuss some properties of MDS codes over R. Furthermore, we study the MacWilliams identities of linear codes over R and give the generator polynomials of cyclic codes over R.     

The Gray image of constacyclic codes over the finite chain ring $$F_{p^m}[u]/\langle u^k\rangle $$

Let \(\mathbb {F}_{p^m}\) be a finite field of cardinality \(p^m\), where p is a prime, and k, N be any positive integers. We denote \(R_k=F_{p^m}[u]/\langle u^k\rangle =F_{p^m}+uF_{p^m}+\cdots +u^{k-1}F_{p^m}\) (\(u^k=0\)) and \(\lambda =a_0+a_1u+\cdots +a_{k-1}u^{k-1}\) where \(a_0, a_1,\ldots , a_{k-1}\in F_{p^m}\) satisfying \(a_0\ne 0\) and \(a_1=1\). Let r be a positive integer satisfying \(p^{r-1}+1\le k\le p^r\). First we define a Gray map from \(R_k\) to \(F_{p^m}^{p^r}\), then prove that the Gray image of any linear \(\lambda \)-constacyclic code over \(R_k\) of length N is a distance preserving linear \(a_0^{p^r}\)-constacyclic code over \(F_{p^m}\) of length \(p^rN\). Furthermore, the generator polynomials for each linear \(\lambda \)-constacyclic code over \(R_k\) of length N and its Gray image are given respectively. Finally, some optimal constacyclic codes over \(F_{3}\) and \(F_{5}\) are constructed.     

The primitive idempotents and weight distributions of irreducible constacyclic codes

Let \({\mathbb {F}}_q\) be a finite field with q elements such that \(l^v||(q^t-1)\) and \(\gcd (l,q(q-1))=1\), where l, t are primes and v is a positive integer. In this paper, we give all primitive idempotents in a ring \(\mathbb F_q[x]/\langle x^{l^m}-a\rangle \) for \(a\in {\mathbb {F}}_q^*\). Specially for \(t=2\), we give the weight distributions of all irreducible constacyclic codes and their dual codes of length \(l^m\) over \({\mathbb {F}}_q\).     

Construction of sign-changing solutions for a harmonic equation with subcritical exponent

In this paper, we study the harmonic equation involving subcritical exponent \((P_{\varepsilon })\): \( \Delta u = 0 \), in \(\mathbb {B}^n\) and \(\displaystyle \frac{\partial u}{\partial \nu } + \displaystyle \frac{n-2}{2}u = \displaystyle \frac{n-2}{2} K u^{\frac{n}{n-2}-\varepsilon }\) on \( \mathbb {S}^{n-1}\) where \(\mathbb {B}^n \) is the unit ball in \(\mathbb {R}^n\), \(n\ge 5\) with Euclidean metric \(g_0\), \(\partial \mathbb {B}^n = \mathbb {S}^{n-1}\) is its boundary, K is a function on \(\mathbb {S}^{n-1}\) and \(\varepsilon \) is a small positive parameter. We construct solutions of the subcritical equation \((P_{\varepsilon })\) which blow up at two different critical points of K. Furthermore, we construct solutions of \((P_{\varepsilon })\) which have two bubbles and blow up at the same critical point of K.     

Strong extensions for q-summing o perators acting in p-convex Banach function s paces for $$1 \le p \le q$$1≤ p≤ q

Let \(1\le p\le q<\infty \) and let X be a p-convex Banach function space over a \(\sigma \)-finite measure \(\mu \). We combine the structure of the spaces \(L^p(\mu )\) and \(L^q(\xi )\) for constructing the new space \(S_{X_p}^{\,q}(\xi )\), where \(\xi \) is a probability Radon measure on a certain compact set associated to X. We show some of its properties, and the relevant fact that every q-summing operator T defined on X can be continuously (strongly) extended to \(S_{X_p}^{\,q}(\xi )\). Our arguments lead to a mixture of the Pietsch and Maurey-Rosenthal factorization theorems, which provided the known (strong) factorizations for q-summing operators through \(L^q\)-spaces when \(1 \le q \le p\). Thus, our result completes the picture, showing what happens in the complementary case \(1\le p\le q\).     

$$L^{p}$$-Norms a nd Mahler’s Measure of Poly nomials o n the n-Dime nsio nal Torus

We prove Nikol’skii type inequalities that, for polynomials on the n-dimensional torus \(\mathbb {T}^n\), relate the \(L^p\)-norm with the \(L^q\)-norm (with respect to the normalized Lebesgue measure and \(0 <p <q < \infty \)). Among other things, we show that \(C=\sqrt{q/p}\) is the best constant such that \(\Vert P\Vert _{L^q}\le C^{\text {deg}(P)} \Vert P\Vert _{L^p}\) for all homogeneous polynomials P on \(\mathbb {T}^n\). We also prove an exact inequality between the \(L^p\)-norm of a polynomial P on \(\mathbb {T}^n\) and its Mahler measure M(P), which is the geometric mean of |P| with respect to the normalized Lebesgue measure on \(\mathbb {T}^n\). Using extrapolation, we transfer this estimate into a Khintchine–Kahane type inequality, which, for polynomials on \(\mathbb {T}^n\), relates a certain exponential Orlicz norm and Mahler’s measure. Applications are given, including some interpolation estimates.     

The Fischer–Marsden conjecture and contact geometry

In this paper, we consider the Fischer–Marsden conjecture within the frame-work of K-contact manifolds and \((\kappa ,\mu )\)-contact manifolds. First, we prove that a complete K-contact metric satisfying \(\mathcal {L}^{*}_g(\lambda )=0\) is Einstein and is isometric to a unit sphere \(S^{2n+1}\). Next, we prove that if a non-Sasakian \((\kappa ,\mu )\)-contact metric satisfies \(\mathcal {L}^{*}_g(\lambda )=0\), then \( M^{3} \) is flat, and for \(n > 1\), \(M^{2n+1}\) is locally isometric to the product of a Euclidean space \(E^{n+1}\) and a sphere \(S^n(4)\) of constant curvature \(+\,4\).     

Couplings of Brownian Motions of Deterministic Distance in Model Spaces of Constant Curvature

We consider the model space \(\mathbb {M}^{n}_{K}\) of constant curvature K and dimension \(n\ge 1\) (Euclidean space for \(K=0\), sphere for \(K>0\) and hyperbolic space for \(K<0\)), and we show that given a function \(\rho :[0,\infty )\rightarrow [0, \infty )\) with \(\rho (0)=\mathrm {dist}(x,y)\) there exists a coadapted coupling (X(t), Y(t)) of Brownian motions on \(\mathbb {M}^{n}_{K}\) starting at (x, y) such that \(\rho (t)=\mathrm {dist}(X(t),Y(t))\) for every \(t\ge 0\) if and only if \(\rho \) is continuous and satisfies for almost every \(t\ge 0\) the differential inequality

$$\begin{aligned} -(n-1)\sqrt{K}\tan \left( \tfrac{\sqrt{K}\rho (t)}{2}\right) \le \rho '(t)\le -(n-1)\sqrt{K}\tan \left( \tfrac{\sqrt{K}\rho (t)}{2}\right) +\tfrac{2(n-1)\sqrt{K}}{\sin (\sqrt{K}\rho (t))}. \end{aligned}$$

In other words, we characterize all coadapted couplings of Brownian motions on the model space \(\mathbb {M}^{n}_{K}\) for which the distance between the processes is deterministic. In addition, the construction of the coupling is explicit for every choice of \(\rho \) satisfying the above hypotheses.

     

On height isotopy classes of embeddings in the plane of a Morse function of a circle

Let \(\mathrm{SM}_{2n}(S^1,\mathbb {R})\) be a set of stable Morse functions of an oriented circle such that the number of singular points is \(2n\in \mathbb {N}\) and the order of singular values satisfies the particular condition. For an orthogonal projection \(\pi :\mathbb {R}^2\rightarrow \mathbb {R}\), let \({\tilde{f}}_0\) and \({\tilde{f}}_1:S^1\rightarrow \mathbb {R}^2\) be embedding lifts of f. If there is an ambient isotopy \(\tilde{\varphi }_t:\mathbb {R}^2\rightarrow \mathbb {R}^2\) \((t\in [0,1])\) such that \({\pi \circ \tilde{\varphi }}_t(y_1,y_2)=y_1\) and \(\tilde{\varphi }_1\circ {\tilde{f}}_0={\tilde{f}}_1\), we say that \({\tilde{f}}_0\) and \({\tilde{f}}_1\) are height isotopic. We define a function \(I:\mathrm{SM}_{2n}(S^1,\mathbb {R})\rightarrow \mathbb {N}\) as follows: I(f) is the number of height isotopy classes of embeddings such that each rotation number is one. In this paper, we determine the maximal value of the function I equals the n-th Baxter number and the minimal value equals \(2^{n-1}\).     

New lower bounds for the Shannon capacity of odd cycles

The Shannon capacity of a graph G is defined as \(c(G)=\sup _{d\ge 1}(\alpha (G^d))^{\frac{1}{d}},\) where \(\alpha (G)\) is the independence number of G. The Shannon capacity of the cycle \(C_5\) on 5 vertices was determined by Lovász in 1979, but the Shannon capacity of a cycle \(C_p\) for general odd p remains one of the most notorious open problems in information theory. By prescribing stabilizers for the independent sets in \(C_p^d\) and using stochastic search methods, we show that \(\alpha (C_7^5)\ge 350\), \(\alpha (C_{11}^4)\ge 748\), \(\alpha (C_{13}^4)\ge 1534\), and \(\alpha (C_{15}^3)\ge 381\). This leads to improved lower bounds on the Shannon capacity of \(C_7\) and \(C_{15}\): \(c(C_7)\ge 350^{\frac{1}{5}}> 3.2271\) and \(c(C_{15})\ge 381^{\frac{1}{3}}> 7.2495\).     

Distance Magic Labeling in Complete 4-partite Graphs

Let G be a complete k-partite simple undirected graph with parts of sizes \(p_1\le p_2\cdots \le p_k\). Let \(P_j=\sum _{i=1}^jp_i\) for \(j=1,\ldots ,k\). It is conjectured that G has distance magic labeling if and only if \(\sum _{i=1}^{P_j} (n-i+1)\ge j{{n+1}\atopwithdelims (){2}}/k\) for all \(j=1,\ldots ,k\). The conjecture is proved for \(k=4\), extending earlier results for \(k=2,3\).     

Resilience of ranks of higher inclusion matrices

Let \(n \ge r \ge s \ge 0\) be integers and \(\mathcal {F}\) a family of r-subsets of [n]. Let \(W_{r,s}^{\mathcal {F}}\) be the higher inclusion matrix of the subsets in \({{\mathcal {F}}}\) vs. the s-subsets of [n]. When \(\mathcal {F}\) consists of all r-subsets of [n], we shall simply write \(W_{r,s}\) in place of \(W_{r,s}^{\mathcal {F}}\). In this paper we prove that the rank of the higher inclusion matrix \(W_{r,s}\) over an arbitrary field K is resilient. That is, if the size of \(\mathcal {F}\) is “close” to \({n \atopwithdelims ()r}\) then \({{\mathrm{rank}}}_{K}( W_{r,s}^{\mathcal {F}}) = {{\mathrm{rank}}}_{K}(W_{r,s})\), where K is an arbitrary field. Furthermore, we prove that the rank (over a field K) of the higher inclusion matrix of r-subspaces vs. s-subspaces of an n-dimensional vector space over \({\mathbb {F}}_q\) is also resilient if \(\mathrm{char}(K)\) is coprime to q.     

On some constacyclic codes over $$\mathbb {Z}_{4}\left[ u\right] /\left\langle u^{2}-1\right\rangle $$, their $$\mathbb {Z}_4$$Z4 images,and new codes

In this paper, we study \(\lambda \)-constacyclic codes over the ring \(R=\mathbb {Z}_4+u\mathbb {Z}_4\) where \(u^{2}=1\), for \(\lambda =3+2u\) and \(2+3u\). Two new Gray maps from R to \(\mathbb {Z}_4^{3}\) are defined with the goal of obtaining new linear codes over \(\mathbb {Z}_4\). The Gray images of \(\lambda \)-constacyclic codes over R are determined. We then conducted a computer search and obtained many \(\lambda \)-constacyclic codes over R whose \(\mathbb {Z}_4\)-images have better parameters than currently best-known linear codes over \(\mathbb {Z}_4\).     

Cohomogeneity one actions on Minkowski spaces

We study isometric cohomogeneity one actions on the \((n+1)\)-dimensional Minkowski space \(\mathbb {L}^{n+1}\) up to orbit-equivalence. We give examples of isometric cohomogeneity one actions on \(\mathbb {L}^{n+1}\) whose orbit spaces are non-Hausdorff. We show that there exist isometric cohomogeneity one actions on \(\mathbb {L}^{n+1}\), \(n \ge 3\), which are orbit-equivalent on the complement of an n-dimensional degenerate subspace \(\mathbb {W}^n\) of \(\mathbb {L}^{n+1}\) and not orbit-equivalent on \(\mathbb {W}^n\). We classify isometric cohomogeneity one actions on \(\mathbb {L}^2\) and \(\mathbb {L}^3\) up to orbit-equivalence.     

Complexities of normal bases constructed from Gauss periods

Let q be a power of a prime p, and let \(r=nk+1\) be a prime such that \(r\not \mid q\), where n and k are positive integers. Under a simple condition on q, r and k, a Gauss period of type (n, k) is a normal element of \({\mathbb {F}}_{q}^{n}\) over \({\mathbb {F}}_q\); the complexity of the resulting normal basis of \({\mathbb {F}}_{q}^{n}\) over \({\mathbb {F}}_q\) is denoted by C(n, k; p). Recent works determined C(n, k; p) for \(k\le 7\) and all qualified n and q. In this paper, we show that for any given \(k>0\), C(n, k; p) is given by an explicit formula except for finitely many primes \(r=nk+1\) and the exceptional primes are easily determined. Moreover, we describe an algorithm that allows one to compute C(n, k; p) for the exceptional primes \(r=nk+1\). Our numerical results cover C(n, k; p) for \(k\le 20\) and all qualified n and q.