The Generalized k-Resultant Modulus Set Problem in Finite Fields

Journal of Fourier Analysis and Applications - Let $${\mathbb {F}}_q^d$$ be the d-dimensional vector space over the finite field $${\mathbb {F}}_q$$ with q elements. Given k sets $$E_j\subset...     

Some permutations over $$\pmb {\mathbb {F}}_p$$ F p concerning primitive roots

The Ramanujan Journal - Let p be an odd prime and let $${\mathbb {F}}_p$$ denote the finite field with p elements. Suppose that g is a primitive root of $${\mathbb {F}}_p$$ . Define the permutation...     

Congruences with intervals and arbitrary sets

Given a prime p, an integer $$H\in [1,p)$$, and an arbitrary set $${\mathcal {M}} \subseteq {\mathbb {F}} _p^*$$, where $${\mathbb {F}} _p$$ is the finite field with p elements, let $$J(H,{\mathcal {M}} )$$ denote the number of solutions to the congruence $$\begin{aligned} xm\equiv yn~\mathrm{mod}~ p \end{aligned}$$for which $$x,y\in [1,H]$$ and $$m,n\in {\mathcal {M}} $$. In this paper, we bound $$J(H,{\mathcal {M}} )$$ in terms of p, H, and the cardinality of $${\mathcal {M}} $$. In a wide range of parameters, this bound is optimal. We give two applications of this bound: to new estimates of trilinear character sums and to bilinear sums with Kloosterman sums, complementing some recent results of Kowalski et al. (Stratification and averaging for exponential sums: bilinear forms with generalized Kloosterman sums, 2018, arXiv:1802.09849).     

Codes defined by forms of degree 2 on non-degenerate Hermitian varieties in $${\mathbb{P}^{4}(\mathbb{F}_q)}$$

We study the functional codes of second order on a non-degenerate Hermitian variety as defined by G. Lachaud. We provide the best possible bounds for the number of points of quadratic sections of . We list the first five weights, describe the corresponding codewords and compute their number. The paper ends with two conjectures. The first is about minimum distance of the functional codes of order h on a non-singular Hermitian variety . The second is about distribution of the codewords of first five weights of the functional codes of second order on a non-singular Hermitian variety .      

Frobenius distributions of elliptic curves in short intervals on average

The Ramanujan Journal - For an elliptic curve $$E/{\mathbb {Q}}$$ , let $$a_p$$ denote the trace of its Frobenius endomorphism over $${\mathbb {F}}_p$$ , where p is a prime of good reduction for E....     

The $${\mathbb {Q}}$$ Q -Korselt set of $$\mathrm {pq}$$ pq

