multiplicative operator
Recently Published Documents


TOTAL DOCUMENTS

18
(FIVE YEARS 3)

H-INDEX

4
(FIVE YEARS 1)

Author(s):  
Anuradha Gupta ◽  
Geeta Yadav

In this paper, the necessary and sufficient conditions for the product of composition operators to be isometry are obtained on weighted Bergman space. With the help of a counter example we also proved that unlike on [Formula: see text] and [Formula: see text] the composition operator on [Formula: see text] induced by an analytic self-map on [Formula: see text] with fixed origin need not be of norm one. We have generalized the Schwartz’s [Composition operators on [Formula: see text], thesis, University of Toledo (1969)] well-known result on [Formula: see text] which characterizes the almost multiplicative operator on [Formula: see text]


2019 ◽  
Vol 375 (1791) ◽  
pp. 20190306 ◽  
Author(s):  
Andrea E. Martin ◽  
Leonidas A. A. Doumas

Neither neurobiological nor process models of meaning composition specify the operator through which constituent parts are bound together into compositional structures. In this paper, we argue that a neurophysiological computation system cannot achieve the compositionality exhibited in human thought and language if it were to rely on a multiplicative operator to perform binding, as the tensor product (TP)-based systems that have been widely adopted in cognitive science, neuroscience and artificial intelligence do. We show via simulation and two behavioural experiments that TPs violate variable-value independence, but human behaviour does not. Specifically, TPs fail to capture that in the statements fuzzy cactus and fuzzy penguin , both cactus and penguin are predicated by fuzzy (x) and belong to the set of fuzzy things, rendering these arguments similar to each other. Consistent with that thesis, people judged arguments that shared the same role to be similar, even when those arguments themselves (e.g., cacti and penguins) were judged to be dissimilar when in isolation. By contrast, the similarity of the TPs representing fuzzy (cactus) and fuzzy (penguin) was determined by the similarity of the arguments, which in this case approaches zero. Based on these results, we argue that neural systems that use TPs for binding cannot approximate how the human mind and brain represent compositional information during processing. We describe a contrasting binding mechanism that any physiological or artificial neural system could use to maintain independence between a role and its argument, a prerequisite for compositionality and, thus, for instantiating the expressive power of human thought and language in a neural system. This article is part of the theme issue ‘Towards mechanistic models of meaning composition’.


2019 ◽  
Vol 9 (3) ◽  
pp. 721-747 ◽  
Author(s):  
Stéphane Mallat ◽  
Sixin Zhang ◽  
Gaspar Rochette

Abstract A major issue in harmonic analysis is to capture the phase dependence of frequency representations, which carries important signal properties. It seems that convolutional neural networks have found a way. Over time-series and images, convolutional networks often learn a first layer of filters that are well localized in the frequency domain, with different phases. We show that a rectifier then acts as a filter on the phase of the resulting coefficients. It computes signal descriptors that are local in space, frequency and phase. The nonlinear phase filter becomes a multiplicative operator over phase harmonics computed with a Fourier transform along the phase. We prove that it defines a bi-Lipschitz and invertible representation. The correlations of phase harmonics coefficients characterize coherent structures from their phase dependence across frequencies. For wavelet filters, we show numerically that signals having sparse wavelet coefficients can be recovered from few phase harmonic correlations, which provide a compressive representation.


2018 ◽  
Vol 115 (50) ◽  
pp. E11578-E11585 ◽  
Author(s):  
Egor Ospadov ◽  
Jianmin Tao ◽  
Viktor N. Staroverov ◽  
John P. Perdew

The Kohn–Sham potential veff(r) is the effective multiplicative operator in a noninteracting Schrödinger equation that reproduces the ground-state density of a real (interacting) system. The sizes and shapes of atoms, molecules, and solids can be defined in terms of Kohn–Sham potentials in a nonarbitrary way that accords with chemical intuition and can be implemented efficiently, permitting a natural pictorial representation for chemistry and condensed-matter physics. Let ϵmax be the maximum occupied orbital energy of the noninteracting electrons. Then the equation veff(r)=ϵmax defines the surface at which classical electrons with energy ϵ≤ϵmax would be turned back and thus determines the surface of any electronic object. Atomic and ionic radii defined in this manner agree well with empirical estimates, show regular chemical trends, and allow one to identify the type of chemical bonding between two given atoms by comparing the actual internuclear distance to the sum of atomic radii. The molecular surfaces can be fused (for a covalent bond), seamed (ionic bond), necked (hydrogen bond), or divided (van der Waals bond). This contribution extends the pioneering work of Z.-Z. Yang et al. [Yang ZZ, Davidson ER (1997) Int J Quantum Chem 62:47–53; Zhao DX, et al. (2018) Mol Phys 116:969–977] by our consideration of the Kohn–Sham potential, protomolecules, doubly negative atomic ions, a bond-type parameter, seamed and necked molecular surfaces, and a more extensive table of atomic and ionic radii that are fully consistent with expected periodic trends.


1995 ◽  
Vol 60 (3) ◽  
pp. 775-796 ◽  
Author(s):  
Hajnal Andréka ◽  
Steven Givant ◽  
István Németi

Jónsson and Tarski [1951] introduced the notion of a Boolean algebra with (additive) operators (for short, a Bo). They showed that every Bo can be extended to a complete and atomic Bo satisfying certain additional conditions, and that any two complete, atomic extensions of satisfying these conditions are isomorphic over . Henkin [1970] extended these results to Boolean algebras with generalized (i.e., weakly additive) operators. The particular complete, atomic extension of studied by Jónsson and Tarski is called the perfect extension of , and is denoted by +. It is very useful in algebraic investigations of classes of algebras that are associated with logics.Interesting examples of Bos abound in algebraic logic, and include relation algebras, cylindric algebras, and polyadic and quasi-polyadic algebras (with or without equality). Moreover, there are several important constructions that, when applied to certain Bos, lead to other, derived Bos. Obvious examples include the formation of subalgebras, homomorphic images, relativizations, and direct products. Other examples include the Boolean algebra of ideal elements of a Bo, the neat β;-reduct of an α-dimensional cylindric algebra (β; < α), and the relation algebraic reduct of a cylindric algebra (of dimension at least 3). It is natural to ask about the relationship between the perfect extension of a Bo and the perfect extension of one of its derived algebras ′: Is the perfect extension of the derived algebra just the derived algebra of the perfect extension? In symbols, is (′)+ = (+)′? For example, is the perfect extension of a subalgebra, homomorphic image, relativization, or direct product, just the corresponding subalgebra, homomorphic image, relativization, or direct product of the perfect extension (up to isomorphisms)? Is the perfect extension of the Boolean algebra of ideal elements, or the neat reduct of a cylindric algebra, or the relation algebraic reduct of a cylindric algebra just the Boolean algebra of ideal elements, or the neat β;-reduct, or the relation algebraic reduct, of the perfect extension? We shall prove a general result in this direction; namely, if the derived algebra is constructed as the range of a relatively multiplicative operator, then the answer to our question is “yes”. We shall also give examples to show that in “infinitary” constructions, our question can have a spectacularly negative answer.


Sign in / Sign up

Export Citation Format

Share Document