Given a cyclic group G with generator g, and given an element t in G, the discrete logarithm problem is that of computing an integer l with g = t. The problem of computing discrete logarithms is fundamental in computational algebra, and of great importance in cryptography. In this lecture we shall examine how sometimes the problem may be reduced to the computation of discrete logarithms in smal...

‎‎in this paper‎, ‎the existence and uniqueness of positive solutions for a class of nonlinear initial value problem for a finite fractional difference equation obtained by constructing the upper and lower control functions of nonlinear term without any monotone requirement‎ .‎the solutions of fractional difference equation are the size of tumor in model tumor growth described by the gompertz f...

Multiplicative calculus, also called non-Newtonian represents an alternative approach to the usual calculus of Newton (1643–1727) and Leibniz (1646–1716). This type was first introduced by Grossman Katz it provides a defined calculation, from start, for positive real numbers only. In this investigation, we propose study symmetrical fractional multiplicative inequalities Simpson type. For this, ...

Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...

Based on multiplicative calculus, the finite difference schemes for the numerical solution of multiplicative differential equations and Volterra differential equations are presented. Sample problems were solved using these new approaches.

We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a self-dual noncommutative operator inspired by CCS, that seems not to be expressible in the sequent calculus. Then we show that multiplicative exponential linear logic benefits from its...

This paper investigates the proof theory of multiplicative additive system virtual (MAV). MAV combines two established proof calculi: multiplicative additive linear logic (MALL) and basic system virtual (BV). Due to the presence of the self-dual non-commutative operator from BV, the calculus MAV is defined in the calculus of structures — a generalisation of the sequent calculus where inference ...

We study certain function algebras and their operator algebra completions on r-discrete abelian groupoids, the corresponding conditional expectations, maximal abelian subalgebras (masa) and eigen-functionals. We give a semidirect product decomposition for an abelian groupoid. This is done through a matched pair and leads to a C*-diagonal (for a special case). We use this decomposition to study ...

In this paper, we will give a natural definition for morphisms between multiplicative unitaries. We will then discuss some equivalences of this definition and some interesting properties of them. Moreover, we will define normal sub-multiplicative unitaries for multiplicative unitaries of discrete type and prove an imprimitivity type theorem for discrete multiplicative unitaries.