Related papers: Exact Exponent of Remainder Term of Gelfond's Digi…
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…
The goal of this article is to define an analogue of the Weil-pairing for Drinfeld modules using explicit formulas and to deduce its main properties from these formulas. Our result generalizes the formula currently known for rank 2 Drinfeld…
A binary tensor consists of $2^n$ entries arranged into hypercube format $2 \times 2 \times \cdots \times 2$. There are $n$ ways to flatten such a tensor into a matrix of size $2 \times 2^{n-1}$. For each flattening, $M$, we take the…
Under integral restrictions on dilatations, it is proved existence theorems for the degenerate Beltrami equations with two characteristics and, in particular, to the Beltrami equations of the second type that play a great role in many…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.
The exact value of the separating Noether number of some finite abelian groups is determined, including the direct sums of cyclic groups of the same order.
We obtain an estimate for the main term of the counting function for numerical monoids.
We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…
We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem.
The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.
A new series representation of the Madelung constant is given. We represent Madelung constant as a sum of an exact term plus an exponentially fast converging series. The remarkable result is that even if the series part is discarded, one…
We give a new proof of Tietze Theorem on the convergence of infinite semi-regular continued fractions.
The Dirichlet eta function can be divided into $n$-th partial sum $\eta_{n}(s)$ and remainder term $R_{n}(s)$. We focus on the remainder term which can be approximated by the expression for $n$. And then, to increase reliability, we make…
We derive an expression for the generalized Bernoulli numbers in terms of the Bernoulli numbers involving the (exponential) complete Bell polynomials.
We introduce methods that allow to derive continuous-time versions of various discrete-time ergodic theorems. We then illustrate these methods by giving simple proofs and refinements of some known results as well as establishing new results…
This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is proved vividly.
A permutiple is a number which is an integer multiple of some permutation of its digits. A well-known example is 9801 since it is an integer multiple of its reversal, 1089. In this paper, we consider the permutiple problem in an entirely…
In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…
Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.