• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Of all publications in the section: 24
Sort:
by name
by year
Article
Yashunsky A. Moscow University Mathematics Bulletin. 2019. Vol. 74. No. 4. P. 135-140.

Systems of Boolean functions inducing algebras of Bernoulli distributions whose universal set has a single limit point are considered. A criterion for an algebra generated by a given distributions set to have a single limit point is proved.

Added: Sep 9, 2020
Article
Dagaev D. Moscow University Mathematics Bulletin. 2012. Vol. 67. No. 4. P. 182-184.
Added: Mar 21, 2016
Article
Sysoeva L. Moscow University Mathematics Bulletin. 2013. Vol. 68. No. 4. P. 211-214.

The problem of realization of Boolean functions by generalized α-formulas is considered. The notion of a universal set of generalized α-formulas is introduced for a given set of Boolean functions. Universal sets of generalized α-formulas are constructed for the set of constant-preserving Boolean functions.

Added: Feb 28, 2017
Article
Mikhailovich A. Moscow University Mathematics Bulletin. 2012. Vol. 67. No. 1. P. 41-45.

Closed classes of functions of three-valued logic whose generating systems include nonmonotone symmetric functions taking values in the set {0,1} are studied. It is shown that in some cases the problems of existence of a basis and existence of a finite basis can be reduced to a similar problem for reduced generated systems.

Added: Oct 30, 2012
Article
Dagaev D. Moscow University Mathematics Bulletin. 2011. Vol. 66. No. 3. P. 133-135.
Added: Mar 21, 2016
Article
Sysoeva L. Moscow University Mathematics Bulletin. 2017. Vol. 72. No. 2. P. 61-69.

The problem of realization of Boolean functions by initial Boolean automata with constant states and n inputs is considered. Such automata are those whose output function coincides with one of n-ary constant Boolean functions 0 or 1 in all states. The exact value of the maximum number of n-ary Boolean functions, where n > 1, realized by an initial Boolean automaton with three constant states and n inputs is obtained.

Added: May 17, 2017
Article
Lyulko Y. Moscow University Mathematics Bulletin. 2012. Vol. 67. No. 4. P. 164-169.

The maximal inequality for the skew Brownian motion being a generalization of the wellknown inequalities for the standard Brownian motion and its module is obtained in the paper. The proof is based on the solution to an optimal stopping problem for which we find the cost function and optimal stopping time.

Added: Dec 23, 2013
Article
Shitov Y. Moscow University Mathematics Bulletin. 2011. Vol. 66. No. 5. P. 227-229.

We present an example of a 6 × 6 matrix A such that rk t (A) = 4, rk K (A) = 5. This disproves the conjecture formulated by M. Chan, A. Jensen, and E. Rubei.

Added: Feb 23, 2016
Article
Shafarevich A. Moscow University Mathematics Bulletin. 2019. Vol. 74. No. 5. P. 209-211.

Let X be an affine toric variety over an algebraically closed field of characteristic zero. Orbits of connected component of identity of automorphism group in terms of dimensions of tangent spaces of the variety X are described. A formula to calculate these dimensions is presented.

Added: Sep 10, 2021
Article
Fufaev V. Moscow University Mathematics Bulletin. 2017. Vol. 72. No. 1. P. 15-23.

The geometry of level lines of harmonic functions being real parts of some Abelian integrals is studied. Such harmonic functions appear in the study of asymptotics of solutions to second-order differential equations, and the corresponding level lines are related both to the distribution of eigenvalues of a non-self-adjoint Sturm–Liouville problem and to location of trajectories of the corresponding quadratic differentials.

Added: Oct 31, 2019
Article
Sysoeva L. Moscow University Mathematics Bulletin. 2016. Vol. 71. No. 4. P. 140-145.

The problem of realization of Boolean functions by initial Boolean automata with two constant states and n inputs is considered. An initial Boolean automaton with two constant states and n inputs is an initial automaton with output such that in all states the output functions are n-ary constant Boolean functions 0 or 1. The maximum cardinality of set of n-ary Boolean functions, where n > 1, realized by an initial Boolean automaton with two constant states and n inputs is obtained.

Added: Feb 28, 2017
Article
Tkachenko A. Moscow University Mathematics Bulletin. 2014. Vol. 69. No. 1. P. 37-40.

This paper is focused on a multichannel queueing system with heterogeneous servers and regenerative input flow operating in a random environment. The environment can destroy the whole system and the system is reconstructed after that. The necessary and sufficient ergodicity condition is obtained for the system.

