Related papers: On the remainder in the Taylor theorem
A simple proof of Noether's first theorem involves the promotion of a constant symmetry parameter $\epsilon$ to an arbitrary function of time, the Noether charge $Q$ is then the coefficient of $\dot\epsilon$ in the variation of the action.…
In this paper we focus on the study of the monotonicity properties of the residual and the past extropy as well as on some characterization problems. We then apply the derived results to analyze further stochastic aspects of order…
We present some necessary and/or sufficient conditions for the positivity problem of three-term recurrence sequences. As applications we show the positivity of diagonal Taylor coefficients of some rational functions in a unified approach.…
We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…
It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We…
There are proven few analogues of the Theorem of Moser using The Approximation Theorem of Artin.
This paper presents a new proof of the renewal theorem by bijecting a general point process to a deterministic one (where the time between events is always fixed). It also provides insight into the workings of the renewal theorem.
We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
Let $$ T(q)=\sum_{k=1}^\infty d(k) q^k, \quad |q|<1, $$ where $d(k)$ denotes the number of positive divisors of the natural number $k$. We present monotonicity properties of functions defined in terms of $T$. More specifically, we proved…
We reformulate and generalize the uniqueness and existence proofs of time-dependent density-functional theory. The central idea is to restate the fundamental one-to-one correspondence between densities and potentials as a global fixed point…
I study the modal theory of linear orders under embeddings, monotone maps, condensations, and end-extensions. I prove modality elimination for embeddings and monotone maps, show that condensations make scatteredness modally definable, and…
We study the Hardy type inequalities in the framework of equalities. We present equalities which immediately imply Hardy type inequalities by dropping the remainder term. Simultaneously we give a characterization of the class of functions…
This paper is a sequel to [1] and considers definability in differential-henselian monotone fields with c-map and angular component map. We prove an Equivalence Theorem among whose consequences are a relative quantifier reduction and an NIP…
For any time bound f, let H(f) denote the hierarchy conjecture which means that the restriction of the numbers of work tapes of deterministic Turing machines to some b generates an infinite hierarchy of proper subclasses DTIME_b(f) \subset…
In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…
We show a pointwise estimate for the Fourier transform on the line involving the number of times the function changes monotonicity. The contrapositive of the theorem may be used to find a lower bound to the number of local maxima of a…
This proof of Godel's first incompleteness theorem doesn't require omega-consistency, nor does it refer to codes of negated sentences as in Rosser's. It begins from where Godel's usual proof ends, and stalks it till it ends proving it.
In this paper, we give the explicit bounds for the data of objects involved in some basic theorems of Singularity theory: the Inverse, Implicit and Rank Theorems for Lipschitz mappings, Splitting Lemma and Morse Lemma, the density and…
We derive the monotonicity of the quantum relative entropy by an elementary operational argument based on Stein's lemma in quantum hypothesis testing. For the latter we present an elementary and short proof that requires the law of large…