


Vol 74, No 1 (2019)
- Year: 2019
- Articles: 8
- URL: https://journal-vniispk.ru/0027-1322/issue/view/10054
Article
Construction of an Infinite Set of Classes of Partial Monotone Functions of Multi-Valued Logic
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.



The Complexity of Solving Low Degree Equations over Ring of Integers and Residue Rings
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.



Remark on Coding in Algebras with Strong Filtration
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.



Oscillation, Rotatability, and Wandering Characteristic Indicators for Differential Systems Determining Rotations of Plane
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.






Solvability of the Problem of Completeness of Automaton Basis Depending on its Boolean Part
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.



On a Certain Mean Value Theorem
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.



Asymptotics of Fundamental Solutions to Sturm–Liouville Problem with Respect to Spectral Parameter
Abstract
We consider the Sturm–Liouville equation


