converse assertion
Recently Published Documents


TOTAL DOCUMENTS

5
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

2017 ◽  
Vol 12 (1) ◽  
pp. 99-107
Author(s):  
Christoph Aistleitner ◽  
Gerhard Larcher

Abstract We consider strictly increasing sequences (an)n≥1 of integers and sequences of fractional parts ({anα})n≥1 where α ∈ R. We show that a small additive energy of (an)n≥1 implies that for almost all α the sequence ({anα})n≥1 has large discrepancy. We prove a general result, provide various examples, and show that the converse assertion is not necessarily true.


2016 ◽  
Vol 09 (04) ◽  
pp. 1650088
Author(s):  
Ivan Chajda ◽  
Helmut Länger

It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The natural question arises if the converse assertion is also true. We show that the conversion is possible provided the given semiring is, moreover, completely distributive. We characterize semirings associated to complete residuated lattices satisfying the double negation law where the assumption of complete distributivity can be omitted. A similar result is obtained for idempotent residuated lattices.


2016 ◽  
Vol 12 (05) ◽  
pp. 1365-1369 ◽  
Author(s):  
Romeo Meštrović

Let [Formula: see text] be a prime. Back in 1878, Lucas proved that the congruence [Formula: see text] holds for any nonnegative integer [Formula: see text]. The converse statement was given in Problem 1494 of Mathematics Magazine proposed in 1997 by Deutsch and Gessel. In this note, we generalize this converse assertion as follows: If [Formula: see text] and [Formula: see text] are integers such that [Formula: see text] for every integer [Formula: see text], then [Formula: see text] is a prime and [Formula: see text] is a power of [Formula: see text].


2012 ◽  
Vol 92 (106) ◽  
pp. 97-108
Author(s):  
Hideaki Ishikawa ◽  
Yuichi Kamiya

We introduce a concept called good oscillation. A function is called good oscillation, if its m-tuple integrals are bounded by functions having mild orders. We prove that if the error terms coming from summatory functions of arithmetical functions are good oscillation, then the Dirichlet series associated with those arithmetical functions can be continued analytically over the whole plane. We also study a sort of converse assertion that if the Dirichlet series are continued analytically over the whole plane and satisfy a certain additional assumption, then the error terms coming from the summatory functions of Dirichlet coefficients are good oscillation.


1975 ◽  
Vol 12 (S1) ◽  
pp. 217-224 ◽  
Author(s):  
P. Whittle

It is well-known that the transition matrix of a reversible Markov process can have only real eigenvalues. An example is constructed which shows that the converse assertion does not hold. A generalised notion of reversibility is proposed, ‘dynamic reversibility’, which has many of the implications for the form of the transition matrix of the classical definition, but which does not exclude ‘circulation in state-space’ or, indeed, periodicity.


Sign in / Sign up

Export Citation Format

Share Document