Results 81 to 90 of about 1,341,218 (213)
Characterizations of Gorenstein Rings Using Frobenius [PDF]
, 2017 Let R be a local commutative Noetherian ring of characteristic p \u3e 0 and f : R → R the Frobenius ring homomorphism sending r ∈ R to its pth power rp.
Falahola, Brittney
core
Self‐Similar Blowup for the Cubic Schrödinger Equation
Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1831-1918, August 2026.ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
A Data‐Driven Closed‐Loop Control Approach to Drive Neural State Transitions for Mechanistic Insight
Human Brain Mapping, Volume 47, Issue 11, 01 August 2026.The study introduces a data‐driven framework combining dynamical systems reconstruction and closed‐loop control to analyze brain‐state transitions in remitted depression. Using fMRI data, we show that these individuals more easily enter but struggle to exit sad mood states, revealing altered connectivity and potential neuromodulation targets for ...
Niklas Emonds +8 more
wiley +1 more source
Kloosterman sums over finite Frobenius rings [PDF]
, 2019 We study Kloosterman sums in a generalized ring-theoretic context, that of finite commutative Frobenius rings. We prove a number of identities for twisted Kloosterman sums, loosely clustered around moment computations.Comment: 27 ...
Nica, Bogdan
core +1 more source
Quasi-Frobenius quotient rings of group rings [PDF]
Journal of the Australian Mathematical Society, 1975 The purpose of this paper is an extension of a theorem of Hughes (1973). He showed: Let R be a ring which has a right artinian right quotient ring and let G be a group which has a (transfinite) ascending normal series with each factor either finite or cyclic, but only a finite number of finite factors.
openaire +2 more sources
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.ABSTRACT We address the problem of recovering highly oscillatory operators, represented as n×n$$ n\times n $$ matrices with a fixed set of observed entries. Given that these matrices can be well compressed by butterfly matrix decomposition of L=𝒪(logn) levels requiring only O(nlogn)$$ O\left(n\log n\right) $$ degrees of freedom, we propose a novel ...
Navjot Singh +3 more
wiley +1 more source
Quasi-Frobenius quotient rings [PDF]
, 1991 Let R be an associative (not necessarily commutative) ring with unit. The study of flat left R-modules permits to achieve homological characterizations for some kinds of rings (regular Von Neumann, hereditary).
Torrecillas, J. G., Jover, B. T.
core
Finite‐Block Polynomial and Volterra Structure in Reservoir Computing
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.ABSTRACT Reservoir computing is analyzed through the algebraic structure generated by finite‐width reservoirs on fixed input blocks. For linear and quadratic logistic activations, the induced input‐to‐state map admits an exact finite Volterra representation, yielding an explicit characterization of the associated hypothesis class.
Alfio Borzì
wiley +1 more source
Cocyclic Hadamard matrices from forms over finite Frobenius rings [PDF]
, 2009 We give a construction of cocyclic Butson–Hadamard matrices from bilinear forms over finite Frobenius rings, which generalizes previous constructions. We then prove a classification result, showing that the resulting matrices depend only on the additive ...
Ward, Harold N., McGuire, Gary
core +1 more source
Detecting When One Probe Vector is Enough for Preconditioned Log‐Determinant Approximation
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.ABSTRACT We present randomized algorithms for estimating the log‐determinant of regularized symmetric positive semi‐definite matrices. The algorithms access the matrix only through matrix vector products, and are based on the introduction of a preconditioner and stochastic trace estimator.
Alice Cortinovis, Daniele Toni
wiley +1 more source