Strongly multiplicative graphs
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,...,p so that the values on the edges, obtained as the product of the labels of their end vertices, are all distinct.
Hegde, S., Beineke, L.
core +1 more source
Lie perfect, Lie central extension and generalization of nilpotency in multiplicative Lie algebras
summary:This paper aims to introduce and explore the concept of Lie perfect multiplicative Lie algebras, with a particular focus on their connections to the central extension theory of multiplicative Lie algebras.
Singh, Dev Karan +2 more
core +1 more source
Convexity, superquadratic growth, and dot products. [PDF]
Hanson B, Roche-Newton O, Senger S.
europepmc +1 more source
Shape analysis of sand particles based on Fourier descriptors. [PDF]
Yan T, Liu Y, Wei D, Sun X, Liu Q.
europepmc +1 more source
Extended Arimoto-Blahut Algorithms for Bistatic Integrated Sensing and Communications Systems. [PDF]
Jiao T, Geng Y, Wei Z, Yang Z.
europepmc +1 more source
Quasi-exact Approximation of Hidden Markov Chain Filters [PDF]
This paper studies the application of exact simulation methods for multi-dimensional multiplicative noise stochastic differential equations to filtering.
Eckhard Platen, Renata Rendek
core
Quantum higher-order Fourier analysis and the Clifford hierarchy. [PDF]
Bu K, Gu W, Jaffe A.
europepmc +1 more source
The Joint Evolution of Herbivory Defense and Mating System in Plants: A Simulation Approach. [PDF]
Sandoval-Castellanos E +1 more
europepmc +1 more source
From Levin's Universal Search to Policy-Guided Tree Search. [PDF]
Li M.
europepmc +1 more source
Plastic Evolution Characterization for 304 Stainless Steel by CQN_Chen Model under the Proportional Loading. [PDF]
Gao X +6 more
europepmc +1 more source

