Results 51 to 60 of about 2,481 (228)
AlgorithmsMathematical tools have been developed that are analogous to the tool that allows one to reduce the description of linear systems in terms of convolution operations to a description in terms of amplitude-frequency characteristics.
Aruzhan Kadyrzhan +3 more
doaj +1 more source
Topological K‐theory of quasi‐BPS categories for Higgs bundles
Journal of Topology, Volume 18, Issue 4, December 2025.Abstract In a previous paper, we introduced quasi‐BPS categories for moduli stacks of semistable Higgs bundles. Under a certain condition on the rank, Euler characteristic, and weight, the quasi‐BPS categories (called BPS in this case) are noncommutative analogues of Hitchin integrable systems.
Tudor Pădurariu, Yukinobu Toda
wiley +1 more source
On the Galois structure of units in totally real $p$-rational number fields [PDF]
, 2023 Zakariae Bouazzaoui, Donghyeok Lim
openalex +1 more source
On the section conjecture over fields of finite type
Mathematische Nachrichten, Volume 298, Issue 11, Page 3476-3493, November 2025.Abstract Assume that the section conjecture holds over number fields. We prove then that it holds for a broad class of curves defined over finitely generated extensions of Q$\mathbb {Q}$. This class contains every projective, hyperelliptic curve, every hyperbolic, affine curve of genus ≤2$\le 2$, and a basis of open subsets of any curve.
Giulio Bresciani
wiley +1 more source
Application of Partial Discrete Logarithms for Discrete Logarithm Computation
ComputersA novel approach to constructing an algorithm for computing discrete logarithms, which holds significant interest for advancing cryptographic methods and the applied use of multivalued logic, is proposed.
Dina Shaltykova +3 more
doaj +1 more source
Galois Field Instructions in the Sandblaster 2.0 Architectrue
International Journal of Digital Multimedia Broadcasting, 2009 This paper presents a novel approach to implementing multiplication of Galois Fields with 2N. Elements of GF(2N) can be represented as polynomials of degree less than N over GF(2).
Mayan Moudgill +2 more
doaj +1 more source
Normal covering numbers for Sn$S_n$ and An$A_n$ and additive combinatorics
Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3307-3325, November 2025.Abstract The normal covering number γ(G)$\gamma (G)$ of a noncyclic group G$G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for γ(Sn)$\gamma (S_n)$ and γ(An)$\gamma (A_n)$ depending on the arithmetic structure of n$n$. In particular we determine the limsups over γ(Sn)/n$\gamma (S_n) / n$ and γ(An)
Sean Eberhard, Connor Mellon
wiley +1 more source
Arithmetic sparsity in mixed Hodge settings
Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3511-3521, November 2025.Abstract Let X$X$ be a smooth irreducible quasi‐projective algebraic variety over a number field K$K$. Suppose X$X$ is equipped with a p$p$‐adic étale local system compatible with an admissible graded‐polarized variation of mixed Hodge structures on the complex analytification of XC$X_{\operatorname{\mathbb {C}}}$.
Kenneth Chung Tak Chiu
wiley +1 more source
A new DNA-based model for finite field arithmetic
Heliyon, 2019 A Galois field GF(pn) with p≥2 a prime number and n≥1 is a mathematical structure widely used in Cryptography and Error Correcting Codes Theory. In this paper, we propose a novel DNA-based model for arithmetic over GF(pn).
Iván Jirón +4 more
doaj +1 more source
AIMS MathematicsBlock ciphers are essential for the secure exchange of data and communication, as they are one of the primary components of network security systems. Modern-day block ciphers are most significantly reliant on substitution-boxes (S-boxes). In essence, the
Abdul Razaq +4 more
doaj +1 more source