Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits

The problem of complexity of word assembly is studied. The complexity of a word means the minimal number of concatenation operations sufficient to obtain this word in the basis of oneletter words over a finite alphabet A (repeated use of obtained words is permitted). Let LA(n) be the maximal complexity of words of length n over a finite alphabet A. In this paper we prove that Шn) = (l + (2 + ₀ ( 1 ) ).     

Lower bounds for polynomials of many variables

A polynomial P(ξ) = P(ξ₁,..., ξ _n ) is said to be almost hypoelliptic if all its derivatives D ^ν P(ξ) can be estimated from above by P(ξ) (see [16]). By a theorem of Seidenberg-Tarski it follows that for each polynomial P(ξ) satisfying the condition P(ξ) > 0 for all ξ ∈ R ⁿ , there exist numbers σ > 0 and T ∈ R¹ such that P(ξ) ≥ σ(1 + |ξ|) ^T for all ξ ∈ R ⁿ . The greatest of numbers T satisfying this condition, denoted by ST(P), is called Seidenberg-Tarski number of polynomial P. It is known that if, in addition, P ∈ I _n , that is, |P(ξ)| → ∞ as |ξ| → ∞, then T = T(P) > 0. In this paper, for a class of almost hypoelliptic polynomials of n (≥ 2) variables we find a sufficient condition for ST(P) ≥ 1. Moreover, in the case n = 2, we prove that ST(P) ≥ 1 for any almost hypoelliptic polynomial P ∈ I₂.     

Conjugacy classes in Möbius groups

Let \({\mathbb H^{n+1}}\) denote the n + 1-dimensional (real) hyperbolic space. Let \({\mathbb {S}^{n}}\) denote the conformal boundary of the hyperbolic space. The group of conformal diffeomorphisms of \({\mathbb {S}^{n}}\) is denoted by M(n). Let M _o (n) be its identity component which consists of all orientation-preserving elements in M(n). The conjugacy classification of isometries in M _o (n) depends on the conjugacy of T and T ^?1 in M _o (n). For an element T in M(n), T and T ^?1 are conjugate in M(n), but they may not be conjugate in M _o (n). In the literature, T is called real if T is conjugate in M _o (n) to T ^?1. In this paper we classify real elements in M _o (n). Let T be an element in M _o (n). Corresponding to T there is an associated element T _o in SO(n + 1). If the complex conjugate eigenvalues of T _o are given by \({\{e^{i\theta_j}, e^{-i\theta_j}\}, 0 < \theta_j \leq \pi, j=1,\ldots,k}\) , then {θ₁, . . . , θ _k } are called the rotation angles of T. If the rotation angles of T are distinct from each-other, then T is called a regular element. After classifying the real elements in M _o (n) we have parametrized the conjugacy classes of regular elements in M _o (n). In the parametrization, when T is not conjugate to T ^?1 , we have enlarged the group and have considered the conjugacy class of T in M(n). We prove that each such conjugacy class can be induced with a fibration structure.     

Paranormal Elements in Normed Algebra

For a normed algebra A and natural numbers k we introduce and investigate the ∥ · ∥ closed classes P _k (A). We show that P₁(A) is a subset of P _k (A) for all k. If T in P₁(A), then Tⁿ lies in P₁(A) for all natural n. If A is unital, U, V ∈ A are such that ∥U∥ = ∥V∥ = 1, VU = I and T lies in P _k (A), then UTV lies in P _k (A) for all natural k. Let A be unital, then 1) if an element T in P₁(A) is right invertible, then any right inverse element T^?1 lies in P₁(A); 2) for ßßIßß = 1 the class P₁(A) consists of normaloid elements; 3) if the spectrum of an element T, T ∈ P₁(A) lies on the unit circle, then ∥TX∥ = ∥X∥ for all X ∈ A. If A = B(H), then the class P₁(A) coincides with the set of all paranormal operators on a Hilbert space H.     

Rates of decay in the classical Katznelson-Tzafriri theorem

