English
Related papers

Related papers: The Natural Logarithm on Time Scales

200 papers

We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…

Symbolic Computation · Computer Science 2016-04-05 Toshinori Oaku

We define the indefinite logarithm [log x] of a real number x>0 to be a mathematical object representing the abstract concept of the logarithm of x with an indeterminate base (i.e., not specifically e, 10, 2, or any fixed number). The…

General Physics · Physics 2007-05-23 Michael P. Frank

We derive properties of $\pi(x)$ reminiscent of those of the logarithm and absolute value functions. Two of these properties are similar to the relations defining the linearity of a function. Several applications of these properties of…

Number Theory · Mathematics 2011-08-16 Boris B. Benyaminov

By the early 1960's advances in statistical physics had established the existence of universality classes for systems with second-order phase transitions and characterized these by critical exponents which are different to the classical…

Statistical Mechanics · Physics 2017-08-23 Ralph Kenna

We first prove some weighted inequalities for compositions of functions on time scales which are in turn applied to establish some new dynamic Opial-type inequalities in several variables. Some generalizations and applications to partial…

Classical Analysis and ODEs · Mathematics 2016-05-31 Tran Dinh Phung

We develop the calculus of variations on time scales for a functional that is the composition of a certain scalar function with the delta and nabla integrals of a vector valued field. Euler-Lagrange equations, transversality conditions, and…

Optimization and Control · Mathematics 2013-06-13 Monika Dryl , Delfim F. M. Torres

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

Computational Complexity · Computer Science 2017-04-20 Jean-Yves Moyen , Jakob Grue Simonsen

We prove necessary optimality conditions for problems of the calculus of variations on time scales with a Lagrangian depending on the free end-point.

Optimization and Control · Mathematics 2010-09-21 Agnieszka B. Malinowska , Delfim F. M. Torres

Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…

Data Structures and Algorithms · Computer Science 2017-04-24 Ali Dasdan

The concept of natural time turned out to be useful in revealing dynamical features behind complex time series including electrocardiograms, ionic current fluctuations of membrane channels, seismic electric signals, and seismic event…

Other Condensed Matter · Physics 2009-09-29 Sumiyoshi Abe , N. V. Sarlis , E. S. Skordas , H. Tanaka , P. A. Varotsos

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

Quantum Physics · Physics 2017-02-20 Peter W. Shor

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

Cryptography and Security · Computer Science 2007-12-27 Andreas Enge

A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…

Number Theory · Mathematics 2019-02-13 Thorsten Kleinjung , Benjamin Wesolowski

Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…

Artificial Intelligence · Computer Science 2026-01-22 Ritam Raha , Rajarshi Roy , Nathanaël Fijalkow , Daniel Neider

We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality…

Number Theory · Mathematics 2019-11-19 Thorsten Kleinjung , Benjamin Wesolowski

Roman logarithmic binomial formula analogue has been found . It is presented here also for the case of fibonomial coefficients which recently have been given a combinatorial interpretation by the present author.

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

We prove a necessary optimality condition of Euler-Lagrange type for variational problems on time scales involving nabla derivatives of higher-order. The proof is done using a new and more general fundamental lemma of the calculus of…

Optimization and Control · Mathematics 2009-11-13 Natalia Martins , Delfim F. M. Torres

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Mathematical Physics · Physics 2011-09-27 H. Azad , A. Laradji , M. T. Mustafa

We consider several possible approaches to evaluating an integral involving the digamma function and a related logarithmic series.

General Mathematics · Mathematics 2012-12-11 Donal F. Connon

In part I: We find a series physical scales such as 1) Planck scale, 2) Minimal approximate grand unification SU(5), 3) the mass scale of the see saw model right handed or Majorana neutrinoes, some invented scale with many scalar bosons,…

High Energy Physics - Phenomenology · Physics 2025-02-25 Holger Bech Nielsen