Results 21 to 30 of about 1,857,722 (261)
A sufficient condition for hyperinvariance [PDF]
A linear transformation on a finite-dimensional complex linear space has the property that all of its invariant subspaces are hyperinvariant if and only if its lattice of invariant subspaces is distributive [1]. It is shown that an operator on a complex Hilbert space has this property if its lattice of invariant subspaces satisfies a certain ...
openaire +1 more source
Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
Cryptographic hashing modes come in many flavors, including Merkle-Damgård with various types of strengthening, Merkle trees, and sponge functions. As underlying primitives, these functions use arbitrary functions, permutations, or block ciphers. In this
Joan Daemen +2 more
doaj +1 more source
On sufficient conditions for overconvergence [PDF]
Ostrowski has shown that a Taylor series f(z)= n aZnn with finite nonzero radius of convergence overconverges in a neighborhood of each point of the circle of convergence at which f(z) is regular if an=O for ...
openaire +2 more sources
Notes on oscillation of linear delay differential equations
This paper deals with the oscillation criteria for the linear delay differential equations. We present new sufficient conditions for the oscillation of all solutions of such equations.
Božena Dorociaková +2 more
doaj +1 more source
Spectral Sufficient Conditions on Pancyclic Graphs
A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n. In fact, it is NP-complete that deciding whether a graph is pancyclic.
Guidong Yu +3 more
doaj +1 more source
Sufficient conditions to be exceptional
A copositive matrix A is said to be exceptional if it is not the sum of a positive semidefinite matrix and a nonnegative matrix. We show that with certain assumptions on A−1, especially on the diagonal entries, we can guarantee that a copositive matrix A
Johnson Charles R., Reams Robert B.
doaj +1 more source
Errata to Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
In ToSC 2018(4), Daemen et al. performed an in-depth investigation of sound hashing modes based on arbitrary functions, permutations, or block ciphers. However, for the case of invertible primitives, there is a glitch.
Aldo Gunsing, Joan Daemen, Bart Mennink
doaj +1 more source
Necessary and sufficient conditions for quasisymmetry [PDF]
A necessary and sufficient set of conditions for a quasisymmetric magnetic field in the form of constraint equations is derived from first principles. Without any assumption regarding the magnetohydrodynamic (MHD) equilibrium of the plasma, conditions for quasisymmetry are constructed starting from the single-particle Lagrangian to the leading order ...
E. Rodríguez +2 more
openaire +3 more sources
Sufficient Conditions for Labelled 0-1 Laws [PDF]
If F(x) = e G(x), where F(x) = Σf(n)x n and G(x) = Σg(n)x n, with 0≤g(n) = O(n θn /n!), θ∈(0,1), and gcd(n: g(n) >0)=1, then f(n)= o(f(n-1)).
Stanley Burris, Karen Yeats
doaj +2 more sources
Summary The concept of sufficiency can be examined locally for a neighbourhood of a parameter point θ0 and it leads to an estimate that has minimum variance among locally-unbiased estimates (Fraser, 1964). This local estimate generates the natural global estimate for the case of the simple exponential model, but it does not do so for the
openaire +2 more sources