The Katznelson-Tzafriri Theorem states that, given a power-bounded operator T, ∥Tⁿ(I ? T)∥ → 0 as n → ∞ if and only if the spectrum σ(T) of T intersects the unit circle T in at most the point 1. This paper investigates the rate at which decay takes place when σ(T) ∩ T = {1}. The results obtained lead, in particular, to both upper and lower bounds on this rate of decay in terms of the growth of the resolvent operator R(e^iθ, T) as θ → 0. In the special case of polynomial resolvent growth, these bounds are then shown to be optimal for general Banach spaces but not in the Hilbert space case.     

Equicontinuity of maps on a dendrite with finite branch points

Let(T, d) be a dendrite with finite branch points and f be a continuous map from T to T. Denote byω(x,f) and P(f) the ω-limit set of x under f and the set of periodic points of,respectively. Write Ω(x,f) = {y| there exist a sequence of points x_k E T and a sequence of positive integers n_1 n_2 … such that lim_(k→∞)x_k=x and lim_(k→∞)f~(n_k)(x_k) =y}. In this paper, we show that the following statements are equivalent:(1) f is equicontinuous.(2) ω(x, f) = Ω(x,f) for any x∈T.(3) ∩_(n=1)~∞f~n(T) = P(f),and ω(x,f)is a periodic orbit for every x ∈ T and map h : x→ω(x,f)(x ET)is continuous.(4) Ω(x,f) is a periodic orbit for any x∈T.     

Slow entropy for some smooth flows on surfaces

We study slow entropy in some classes of smooth mixing flows on surfaces. The flows we study can be represented as special flows over irrational rotations and under roof functions which are C² everywhere except one point (singularity). If the singularity is logarithmic asymmetric (Arnol’d flows), we show that in the scale a_n(t) = n(log n)^t slow entropy equals 1 (the speed of orbit growth is n log n) for a.e. irrational α. If the singularity is of power type (x^?γ, γ ∈ (0, 1)) (Kochergin flows), we show that in the scale a_n(t) = n^t slow entropy equals 1 + γ for a.e. α.We show moreover that for local rank one flows, slow entropy equals 0 in the n(log n)^t scale and is at most 1 for scale n^t. As a consequence we get that a.e. Arnol’d and a.e Kochergin flow is never of local rank one.     

On likelihood ratio ordering of parallel systems with exponential components

Let T(λ₁,...,λ _n ) be the lifetime of a parallel system consisting of exponential components with hazard rates λ₁,...,λ _n , respectively. For systems with only two components, Dykstra et. al. (1997) showed that if (λ₁, λ₂) majorizes (γ₁, γ₂), then, T(λ₁, λ₂) is larger than T(γ₁, γ₂) in likelihood ratio order. In this paper, we extend this theorem to general parallel systems. We introduce a new partial order, the so-called d-larger order, and show that if (λ₁,...,λ _n ) is d-larger than (γ₁,...,γ _n ), then T(λ₁,...,λ _n ) is larger than T(γ₁,...,γ _n ) in likelihood ratio order.     

Some results on the annihilator graph of a commutative ring

Let R be a commutative ring. The annihilator graph of R, denoted by AG(R), is the undirected graph with all nonzero zero-divisors of R as vertex set, and two distinct vertices x and y are adjacent if and only if ann _R (xy) ≠ ann _R (x) ∪ ann _R (y), where for z ∈ R, ann _R (z) = {r ∈ R: rz = 0}. In this paper, we characterize all finite commutative rings R with planar or outerplanar or ring-graph annihilator graphs. We characterize all finite commutative rings R whose annihilator graphs have clique number 1, 2 or 3. Also, we investigate some properties of the annihilator graph under the extension of R to polynomial rings and rings of fractions. For instance, we show that the graphs AG(R) and AG(T(R)) are isomorphic, where T(R) is the total quotient ring of R. Moreover, we investigate some properties of the annihilator graph of the ring of integers modulo n, where n ? 1.     

Nonlinear trigonometric approximations of multivariate function classes

