Results 251 to 260 of about 959,671 (288)

Derivatives and closed sets

Acta Mathematica Hungarica, 1984
The author proves that a real function defined on a closed set S and differentiable relative to S can be extended to a function differentiable on the whole real line. This is a generalization of a result of \textit{G. Petruska} and \textit{M. Laczkovich} [Acta. Math. Acad. Sci. Hung. 25, 189- 212 (1974; Zbl 0279.26003)].
openaire   +1 more source

Derived sets and inductive inference

1994
The paper deals with using topological concepts in studies of the Gold paradigm of inductive inference. They are — accumulation points, derived sets of order α (α — constructive ordinal) and compactness. Identifiability of a class U of total recursive functions with a bound α on the number of mindchanges implies \(U^{(\alpha + 1)} = \not 0\).
openaire   +1 more source

Weak* derived sets of sets of linear functionals

Mathematical Notes of the Academy of Sciences of the USSR, 1978
For a Banach space X the w*-sequential closure operator in the adjoint space is, in general, not the topological closure operator. That is, it may happen that the w*-sequential closure of a subspace T of X* is not w*-sequentially closed. The possible length of the chain of repeated w*-sequential closures of a subspace of X* in dependence on the ...
openaire   +1 more source

Uniform Continuity of Derivatives in Convex Sets

The American Mathematical Monthly, 1980
No abstract.
openaire   +1 more source

Set functions and their derivatives

1996
Let S be a ring of subsets of a given set, and s a real-valued function (i.e. infinity is excluded as a value) on S. Then s is said to be of bounded (or finite) variation on a set E ∈ S, if s+(E) and S−(E) are both finite, where $${s^ + }(E) = \mathop {\sup }\limits_{\begin{array}{*{20}{l}} {F \subset E} \\ {F \in S} \end{array}} s(F),$$ and
openaire   +1 more source

Derivatives of Tree Sets with Applications to Grammatical Inference

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1981
Tree automata generalize the notion of a finite automaton working on strings to that of a finite automaton operating on trees. Most results for finite automata have been extended to tree automata. In this paper we introduce tree derivatives which extend the concept of Brzozowski's string derivatives.
openaire   +3 more sources

Sets of Commuting Derivations and Simplicity

Communications in Algebra, 2006
A ring R is simple under a set D of derivations if no nontrivial ideal of R is preserved by all derivations in D. Continuing previous joint work with C. J. Maxson, the author provides a computational test for the simplicity of k[x 1,…,x n ]/〈 x 1 p ,…, x n p 〉 (k a field of characteristic p > 0) under a set of commuting k-derivations.
openaire   +1 more source

Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation

2009
The discovery of frequent patterns has attracted a lot of attention of the data mining community. While an extensive research has been carried out for discovering positive patterns, little has been offered for discovering patterns with negation. The main hindrance to the progress of such research is huge amount of frequent patterns with negation, which
openaire   +1 more source

Fixed points and Lie bracket (ternary) derivation–derivation

Journal of Analysis, 2022
Vahid Keshavarz
exaly  

A Review of Bayesian Perspectives on Sample Size Derivation for Confirmatory Trials

American Statistician, 2021
Kevin Kunzmann, Michael J Grayling, Kim May Lee   +2 more
exaly