Results 51 to 60 of about 322,239 (148)
Asymptotic distribution of traces of singular moduli
Asymptotic distribution of traces of singular moduli, Discrete Analysis 2022:4, 14 pp. This paper concerns the modular $j$-function, a famous function that is fundamental to algebraic number theory and has remarkable connections to other areas of ...
Nickolas Andersen, William Duke
doaj +1 more source
On relationships between two linear subspaces and two orthogonal projectors
Sum and intersection of linear subspaces in a vector space over a field are fundamental operations in linear algebra. The purpose of this survey paper is to give a comprehensive approach to the sums and intersections of two linear subspaces and their ...
Tian Yongge
doaj +1 more source
Stability in the category of smooth mod-p representations of ${\mathrm {SL}}_2(\mathbb {Q}_p)$
Let $p \geq 5$ be a prime number, and let $G = {\mathrm {SL}}_2(\mathbb {Q}_p)$ . Let $\Xi = {\mathrm {Spec}}(Z)$ denote the spectrum of the centre Z of the pro-p Iwahori–Hecke algebra of G with coefficients in a field k of ...
Konstantin Ardakov, Peter Schneider
doaj +1 more source
Biderivations of Simple Modular Lie Algebras of Cartan-Type
Assume that L is a simple Lie algebra of Cartan-type over an algebraically closed field with a characteristic p>3. We demonstrate that all symmetric biderivations vanish by using weight space decompositions relative to a suitable torus and the standard Z-
Wei Bai, Wende Liu
doaj +1 more source
Derived Categories and the Analytic Approach to General Reciprocity Laws—Part II
Building on the topological foundations constructed in Part I, we now go on to address the homological algebra preparatory to the projected final arithmetical phase of our attack on the analytic proof of general reciprocity for a number field.
Michael C. Berg
doaj +1 more source
Geometric realization of electronic elections based on threshold secret sharing
Introduction. One of the tasks arising in cryptography is to ensure a safe and fair conduct of e-voting. This paper details the algorithm of electronic elections particularly that part which deals with the cryptographic security.
A. V. Mazurenko, V. A. Stukopin
doaj +1 more source
Wiedemann’s paper, introducing his algorithm for sparse and structured matrix computations over arbitrary fields, also presented a pair of matrix preconditioners for computations over small fields. The analysis of the second of these is extended in order to provide more explicit statements of the expected number of nonzero entries in the matrices ...
openaire +2 more sources
Diagonalisasi matriks atas ring dengan metode pemfaktoran secara lengkap
Generally, discussion about diagonalization of matrices in linear algebra is a matrix over the field. This research presents the diagonalization of matrices over commutative rings.
Nikita Nikita +2 more
doaj +1 more source
Let F denote a field and let V denote a vector space over F with finite positive dimension. Consider a pair A, A* of diagonalizable F-linear maps on V, each of which acts on an eigenbasis for the other one in an irreducible tridiagonal fashion.
Nomura Kazumasa, Terwilliger Paul
doaj +1 more source
Introduction. Polynomials in several variables over Galois fields provide the basis for the Reed-Muller coding theory, and are also used in a number of cryptographic problems.
V. M. Deundyak, N. S. Mogilevskaya
doaj +1 more source

