2,897 research outputs found
Semiempirical methods for computing turbulent flows
Two semiempirical theories which provide a basis for determining the turbulent friction and heat exchange near a wall are presented: (1) the Prandtl-Karman theory, and (2) the theory utilizing an equation for the energy of turbulent pulsations. A comparison is made between exact numerical methods and approximate integral methods for computing the turbulent boundary layers in the presence of pressure, blowing, or suction gradients. Using the turbulent flow around a plate as an example, it is shown that, when computing turbulent flows with external turbulence, it is preferable to construct a turbulence model based on the equation for energy of turbulent pulsations
Subexponential estimations in Shirshov's height theorem (in English)
In 1993 E. I. Zelmanov asked the following question in Dniester Notebook:
"Suppose that F_{2, m} is a 2-generated associative ring with the identity
x^m=0. Is it true, that the nilpotency degree of F_{2, m} has exponential
growth?" We show that the nilpotency degree of l-generated associative algebra
with the identity x^d=0 is smaller than Psi(d,d,l), where Psi(n,d,l)=2^{18} l
(nd)^{3 log_3 (nd)+13}d^2. We give the definitive answer to E. I. Zelmanov by
this result. It is the consequence of one fact, which is based on combinatorics
of words. Let l, n and d>n be positive integers. Then all the words over
alphabet of cardinality l which length is greater than Psi(n,d,l) are either
n-divided or contain d-th power of subword, where a word W is n-divided, if it
can be represented in the following form W=W_0 W_1...W_n such that W_1 >'
W_2>'...>'W_n. The symbol >' means lexicographical order here. A. I. Shirshov
proved that the set of non n-divided words over alphabet of cardinality l has
bounded height h over the set Y consisting of all the words of degree <n.
Original Shirshov's estimation was just recursive, in 1982 double exponent was
obtained by A.G.Kolotov and in 1993 A.Ya.Belov obtained exponential estimation.
We show, that h<Phi(n,l), where Phi(n,l) = 2^{87} n^{12 log_3 n + 48} l. Our
proof uses Latyshev idea of Dilworth theorem application.Comment: 21 pages, Russian version of the article is located at the link
arXiv:1101.4909; Sbornik: Mathematics, 203:4 (2012), 534 -- 55
Inverse problems of symbolic dynamics
This paper reviews some results regarding symbolic dynamics, correspondence
between languages of dynamical systems and combinatorics. Sturmian sequences
provide a pattern for investigation of one-dimensional systems, in particular
interval exchange transformation. Rauzy graphs language can express many
important combinatorial and some dynamical properties. In this case
combinatorial properties are considered as being generated by substitutional
system, and dynamical properties are considered as criteria of superword being
generated by interval exchange transformation. As a consequence, one can get a
morphic word appearing in interval exchange transformation such that
frequencies of letters are algebraic numbers of an arbitrary degree.
Concerning multydimensional systems, our main result is the following. Let
P(n) be a polynomial, having an irrational coefficient of the highest degree. A
word (w=(w_n), n\in \nit) consists of a sequence of first binary numbers
of i.e. . Denote the number of different subwords
of of length by .
\medskip {\bf Theorem.} {\it There exists a polynomial , depending only
on the power of the polynomial , such that for sufficiently
great .
Quick search and synchronization algorithm for wideband noise-like signals
In this regard, the article proposes the fast search and synchronization algorithm for high-orbit satellite telecommunication systems when they are used as the information carriers of broadband noise-like signals with linear frequency modulation. The developed algorithm is based on the consideration of development peculiarities for these signal
- …