English
Related papers

Related papers: Multiplicative function instead of logarithm (an e…

200 papers

This paper concerns three classes of real-valued functions on intervals, operator monotone functions, operator convex functions, and strongly operator convex functions. Strongly operator convex functions were previously treated in [3] and…

Functional Analysis · Mathematics 2018-05-29 Lawrence G. Brown , Mitsuru Uchiyama

Following Wigert, various authors, including Ramanujan, Gronwall, Erd\H{o}s, Ivi\'{c}, Schwarz, Wirsing, and Shiu, determined the maximal order of several multiplicative functions, generalizing Wigert's result $$\max_{n\leq x} \log d(n) =…

Number Theory · Mathematics 2019-07-31 Christian Elsholtz , Marc Technau , Niclas Technau

Real and complex norms of a linear operator acting on a normed complexified space are considered. Bounds on the ratio of these norms are given. The real and complex norms are shown to coincide for four classes of operators: 1) real linear…

Functional Analysis · Mathematics 2007-05-23 Olga Holtz , Michael Karow

The period of a strongly connected digraph is the greatest common divisor of the lengths of all its cycles. The period of a digraph is the least common multiple of the periods of its strongly connected components. These notions play an…

Discrete Mathematics · Computer Science 2025-06-10 Stefan Kiefer , Andrew Ryzhikov

In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…

Representation Theory · Mathematics 2020-06-26 Andrés Franco , Hernán Giraldo , Pedro Rizzo

We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.

Commutative Algebra · Mathematics 2013-02-05 Emilie Dufresne , Jonathan Elmer , Müfit Sezer

In this article, we prove that for a completely multiplicative function $f$ from $\mathbb{N}^*$ to a field $K$ such that the set $$\{p \;|\; f(p)\neq 1_K \;\mbox{and }p \mbox{ is prime}\}$$ is finite, the asymptotic subword complexity of…

Combinatorics · Mathematics 2016-06-01 Yining Hu

We consider a "superposition operator" obtained through the continuous superposition of operators of mixed fractional order, modulated by a signed Borel finite measure defined over the set $[0, 1]$. The relevance of this operator is rooted…

Analysis of PDEs · Mathematics 2026-04-15 Serena Dipierro , Edoardo Proietti Lippi , Caterina Sportelli , Enrico Valdinoci

For the case of a relativistic scalar field at finite temperature with a chemical potential, we calculate an exact expression for the one-loop effective action using the full fourth order determinant and zeta-function regularisation. We…

High Energy Physics - Theory · Physics 2007-05-23 J. J. McKenzie-Smith , D. J. Toms

Poly-infix operators and operator families are introduced as an alternative for working modulo associativity and the corresponding bracket deletion convention. Poly-infix operators represent the basic intuition of repetitively connecting an…

History and Overview · Mathematics 2015-05-06 Jan A. Bergstra , Alban Ponse

The Operator axioms have produced new real numbers with new operators. New operators naturally produce new equations and thus extend the traditional mathematical models which are selected to describe various scientific rules. So new…

Numerical Analysis · Computer Science 2021-02-08 Pith Peishu Xie

The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that the classical Rockafellar's constraint qualification holds, which is called the "sum…

Functional Analysis · Mathematics 2014-07-01 Liangjin Yao

The notion of lacunary infinite numerical sequence is introduced. It is shown that for an arbitrary linear difference operator L with coefficients belonging to the set R of infinite numerical sequences, a criterion (i.e., a necessary and…

Symbolic Computation · Computer Science 2023-11-07 Sergei Abramov , Gleb Pogudin

Let $T$ be a injective bounded linear operator on a complex Hilbert space. We characterize the complex numbers $\lambda,\mu$ for which $(I+\lambda T)(I+\mu T)^{-1}$ is a contraction, the characterization being expressed in terms of the…

Functional Analysis · Mathematics 2024-09-24 Thomas Ransford , Dashdondog Tsedenbayar

In [Tha15], we looked at two (`multiplicative' and `Carlitz-Drinfeld additive') analogs each, for the well-known basic congruences of Fermat and Wilson, in the case of polynomials over finite fields. When we look at them modulo higher…

Number Theory · Mathematics 2022-11-03 Dinesh S Thakur

In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the…

Cryptography and Security · Computer Science 2013-11-27 Razvan Barbulescu , Pierrick Gaudry , Antoine Joux , Emmanuel Thomé

A method for construction of analytic function f of the annihilation operator is given for the first time. f(z) is analytic on some compact domain that does not separate the complex plane. A new form of the identity is given, which is well…

Mathematical Physics · Physics 2010-05-14 Aleksandar Petrovic

We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…

Information Theory · Computer Science 2010-08-20 Graham H. Norton

The operator algebra is introduced based on the framework of logarithmic representation of infinitesimal generators. In conclusion a set of generally-unbounded infinitesimal generators is characterized as a module over the Banach algebra.

Functional Analysis · Mathematics 2018-03-07 Yoritaka Iwata

We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\geq1$ selector fields ($\seplogk{k}$). Second, we show that this entails the decidability of the finite…

Logic in Computer Science · Computer Science 2018-05-01 Mnacho Echenim , Radu Iosif , Nicolas Peltier