Results 1 to 10 of about 5,469 (233)
Convolutional kernel function algebra
Many systems for image manipulation, signal analysis, machine learning, and scientific computing make use of discrete convolutional filters that are known before computation begins.
Edward Stow, Paul H. J. Kelly
doaj +4 more sources
Congruency, Homomorphism and Isomorphism on Autometrized Algebras [version 2; peer review: 2 approved, 1 approved with reservations] [PDF]
This paper presents a study of congruence relations on autometrized algebras. We demonstrate that in a normal autometrized algebra, which satisfies certain conditions, the set of all congruence relations forms a complete sublattice within the set of all ...
Gebrie Yeshiwas Tilahun
doaj +2 more sources
Strong endomorphism kernel property for monounary algebras [PDF]
All monounary algebras which have strong endomorphism kernel property are described.
Emília Halušková
doaj +4 more sources
A Study on Neutrosophic Algebra [PDF]
The notion of neutrosophic algebra, ideal of neutrosophic algebra, kernel and neutrosophic quotient algebra have been proposed in this paper. We characterize some properties of neutrosophic algebra and proved that every quotient neutrosophic algebra is ...
T. Nagaiah +3 more
doaj +1 more source
Some monounary algebras with EKP [PDF]
An algebra $\cal A$ is said to have the endomorphism kernel property (EKP) if every congruence on $\cal A$ is the kernel of some endomorphism of $\cal A$. Three classes of monounary algebras are dealt with.
Emilia Halušková
doaj +1 more source
Algebraicity of the Bergman kernel
Our main result introduces a new way to characterize two-dimensional finite ball quotients by algebraicity of their Bergman kernels. This characterization is particular to dimension two and fails in higher dimensions, as is illustrated by a counterexample in dimension three constructed in this paper.
Peter Ebenfelt, Ming Xiao, Hang Xu
openaire +3 more sources
Kernel Approximation on Algebraic Varieties
Low-rank approximation of kernels is a fundamental mathematical problem with widespread algorithmic applications. Often the kernel is restricted to an algebraic variety, e.g., in problems involving sparse or low-rank data. We show that significantly better approximations are obtainable in this setting: the rank required to achieve a given error depends
Jason M. Altschuler, Pablo A. Parrilo
openaire +2 more sources
Kernel L-Ideals and L-Congruence on a Subclass of Ockham Algebras
In this paper, we study L-congruences and their kernel in a subclass Kn,0 of the variety of Ockham algebras A. We prove that the class of kernel L-ideals of an Ockham algebra forms a complete Heyting algebra.
Teferi Getachew Alemayehu +2 more
doaj +1 more source
Structures of Pseudo - BG Algebra and Sime pseudo – BG - Algebra
In this paper, we introduced the notion new types of algebras pseudo BG- algebra, pseudo sub BG –algebra, Pseudo Ideal and pseudo strong Ideal of Pseudo-BG-Algebras.
Shwan Adnan Bajalan +2 more
doaj +1 more source
Block-encoding dense and full-rank kernels using hierarchical matrices: applications in quantum numerical linear algebra [PDF]
Many quantum algorithms for numerical linear algebra assume black-box access to a block-encoding of the matrix of interest, which is a strong assumption when the matrix is not sparse.
Quynh T. Nguyen +2 more
doaj +1 more source

