相关论文: New Nikodym set constructions over finite fields
We prove that a Kakeya set in a vector space over a finite field of size $q$ always supports a probability measure whose Fourier transform is bounded by $q^{-1}$ for all non-zero frequencies. We show that this bound is sharp in all…
We give a construction and equations for good recursive towers over any finite field $\mathbf{F}_q$ with $q \ne 2$ and $3$.
We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary. In some cases, the…
It is known that if the dimension is a perfect square the Clifford group can be represented by monomial matrices. Another way of expressing this result is to say that when the dimension is a perfect square the standard representation of the…
Geometrically infinite Kleinain groups have nonconical limit sets with the cardinality of the continuum. In this paper, we construct a geometrically infinite Fuchsian group such that the Hausdorff dimension of the nonconical limit set…
Let n and d be positive integers, let k be a field and let P(n,d;k) be the space of the polynomials in n variables of degree at most d with coefficients in k. Let B(n,d) be the set of the Bernstein-Sato polynomials of all polynomials in…
We consider when the projective special linear group over a finite field defines a $3$-design with a cyclic starter block. We will show that the equivalences of the existence of such $3$-$(q+1,5,3)$ and $3$-$(q+1,10,18)$ designs for a prime…
A Latin square of order $n$ is an $n \times n$ matrix of $n$ symbols, such that each symbol occurs exactly once in each row and column. For an odd prime power $q$ let $\mathbb{F}_q$ denote the finite field of order $q$. A quadratic Latin…
Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…
When the quantum parameter $q^{1/2}$ is a root of unity of odd order. The stated skein module $S_{q^{1/2}}(M,\mathcal{N})$ has an $S_{1}(M,\mathcal{N})$-module structure, where $(M,\mathcal{N})$ is a marked three manifold. We prove…
The simplified linguistic relation between syntax and semantics as intrinsic property of classic Arabic motivates a dedicated look at P vs. NP in light of efforts and solutions presented by ancient Arab- and Muslim scholars to facilitate…
In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have…
Modulo a homogeneous degree of freedom and a global constraint, the linearly polarised Gowdy $T^3$ cosmologies are equivalent to a free scalar field propagating in a fixed nonstationary background. Recently, a new field parameterisation was…
Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $\lambda|q^{sm}-1$ and $\lambda…
We suggest a construction of the minimal polynomial $m_{\beta^k}$ of $\beta^k\in \mathbb F_{q^n}$ over $\mathbb F_q$ from the minimal polynomial $f= m_\beta$ for all positive integers $k$ whose prime factors divide $q-1$. The computations…
Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $d_1, \ldots, d_k$ be positive integers. In this note we explore the number of solutions $(z_1, \ldots, z_k)\in\overline{\mathbb F}_q^k$ of the…
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 +…
For each odd prime power q, and each integer k, we determine the sum of the k-th powers of all elements x in F_q for which both x and x+1 are squares in F_q^*. We also solve the analogous problem when one or both of x and x+1 is a…