Related papers: Multiplicative function instead of logarithm (an e…
Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $\sigma=(\sigma_0,\sigma_1,\ldots)$ with entries in $\{0,1\}$ defined by using the quadratic character $\chi$ of the finite field $\mathbb{F}_q$: $$ \sigma_n=\left\{…
The Hardy operator is not bounded on the space of integrable functions on the positive half-line and its discrete counterpart on summable sequences. we introduce a modified Hardy operator obtained by subtracting a natural corrective term,…
Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…
We present an approach how to obtain solutions of arbitrary linear operator equation for unknown functions. The particular solution can be represented by the infinite operator series (Cyclic Operator Decomposition), which acts the…
A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that…
In this paper we consider logarithmic operators in two different contexts: the adapted to (continuous) Schr\"odinger operators and the classical discrete setting. The Schr\"odinger operator $\mathcal L_V$ on $\mathbb R^d$ is defined as…
Recent breakthrough methods \cite{gggz,joux,bgjt} on computing discrete logarithms in small characteristic finite fields share an interesting feature in common with the earlier medium prime function field sieve method \cite{jl}. To solve…
The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been…
Let $f$ be a complex valued function on a finite field $F$ such that $f(0) = 0$, $f(1) = 1$, and $|f(x)| = 1$ for $x \neq 0$. Cohn asked if it follows that $f$ is a nontrivial multiplicative character provided that $\sum_{x \in F} f(x)…
We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms…
We prove bounds for multilinear operators on $\R^d$ given by multipliers which are singular along a $k$ dimensional subspace. The new case of interest is when the rank $k/d$ is not an integer. Connections with the concept of {\em true…
We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or…
We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations.…
Let $x$ be a cyclic sequence of $n$ elements of the finite field $\mathbb{F}_q$ (the first element immediately follows the $n$-th one). Let us define the operation $\Delta$ as the transition from $x$ to the sequence of differences of the…
We propose the extension of the complex numbers to be the new domain where new concepts, like negative and imaginary probabilities, can be defined. The unit of the new space is defined as the solution of the unsolvable equation in the…
We introduce a subfamily of additive enlargements of a maximally monotone operator. Our definition is inspired by the early work of Simon Fitzpatrick. These enlargements constitute a subfamily of the family of enlargements introduced by…
We fully classify automatic sequences $a$ over a finite alphabet $\Omega$ with the property that each word over $\Omega$ appears is $a$ along an arithmetic progression. Using the terminology introduced by Avgustinovich, Fon-Der-Flaass and…
We study multiplicative dependence between elements in orbits ofalgebraic dynamical systems over number fields modulo a finitely generated multiplicative subgroup of the field. We obtain a series of results, many of which may be viewed as a…
Motivated by the study of the distribution of zeros of generalized Bessel-type functions, the principal goal of this paper is to identify new research directions in the theory of multiplier sequences. The investigations focus on multiplier…
multiplication operator on a Hilbert space may be approximated with finite sections by choosing an orthonormal basis of the Hilbert space. Nonzero multiplication operators on $L^2$ spaces of functions are never compact and then such…