Mixed complexes of iron (III)—thiocyanate with some nitrogen and oxygen donors and their analytical applications

Methods for the determination of iron (III) as thiocyanate complex in the presence of neutral donors like isoquinoline and antipyrine have been developed. The two methods are of equal sensitivity (ε=18,000±100 lit. mole^?1 cm^?1) but operate at widely different hydrogen ion concentrations ranging from 10^?5 N(pH 5·0) to 7N. The interference of various foreign substances has been studied in the two methods. The application of these methods in the analysis of alloys and commercial HCl for iron has been explored and the composition of the extracting species established.     

Calculating the Isotropic Subspace of a Symmetric Quasi-Definite Matrix

Solutions to the sesquilinear matrix equation X*DX + AX + X*B + C = 0, where all matrices are of size n × n, are put in correspondence with n-dimensional neutral (or isotropic) subspaces of the associated matrix M of order 2n. A way of constructing such subspaces is proposed for when M is a symmetric quasi-definite matrix of the (n, n) type.     

Vinyl polymerization

The thermodynamic interaction parameters of the systems, poly (ethyl methacrylate) /n-butanol and poly (methyl methacrylate) /n-butyl bromide and poly (methyl methacrylate)/isoamyl acetate were determined by methods involving phase separation and compared critically with values obtained by other methods. The validity of some of the well-known theoretical equations in the region of phase separation is considered.     

The influence of the integral manifold shape on the onset of relaxation oscillations

The relaxation oscillations are studied of a singularly perturbed system of ordinary differential equations with m slow and n fast variables (m × n) in the two cases: (1) m = n = 1 (1 × 1) and (2) m = 2, n = 1 (2 × 1). As sufficient conditions for the existence of relaxation oscillations there some general class is described of the functions determining the slow manifold for this system.     

Diversity vectors of balls in graphs and estimates of the components of the vectors

The diversity vectors of balls are considered (the ith component of a vector of this kind is equal to the number of different balls of radius i) for the usual connected graphs and the properties of the components of the vectors are studied. The sharp upper and lower estimates are obtained for the number of different balls of a given radius in the n-vertex graphs (trees) and n-vertex trees (graphs with n ? 2d) of diameter d. It is shown that the estimates are precise in every graph regardless of the radius of balls. It is proven a necessary and sufficient condition is given for the existence of an n-vertex graph of diameter d with local (complete) diversity of balls.     

A note on the sampling distribution of the information content of the priority vector of a consistent pairwise comparison judgment matrix of AHP

The sampling distribution of the information content (entropy) of the priority vector of a consistent pairwise comparison judgment matrix, PCJM(n) using the Analytic Hierarchy Process (AHP) is studied by Noble and Sanchez, where n is the number of criteria associated with the matrix. They concluded simulation experiments with sample size of 1000 and found that the distribution is normal for n=4,5,...,15. When we increased the sample size to 2000, to 3000,..., to 8000, we found that the sampling distribution of entropy is not normal for all n, n=4,5,...,15. By using BestFit software system and using sample sizes of 8000, we found that the best-fitted and the second-best-fitted distributions of the entropy are either Weibull or normal for n?4. If we consider the most number of best fitted distributions as the criteria, then Weibull should be considered as the sampling distribution of the entropy for n?4. For n=3, beta should be considered as the best-fitted distribution.     

Generalized entropy in expanded semigroups and in algebras with neutral element

The complex product of (non-empty) subalgebras of a given algebra from a variety \(\mathcal{V}\) is again a subalgebra if and only if the variety \(\mathcal{V}\) has the so-called generalized entropic property. This paper is devoted to algebras with a neutral element or with a semigroup operation. We investigate relationships between the generalized entropic property and the commutativity of the fundamental operations of the algebra. In particular, we characterize the algebras with a neutral element that have the generalized entropic property. Furthermore, we show that, similarly as for n-monoids and n-groups, for inverse semigroups, the generalized entropic property is equivalent to commutativity.     

A characterization of <Emphasis Type="Italic">n</Emphasis>-associative,monotone, idempotent functions on an interval that have neutral elements

We investigate monotone idempotent n-ary semigroups and provide a generalization of the Czogala–Drewniak Theorem, which describes the idempotent monotone associative functions having a neutral element. We also present a complete characterization of idempotent monotone n-associative functions on an interval that have neutral elements.     

Non-Hermitian matrices of even order and neutral subspaces of half the dimension

Consider the sesquilinearmatrix equation X*DX + AX + X*B + C = 0, where all the matrices are square and have the same order n. With this equation, we associate a block matrix M of double order 2n. The solvability of the above equation turns out to be related to the existence of n-dimensional neutral subspaces for the matrix M. We indicate sufficiently general conditions ensuring the existence of such subspaces.     

On the boundedness of operators rearranging the Haar system in the spacesL p

Operators of the form Tπχ _n ^k =χ _n ^πn(k) where {χ _n ^k (t)} is the Haar system and π_n is a rearrangement of the numbers 1,2, ?.2ⁿ (n=1,2,?) are studied. Criterion for the boundedness of such operators from the spaceL _p intoL _p is obtained.     

A criterion of smoothness at infinity for an arithmetic quotient of the future tube