Periodica Mathematica Hungarica - Let N be a positive integer, $${\mathbb {A}}$$ be a nonempty subset of $${\mathbb {Q}}$$ and $$\alpha =\dfrac{\alpha _{1}}{\alpha _{2}}\in {\mathbb {A}}{\setminus...     

On K3 of Witt Vectors of Length Two Over Finite Fields

We prove that for W₂ the Witt vectors of length two over the finite field , we have in characteristic at least 5 and for (3,f) = 1. The result is proved by using the identity and calculating the right term with a group homology spectral sequence. Some information on the spectral sequence is achieved by using the action of the outer automorphism of SL on the homology groups and recent results on K-groups of local rings and the ring of dual numbers over finite fields.     

The Beckman-Quarles theorem for mappings from ℝ2 to $${\mathbb{F}}^2 $$ , where F is a subfield of a commutative field extending ℝ, where F is a subfield of a commutative field extending ℝ

Let F be a subfield of a commutative field extending ℝ. Let We say thatf : preserves distanced ≥ 0 if for eachx,y ∈ ℝ ∣x- y∣= d implies ϕ₂(f(x),f(y)) = d² . We prove that each unit-distance preserving mappingf : has a formI o (ρ,ρ), where is a field homomorphism and is an affine mapping with orthogonal linear part.     

Sufficient conditions for local equivalence of mappings

Let $$f,g:({\mathbb {R}}^n,0)\rightarrow ({\mathbb {R}}^m,0)$$ be $$C^{r+1}$$ mappings and let $$Z=\{x\in \mathbf {\mathbb {R}}^n:\nu (df (x))=0\}$$ , $$0\in Z$$ , $$m\le n$$ . We will show that if there exist a neighbourhood U of $$0\in {\mathbb {R}}^n$$ and constants $$C,C'>0$$ and $$k>1$$ such that for $$x\in U$$ $$\begin{aligned}&\nu (df(x))\ge C{\text {dist}}(x,Z)^{k-1}, \\&\left| \partial ^{s} (f_i-g_i)(x) \right| \le C'\nu (df(x))^{r+k-|s|}, \end{aligned}$$ for any $$i\in \{1,\dots , m\}$$ and for any $$s \in \mathbf {\mathbb {N}}^n_0$$ such that $$|s|\le r$$ , then there exists a $$C^r$$ diffeomorphism $$\varphi :({\mathbb {R}}^n,0)\rightarrow ({\mathbb {R}}^n,0)$$ such that $$f=g\circ \varphi $$ in a neighbourhood of $$0\in {\mathbb {R}}^n$$ . By $$\nu (df)$$ we denote the Rabier function.     

The geometric field of linearity of linear sets

Designs, Codes and Cryptography - If an $${\mathbb {F}}_q$$ -linear set $$L_U$$ in a projective space is defined by a vector subspace U which is linear over a proper superfield of $${\mathbb...     

Tangencies and polynomial optimization

Mathematical Programming - Given a polynomial function $$f :{\mathbb {R}}^n \rightarrow {\mathbb {R}}$$ and an unbounded closed semi-algebraic set $$S \subset {\mathbb {R}}^n,$$ we show that the...     

A new family of maximal curves over a finite field

It has been known for a long time that the Deligne–Lusztig curves associated to the algebraic groups of type and defined over the finite field all have the maximum number of -rational points allowed by the Weil “explicit formulas”, and that these curves are -maximal curves over infinitely many algebraic extensions of . Serre showed that an -rational curve which is -covered by an -maximal curve is also -maximal. This has posed the problem of the existence of -maximal curves other than the Deligne–Lusztig curves and their -subcovers, see for instance Garcia (On curves with many rational points over finite fields. In: Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, pp. 152–163. Springer, Berlin, 2002) and Garcia and Stichtenoth (A maximal curve which is not a Galois subcover of the Hermitan curve. Bull. Braz. Math. Soc. (N.S.) 37, 139–152, 2006). In this paper, a positive answer to this problem is obtained. For every q = n ³ with n = p ^r  > 2, p ≥ 2 prime, we give a simple, explicit construction of an -maximal curve that is not -covered by any -maximal Deligne–Lusztig curve. Furthermore, the -automorphism group Aut has size n ³(n ³ + 1)(n ² − 1)(n ² − n + 1). Interestingly, has a very large -automorphism group with respect to its genus . Research supported by the Italian Ministry MURST, Strutture geometriche, combinatoria e loro applicazioni, PRIN 2006–2007.     

On self-dual codes over {\mathbb{F}}_5

The purpose of this paper is to improve the upper bounds of the minimum distances of self-dual codes over for lengths [22, 26, 28, 32–40]. In particular, we prove that there is no [22, 11, 9] self-dual code over , whose existence was left open in 1982. We also show that both the Hamming weight enumerator and the Lee weight enumerator of a putative [24, 12, 10] self-dual code over are unique. Using the building-up construction, we show that there are exactly nine inequivalent optimal self-dual [18, 9, 7] codes over up to the monomial equivalence, and construct one new optimal self-dual [20, 10, 8] code over and at least 40 new inequivalent optimal self-dual [22, 11, 8] codes.      

Elements of Prescribed Order,Prescribed Traces and Systems of Rational Functions Over Finite Fields

Let k 1 and be a system of rational functions forming a strongly linearly independent set over a finite field . Let be arbitrarily prescribed elements. We prove that for all sufficiently large extensions , there is an element of prescribed order such that is the relative trace map from onto We give some applications to BCH codes, finite field arithmetic and ordered orthogonal arrays. We also solve a question of Helleseth et~al. (Hypercubic 4 and 5-designs from Double-Error-Correcting codes, Des. Codes. Cryptgr. 28(2003). pp. 265–282) completely.classification 11T30, 11G20, 05B15     

A finite field approach to the Carlitz–Riordan q-Catalan numbers

Journal of Algebraic Combinatorics - Let q be a prime power and $${\mathbb {F}}_q$$ be the finite field with q elements. Suppose that $$n\ge 1$$ and $${{\mathscr {F}}}=\{E_1,\ldots ,E_{2n-1}\}$$ is...     

On the linearity and classification of $${\mathbb {Z}}_{p^s}$$ Z p s -linear generalized hadamard codes

Designs, Codes and Cryptography - $${\mathbb {Z}}_{p^s}$$ -additive codes of length n are subgroups of $${\mathbb {Z}}_{p^s}^n$$ , and can be seen as a generalization of linear codes over...     

Indefinite Stein fillings and $$\text {PIN}(2)$$PIN(2)-monopole Floer homology

Let $$W(z_1, \ldots , z_n): ({\mathbb {C}}^*)^n \rightarrow {\mathbb {C}}$$ be a Laurent polynomial in n variables, and let $${\mathcal {H}}$$ be a generic smooth fiber of W. Ruddat et al. (Geom Topol 18:1343–1395, 2014) give a combinatorial recipe for a skeleton for $${\mathcal {H}}$$. In this paper, we show that for a suitable exact symplectic structure on $${\mathcal {H}}$$, the RSTZ-skeleton can be realized as the Liouville Lagrangian skeleton.     

Uniform central limit theorems for kernel density estimators

Let be the classical kernel density estimator based on a kernel K and n independent random vectors X _i each distributed according to an absolutely continuous law on . It is shown that the processes , , converge in law in the Banach space , for many interesting classes of functions or sets, some -Donsker, some just -pregaussian. The conditions allow for the classical bandwidths h _n that simultaneously ensure optimal rates of convergence of the kernel density estimator in mean integrated squared error, thus showing that, subject to some natural conditions, kernel density estimators are ‘plug-in’ estimators in the sense of Bickel and Ritov (Ann Statist 31:1033–1053, 2003). Some new results on the uniform central limit theorem for smoothed empirical processes, needed in the proofs, are also included.      

Note on a result of Chen and Lev

Periodica Mathematica Hungarica - Let $${\mathbb {N}}$$ be the set of all nonnegative integers. For a given set $$S\subset {\mathbb {N}}$$ the representation function $$R_S(n)$$ is defined as the...