Open Access Open Access  Restricted Access Access granted  Restricted Access Subscription Access

Vol 74, No 1 (2019)

Article

Construction of an Infinite Set of Classes of Partial Monotone Functions of Multi-Valued Logic

Dudakova O.S.

Abstract

Partial functions of the k-valued logic monotone with respect to an arbitrary partially ordered set with the least and largest elements and distinct from a lattice are considered. It is shown that the set of closed classes of partial monotone functions containing a precomplete in Pk class of everywhere determined monotone function is infinite.

Moscow University Mathematics Bulletin. 2019;74(1):1-4
pages 1-4 views

The Complexity of Solving Low Degree Equations over Ring of Integers and Residue Rings

Gashkov S.B., Gashkov I.B., Frolov A.B.

Abstract

It is proved that for an arbitrary polynomial \(f\left( x \right) \in {\mathbb{Z}_{{p^n}}}\left[ X \right]\) of degree d the Boolean complexity of calculation of one its root (if it exists) equals O(dM(nλ(p))) for a fixed prime p and growing n, where λ(p) = ⌈log2p⌉, and M(n) is the Boolean complexity of multiplication of two binary n-bit numbers. Given the known decomposition of this number into prime factors n = m1...mk, \({m_i} = p_i^{{n_i}}\), i = 1,..., k, with fixed k and primes pi, i = 1,..., k, and growing n, the Boolean complexity of calculation of one of solutions to the comparison f(x) = 0 mod n equals O(dM(λ(n))). In particular, the same estimate is obtained for calculation of one root of any given degree in the residue ring Zm. As a corollary, it is proved that the Boolean complexity of calculation of integer roots of a polynomial f(x) is equal to Od(M(n)), where \(f\left( x \right) = {a_d}{x^d} + {a_{d - 1}}{x^{d - 1}} + ... + {a_0},{a_i} \in \mathbb{Z}\) , |ai| < 2n, i = 0,..., d.

Moscow University Mathematics Bulletin. 2019;74(1):5-13
pages 5-13 views

Remark on Coding in Algebras with Strong Filtration

Latyshev V.N.

Abstract

The way of communication coding using “multiplicative gammation” in algebras with strong filtration is proposed. This class of algebras was introduced earlier by the author for needs of Gröbner–Shirshov bases theory in a wide context. It includes semigroup algebras of ordered semigroups and universal enveloping algebras of Lie algebras, in particular, a polynomial algebra and a free associative algebra.

Moscow University Mathematics Bulletin. 2019;74(1):14-19
pages 14-19 views

Oscillation, Rotatability, and Wandering Characteristic Indicators for Differential Systems Determining Rotations of Plane

Sergeev I.N.

Abstract

The oscillation, rotatability, and wandering characteristic indicators of Lyapunov type are studied for two-dimensional linear homogeneous differential systems determining rotations of the phase plane. A complete set of order relations between them is obtained. For each of those indicators it is established whether it is continuous or discontinuous as a function of the coefficients of the system.

Moscow University Mathematics Bulletin. 2019;74(1):20-24
pages 20-24 views

Deduction Normalization Theorem for Sette’s Logic and Its Modifications

Petrukhin Y.I.

Abstract

In this paper we formulate natural deduction systems for Sette’s three-valued paraconsistent logic P1 and some related logics. For presented calculi we prove the soundness, completeness, and normalization theorems.

Moscow University Mathematics Bulletin. 2019;74(1):25-31
pages 25-31 views

Solvability of the Problem of Completeness of Automaton Basis Depending on its Boolean Part

Babin D.N.

Abstract

We consider the problem of completeness of systems of automaton functions with operations of superposition and feedback of the formΦ ∪ ν, where Φ ⊆ P2, and ν is finite. The solution of this problem leads to separation of the lattice of closed Post classes into strong ones (whose presence in the system under consideration guarantees the solvability of the completeness problem of finite bases) and weak ones (whose presence in the system under consideration does not guarantee this solvability). It turns out that the classifications of bases by completeness and A-completeness properties coincide. The paper describes this classification.

Moscow University Mathematics Bulletin. 2019;74(1):32-34
pages 32-34 views

On a Certain Mean Value Theorem

Chubarikov V.N.

Abstract

Asymptotics for mean values of complete rational trigonometric sums modulo a power of a prime number are obtained. For polynomials of one variable these asymptotics are not improvable in the degree of averaging of those sums.

Moscow University Mathematics Bulletin. 2019;74(1):35-37
pages 35-37 views

Asymptotics of Fundamental Solutions to Sturm–Liouville Problem with Respect to Spectral Parameter

Vladykina V.E.

Abstract

We consider the Sturm–Liouville equation

\( - {\left( {{r^2}y'} \right)^\prime } + py' + qy = {\lambda ^2}{\rho ^2}y,\;x \in \left[ {a,b} \right] \subset \mathbb{R}\)
where λ2 is a spectral parameter, r and ρ are positive functions while p and q are complex-valued ones. An asymptotic representation for the fundamental system of solutions with respect to the spectral parameter λ → ∞ is obtained in the half-planes Im λ ≥ const and Im λ ≤ const under the following conditions on the coefficients:
\(p \in {L_1}\left[ {a,b} \right],q \in W_2^{ - 1}\left[ {a,b} \right],\rho 'u,r'u,pu \in {L_1}\left[ {a,b} \right],where\;u\int {qdx} \)
and the antiderivative is understood in the sense of distributions.

Moscow University Mathematics Bulletin. 2019;74(1):38-41
pages 38-41 views