Order-sharp estimates are established for the best N-term approximations of functions from Nikol’skii–Besov type classes B_pq^sm(T^k) with respect to the multiple trigonometric system T^(k) in the metric of L_r(T^k) for a number of relations between the parameters s, p, q, r, and m (s = (s₁,..., s_n) ∈ R₊ⁿ, 1 ≤ p, q, r ≤ ∞, m = (m₁,..., m_n) ∈ Nⁿ, k = m₁ +... + m_n). Constructive methods of nonlinear trigonometric approximation—variants of the so-called greedy algorithms—are used in the proofs of upper estimates.     

On convex hull of Gaussian samples

Let X _i = {X _i (t), t ∈ T} be i.i.d. copies of a centered Gaussian process X = {X(t), t ∈ T} with values in\( {\mathbb{R}^d} \) defined on a separable metric space T. It is supposed that X is bounded. We consider the asymptotic behavior of convex hulls

$ {W_n} = {\text{conv}}\left\{ {{X_1}(t), \ldots, {X_n}(t),\,\,t \in T} \right\} $

and show that, with probability 1,

$ \mathop {{\lim }}\limits_{n \to \infty } \frac{1}{{\sqrt {{2\ln n}} }}{W_n} = W $

(in the sense of Hausdorff distance), where the limit shape W is defined by the covariance structure of X: W = conv{K _t , t ∈ T}, Kt being the concentration ellipsoid of X(t). We also study the asymptotic behavior of the mathematical expectations E f(W _n ), where f is an homogeneous functional.

     

Equiconvergence of expansions in multiple Fourier series and in fourier integrals with “lacunary sequences of partial sums”

We investigate the equiconvergence on T^N = [?π, π)^N of expansions in multiple trigonometric Fourier series and in the Fourier integrals of functions f ∈ L_p(T^N) and g ∈ L_p(R^N), p > 1, N ≥ 3, g(x) = f(x) on T^N, in the case where the “partial sums” of these expansions, i.e., S_n(x; f) and J_α(x; g), respectively, have “numbers” n ∈ Z^N and α ∈ R^N (n_j = [α_j], j = 1,..., N, [t] is the integral part of t ∈ R¹) containing N ? 1 components which are elements of “lacunary sequences.”     

Designs associated with maximum independent sets of a graph