Let Γ be an arithmetic group of affine automorphisms of the n-dimensional future tube T. It is proved that the quotient space T/Γ is smooth at infinity if and only if the group Γ is generated by reflections and the fundamental polyhedral cone (“Weyl chamber”) of the group dΓ in the future cone is a simplicial cone (which is possible only for n ≤ 10). As a consequence of this result, a smoothness criterion for the Satake–Baily–Borel compactification of an arithmetic quotient of a symmetric domain of type IV is obtained.     

On the Skeleton of the Polytope of Pyramidal Tours

We consider the skeleton of the polytope of pyramidal tours. A Hamiltonian tour is called pyramidal if the salesperson starts in city 1, then visits some cities in increasing order of their numbers, reaches city n, and returns to city 1 visiting the remaining cities in decreasing order. The polytope PYR(n) is defined as the convex hull of the characteristic vectors of all pyramidal tours in the complete graph K _n . The skeleton of PYR(n) is the graph whose vertex set is the vertex set of PYR(n) and the edge set is the set of geometric edges or one-dimensional faces of PYR(n). We describe the necessary and sufficient condition for the adjacency of vertices of the polytope PYR(n). On this basis we developed an algorithm to check the vertex adjacency with linear complexity. We establish that the diameter of the skeleton of PYR(n) equals 2, and the asymptotically exact estimate of the clique number of the skeleton of PYR(n) is Θ(n²). It is known that this value characterizes the time complexity in a broad class of algorithms based on linear comparisons.     

Asymptotic behavior in neutral difference equations with negative coefficients

In this paper, we study the asymptotic behavior of the solutions of a neutral difference equation of the form $\Delta [x(n) + cx(\tau (n))] - p(n)x)(\sigma (n)) = 0,$ , where τ(n) is a general retarded argument, σ(n) is a general deviated argument, c ∈ ?, (?p(n)) _n≥0 is a sequence of negative real numbers such that p(n) ≥ p, p ∈ ?₊, and Δ denotes the forward difference operator Δx(n) = x(n+1)?x(n).     

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 ) ).     

Numerical algorithm for solving quadratic matrix equations of a certain class

A relationship is found between the solutions to the quadratic matrix equation X ^T DX + AX + X ^T B + C = 0, where all the matrix coefficients are n × n matrices, and the neutral subspaces of the 2n × 2n matrix \(M = \left( \begin{gathered} CA \\ BD \\ \end{gathered} \right) \) . This relationship is used to design an algorithm for solving matrix equations of the indicated type. Numerical results obtained with the help of the proposed algorithm are presented.     

On the summability factors of infinite series

The author has established that if [λ_n] is a convex sequence such that the series Σn ^-1λ_n is convergent and the sequence {K _n} satisfies the condition |K _n|=O[log(n+1)]^k(C, 1),k?0, whereK _n denotes the (R, logn, 1) mean of the sequence {n log (n+1)a _n}, then the series Σlog(n+1)^1-kλ_n a _n is summable |R, logn, 1|. The result obtained for the particular casek=0 generalises a previous result of the author [1].     

Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts

An exclusive-OR sum of pseudoproducts (ESPP) is a modufo-2 sum of products of affine (linear) Boolean functions. The length of an ESPP is defined as the number of summands in this sum; the length of a Boolean function in the class of ESPPs is the minimum length of an ESPP representing this function. The Shannon length function L ^ESPP(n) on the set of Boolean functions in the class of ESPPs is considered; it is defined as the maximum length of a Boolean function of n variables in the class of ESPPs. It is proved that L ^ESPP(n) = ? (2 ⁿ /n ²). The quantity L ^ESPP(n) also equals the least number l such that any Boolean function of n variables can be represented as a modulo-2 sum of at most l multiaffine functions.     

Extremal behavior of recurrent random sequences

A process Y _n , n ≥ 1, satisfying the stochastic recurrent equation Y _n = A _n Y _n?1 + B _n , n ≥ 1, Y ₀ ≥ 0, is studied in the paper; here (A _n , B _n ), n ≥ 1, are independent identically distributed pairs of nonnegative random variables. The cases when the values A _n have a lognormal and log-Laplace distributions are considered. The tail index κ (for a stationary distribution) and the extremal index ? are studied. In the lognormal case, κ is determined and some useful properties of ? are established. In the log-Laplace case the both characteristics are obtained in explicit form.     

On the metric type of measurable functions and convergence in distribution

In the present paper, sequences of real measurable functions defined on a measure space ([0, 1], µ), where µ is the Lebesgue measure, are studied. It is proved that for every sequence f_n that converges to f in distribution, there exists a sequence of automorphisms S_n of ([0, 1], µ) such that f_n(S_n(t)) converges to f(t) in measure. Connection with some known results is also discussed.     

Numerical algorithm for solving sesquilinear matrix equations of a certain class

A relationship is found between the solutions to the sesquilinear matrix equation X*DX + AX + X*B + C = 0, where all the matrix coefficients are n × n matrices, and the neutral subspaces of the 2n × 2n matrix \(M = \left( {\begin{array}{*{20}c} C & A \\ B & D \\ \end{array} } \right)\) . This relationship is used to design an algorithm for solving matrix equations of the indicated type. Numerical results obtained with the help of the proposed algorithm are presented.