Related papers: Gauss-Dickson Codes
This paper is concerned with developing accurate and efficient numerical methods for one-dimensional fully nonlinear second order elliptic and parabolic partial differential equations (PDEs). In the paper we present a general framework for…
We study a fourth-order div problem and its approximation by the discontinuous Petrov-Galerkin method with optimal test functions. We present two variants, based on first and second-order systems. In both cases we prove well-posedness of…
Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…
Catalan's conjecture claims that the Diophantine equation $x^p-y^q=1$ admits the unique solution $3^2-2^3=1$ in integers $x,y,p,q \ge 2$. The conjecture has been finally proved by P. Mih\u{a}ilescu (2002) using the theory of cyclotomic…
Let $\gamma\in(0;\frac{1}{2}),\tau\geq 1$ and define the "$\gamma,\tau$ Diophantine set" as: $$D_{\gamma, \tau}:=\{\alpha\in (0;1): ||q\alpha||\geq\frac{\gamma}{q^{\tau}}\quad\forall q\in\Bbb{N}\},\qquad ||x||:=\inf_{p\in\Bbb{Z}}|x-p|.$$ We…
By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…
Gauss's law-based quantum error correction (GLQEC) offers a promising approach to reducing qubit overhead in lattice gauge theory simulations by leveraging built-in symmetries. For applications of GLQEC to 1+1D lattice quantum…
In this essay, we see how prime cyclotomic fields (cyclotomic fields obtained by adjoining a primitive p-th root of unity to Q, where p is an odd prime) can lead to elegant proofs of number theoretical concepts. We namely develop the notion…
Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…
In modern storage technologies, symbol-pair codes have emerged as a crucial framework for addressing errors in channels where symbols are read in overlapping pairs to guard against pair errors. A symbol-pair code that meets the…
Erd\H{o}s considered the second moment of the gap-counting function of prime divisors in 1946 and proved an upper bound that is not of the right order of magnitude. We prove asymptotics for all moments. Furthermore, we prove a…
We prove that the only primes which may divide the order of the automorphism group of a putative binary self-dual doubly-even [120, 60, 24] code are 2, 3, 5, 7, 19, 23 and 29. Furthermore we prove that automorphisms of prime order $p \geq…
This paper extends the foundational work of Dollma \emph{et al}. on codes for ordered composite DNA sequences. We consider the general setting with an alphabet of size $q$ and a resolution parameter $k$, moving beyond the binary ($q=2$)…
In this notes we make a comparison between the arithmetic properties of irrational numbers and their dynamical properties under the Gauss map. We show some equivalences between different classifications of irrational numbers such as the…
In this note we consider the title Diophantine equation from both theoretical as well as experimental point of view. In particular, we prove that for $k=4, 6$ and each choice of the signs our equation has infinitely many co-prime positive…
In this paper we show that, for any fixed $1<c<967/805$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\varepsilon \end{equation*}…
Fifth order exact corrections to the non-singlet electron structure function in QED are the leading logarithmic approximation using the ad hoc exponentiation prescription proposed by Jadach and Ward and a recurence formula for the elements…
In this work, we accomplish three goals. First, we determine the entire family of positive integer solutions to the three- variable Diophantine equation, xy=z^2; for n=2,3,4,5,6. For n=2, we obtain a 3-parameter family of solutions; for…
Brizolis asked for which primes p greater than 3 does there exist a pair (g, h) such that h is a fixed point of the discrete exponential map with base g, or equivalently h is a fixed point of the discrete logarithm with base g. Zhang (1995)…
In this paper, we give a partial solution to a new isomorphism problem about $2$-$(v,k,k-1)$ designs from disjoint difference families in finite fields and Galois rings. Our results are obtained by carefully calculating and bounding some…