A (v, β _o , μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j ∈ V, i ≠ j and if i and j are not adjacent in G then there are exactly μ blocks containing i and j. In this paper, we study (v, β _o , μ)-designs over the graphs K _n × K _n , T(n)-triangular graphs, L ₂(n)-square lattice graphs, Petersen graph, Shrikhande graph, Clebsch graph and the Schläfli graph and non-existence of (v, β _o , μ)-designs over the three Chang graphs T ₁(8), T ₂(8) and T ₃(8).     

Automorphisms of Coxeter groups of type <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

A Coxeter system (W, S) is said to be of type K _n if the associated Coxeter graph Γ_S is complete on n vertices and has only odd edge labels. If W satisfies either of: (1) n = 3; (2) W is rigid; then the automorphism group of W is generated by the inner automorphisms of W and any automorphisms induced by Γ_S. Indeed, Aut(W) is the semidirect product of Inn(W) and the group of diagram automorphisms, and furthermore W is strongly rigid. We also show that if W is a Coxeter group of type K _n then W has exactly one conjugacy class of involutions and hence Aut(W) = Spec(W).     

On Extraction of Smooth Solutions of a Class of Almost Hypoelliptic Equations with Constant Power

A linear differential operator P(x, D) = P(x₁,... x _n , D₁,..., D _n ) = ∑_αγ_α(x)D^α with coefficients γ_α(x) defined in E ⁿ is called formally almost hypoelliptic in E ⁿ if all the derivatives D^ν_ξP(x, ξ) can be estimated by P(x, ξ), and the operator P(x, D) has uniformly constant power in Eⁿ. In the present paper, we prove that if P(x, D) is a formally almost hypoelliptic operator, then all solutions of equation P(x, D)u = 0, which together with some of their derivatives are square integrable with a specified exponential weight, are infinitely differentiable functions.     

Variational Problems with Unilateral Pointwise Functional Constraints in Variable Domains

We consider a sequence of convex integral functionals F_s: W¹,^p(Ω_s) → ? and a sequence of weakly lower semicontinuous and generally nonintegral functionals G_s: W¹,^p(Ω_s) → ?, where {Ω_s} is a sequence of domains in ?ⁿ contained in a bounded domain Ω ? ?ⁿ (n ≥ 2) and p > 1. Along with this, we consider a sequence of closed convex sets V_s = {v ∈ W¹,^p(Ω_s): v ≥ K_s(v) a.e. in Ω_s}, where K_s is a mapping from the space W¹,^p(Ω_s) to the set of all functions defined on Ω_s. We establish conditions under which minimizers and minimum values of the functionals F_s + G_s on the sets V_s converge to a minimizer and the minimum value of a functional on the set V = {v ∈ W¹,^p(Ω): v ≥ K(v) a.e. in Ω}, where K is a mapping from the space W¹,^p(Ω) to the set of all functions defined on Ω. These conditions include, in particular, the strong connectedness of the spaces W¹,^p(Ω_s) with the space W¹,^p(Ω), the condition of exhaustion of the domain Ω by the domains Ω_s, the Γ-convergence of the sequence {F_s} to a functional F: W¹,^p(Ω) → ?, and a certain convergence of the sequence {G_s} to a functional G: W¹,^p(Ω) → ?. We also assume some conditions characterizing both the internal properties of the mappings K_s and their relation to the mapping K. In particular, these conditions admit the study of variational problems with irregular varying unilateral obstacles and with varying constraints combining the pointwise dependence and the functional dependence of the integral form.     

A tournament approach to pattern avoiding matrices

We consider the following Turán-type problem: given a fixed tournament H, what is the least integer t = t(n,H) so that adding t edges to any n-vertex tournament, results in a digraph containing a copy of H. Similarly, what is the least integer t = t(T _n ,H) so that adding t edges to the n-vertex transitive tournament, results in a digraph containing a copy of H. Besides proving several results on these problems, our main contributions are the following:

• Pach and Tardos conjectured that if M is an acyclic 0/1 matrix, then any n × n matrix with n(log n) ^O(1) entries equal to 1 contains the pattern M. We show that this conjecture is equivalent to the assertion that t(T _n ,H) = n(log n) ^O(1) if and only if H belongs to a certain (natural) family of tournaments.
• We propose an approach for determining if t(n,H) = n(log n) ^O(1). This approach combines expansion in sparse graphs, together with certain structural characterizations of H-free tournaments. Our result opens the door for using structural graph theoretic tools in order to settle the Pach–Tardos conjecture.

     

Kazhdan-Lusztig cells in some weighted Coxeter groups

Let(W,S) be a Coxeter group with S = I■J such that J consists of all universal elements of S and that I generates a finite parabolic subgroup W_I of W with w_0 the longest element of W_I. We describe all the left cells and two-sided cells of the weighted Coxeter group(W,S,L) that have non-empty intersection with W_J,where the weight function L of(W, S) is in one of the following cases:(i) max{L(s) | s ∈J} min{L(t)|t∈I};(ii) min{L(s)|s ∈J} ≥L(w_0);(iii) there exists some t ∈ I satisfying L(t) L(s) for any s ∈I-{t} and L takes a constant value L_J on J with L_J in some subintervals of [1, L(w_0)-1]. The results in the case(iii) are obtained under a certain assumption on(W, W_I).     

On Excess-time Correlated Cumulative Processes

In this paper a class of correlated cumulative processes, B _s (t) = ∑^N(t)_i=1 H _s (X _i )X _i , is studied with excess level increments X _i ?s, where {N(t), t ?0} is the counting process generated by the renewal sequence T _n , T _n and X _n are correlated for given n, H _s (t) is the Heaviside function and s?0 is a given constant. Several useful results, for the distributions of B _s (t), and that of the number of excess (non-excess) increments on (0, t) and the corresponding means, are derived. First passage time problems are also discussed and various asymptotic properties of the processes are obtained. Transform results, by applying a flexible form for the joint distribution of correlated pairs (T _n , X _n ) are derived and inverted. The case of non-excess level increments, X _i < s, is also considered. Finally, applications to known stochastic shock and pro-rata warranty models are given.