Added: Aug 20, 2014
Article
Tkachenko A. Moscow University Mathematics Bulletin. 2013. Vol. 68. No. 2. P. 93-97.

This paper is devoted to $M|GI|1|\infty$ queueing system with unreliable server and customer service times depending on the system state. Condition of ergodicity and generating function are found in the stationary state.

Added: Mar 13, 2014
Article
Горинов А. Г. Moscow University Mathematics Bulletin. 1997. № 5. С. 40-41.
Added: Jan 30, 2012
Article
Samokhin A. S. Moscow University Mathematics Bulletin. 2014. Vol. 69. No. 2. P. 84-87.

The trajectory of expedition to Mars and its satellite Phobos with return to the Earth is optimized. The attraction of the Sun, or the Earth, or Mars is considered at each part of the trajectory. The Earth and Mars positions correspond to ephemerides DE424, and the position of Phobos corresponds to ephemerides MAR097. Not more than 6 impulses are assumed on the trajectory. The spacecraft must start from the Earth in the period of 2020–2030 and stay at Phobos at least for 30 days. The total time of the expedition is limited to 1500 days. The characteristic velocity is minimized.

Added: Dec 8, 2016
Article
Garazha A. Moscow University Mathematics Bulletin. 2016. Vol. 71. No. 5. P. 196-199.

Orbits of the automorphism group of a finitely generated module over a principal ideal ring are described in terms of canonical representatives and by a complete system of invariants. For a primary module, a natural bijection to a sum of two Young diagrams is established for the set of orbits and the set of partitions of the Young diagram corresponding to the module, which allows us to calculate the number of orbits.

Added: Apr 28, 2020
Article
N. Ya. Amburg, Kreines E. M., Shabat G. B. Moscow University Mathematics Bulletin. 2017. Vol. 72. No. 4. P. 154-160.

A combinatorial proof that the number of points of the space Mо,n(Fq) satisfies the recurrent formula for the Poincaré polynomials of the space Mо,n(C) is obtained.

Original Russian Text © N.Ya. Amburg, E.M. Kreines, and G.B. Shabat, 2017, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2017, Vol. 72, No. 4, pp. 20–27.

Added: Dec 13, 2018
Article
Sysoeva L. Moscow University Mathematics Bulletin. 2019. Vol. 74. No. 6. P. 241-245.

The problem of realization of Boolean functions by initial Boolean automata with constant states and n inputs is considered. Initial Boolean automaton with constant states and n inputs is an initial automaton with output such that in all states the output functions are n-ary constant Boolean functions 0 or 1. An example of an initial Boolean automaton with the minimum number of constant states and n inputs realizing the maximum possible number of n-ary Boolean fonctions, where n ≥ 3, is constructed.

Added: Nov 22, 2020
Article
Boldin M., Esaulov D. Moscow University Mathematics Bulletin. 2014. Vol. 69. No. 1. P. 29-32.

The local qualitative robustness of GM-tests against outliers in the autoregression model is studied in the paper. A local scheme of data contamination by independent outliers with the intensity O(n−1/2) is considered. The qualitative robustness in terms of power equicontinuity is obtained. The GM-tests asymptotically optimal in the maximin sense are constructed.

Added: Oct 17, 2016
Article
Kochergin V. V., Kochergin D. V. Moscow University Mathematics Bulletin. 2016. Vol. 71. No. 2. P. 55-60.

The problem of the complexity of word assembly is studied. The complexity of the word refers to the minimum number of concatenation operations sufficient to obtain this word on the basis of one-letter words over a finite alphabet $A$ (repeated use of the received words is permitted). Let $L_A^c(n)$ be maximum complexity of words of length~$n$ over a finite alphabet $A$. In this paper, we establish that $ L_A^c(n) = \frac n {\log_{|A|} n} \left( 1 + (2+o(1)) \frac {\log_2 \log_2 n}{\log_2 n} \right). $

Added: Oct 8, 2018
Article
Esaulov D. Moscow University Mathematics Bulletin. 2012. Vol. 67. No. 2. P. 79-81.

The paper deals with properties of GM-estimators and GM-tests for linear hypotheses in AR(p)-processes when observations contain outliers. In particular, we obtain the marginal distribution of test statistics, which allows us to prove the robustness of these GM-tests. The scheme of data contamination by additive single outliers with the intensity O(n−1/2), where n is the data level, is considered.

Added: Oct 19, 2016
1 2